Dynamic RSA Problem in Spectrum Sliced Elastic Optical Path Network

Ireneusz Olszewski


Service time-varying traffic flexible optical networks require a dynamic bandwidth allocation in order to follow the source transmission rate. The problem of service time-varying traffic, assuming that the set of connection requests is not known in advance, is considered in this work. Connection requests arrive randomly with random duration of these connections. The considered dynamic RSA problem involves minimizing the probability of blocking additional slot requests on the ongoing connections while maintaining spectrum continuity constraints and non-overlapping spectrum assignment constraints between adjacent connections. The proposed algorithm determines the path with the required number of slots around the reference frequency for a connection request. An analysis of the network with time-varying traffic on the network connections was carried out on the basis of spectrum expansion/contraction schemes  which allow to determine average blocking probability of the additional slots requests on these connections. The obtained results have been  compared with those obtained by a well known algorithm that solves the static RSA problem.

Full Text:



X. Wan, N. Hua, X. Zeng, “Dynamic Routing and Spectrum Assignment in Spectrum –Flexible Transparent Optical Networks,”J. Opt. Commun. Netw, vol. 4, August 2012, pp. 603–613.

M. Klinkowski, K. Walkowiak, “Routing and Spectrum Assignment in Spectrum Sliced Optical Path Network,” IEEE Communications Letters, vol. 15, August 2011, pp. 884–886.

K. Christodoulopoulos, I. Tomkos, A.E. Varvarigos, ”Routing and Spectrum Allocation in OFDM-based Optical Networks with Elastic Bandwidth Allocation”. Telecommunications Conference (GLOBECOM 2010), 6-10 Dec. 2010.

K. Christodoulopoulos I. Tomkos, A.E. Varvarigos, “Routing and Spectrum Allocation Policies for Time-Varing Traffic in Flexible Optical Networks,” 16th International Conference, Optical Network Design and Modeling (ONDM), 17-20 April 2012.

I. Olszewski, “RSA Problem for Varying Traffic in Flexible Optical Networks,”. Image Processing & Communication, vol 19, no.1, 2014.

A. Kaufmann, “Graps, Dynamic Programming and Finite Games,” Academic Press, 1967, pp 270-280.

Y. Man-Ching, J. Weijia, Ch. Chi-chung, “Efficient Distributed QoS Routing Protocol for MPLS Networks,” 11th International Conference on Parallel and Distributed Systems, 2005


  • There are currently no refbacks.

International Journal of Electronics and Telecommunications
is a periodical of Electronics and Telecommunications Committee
of Polish Academy of Sciences

eISSN: 2300-1933