DocumentCode :
62691
Title :
Spectral and spatial 2D fragmentation-aware routing and spectrum assignment algorithms in elastic optical networks [invited]
Author :
Yawei Yin ; Huan Zhang ; Mingyang Zhang ; Ming Xia ; Zuqing Zhu ; Dahlfort, Stefan ; Yoo, S.J.B.
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of California, Davis, Davis, CA, USA
Volume :
5
Issue :
10
fYear :
2013
fDate :
Oct. 2013
Abstract :
This paper investigates the spectrum fragmentation issue, which undermines the bandwidth efficiency in elastic optical networks. After categorizing the two-dimensional fragmentation problem as the fragmentation and misalignment subproblems, this paper proposes joint routing and spectrum assignment (RSA) algorithms to alleviate the spectral fragmentation in the lightpath provisioning process. The time complexity of the two proposed algorithms are analyzed in detail, and both algorithms can run in 0(kdnC log C) time, where k is the number of the shortest path in the routing algorithm, d is the maximum node degree in the network, n is the number of nodes in the network, and C is the link capacity expressed as the number of spectral slots. Simulation results indicate that the proposed fragmentation-aware (FA) RSA algorithm and the FA algorithm with congestion avoidance (CA) outperform the existing schemes in terms of blocking probability (BP) reduction. Compared with the benchmark K-shortest-path routing and first-fit assignment (KSP-FF) algorithm, the proposed FA and FA-CA algorithms can achieve a BP reduction of [100%, 4.43%] and [100%, 6.45%], respectively, according to the traffic load in a sample NSFNET topology.
Keywords :
communication complexity; graph theory; optical fibre networks; probability; public key cryptography; radio spectrum management; telecommunication network routing; telecommunication security; telecommunication traffic; BP reduction; FA RSA algorithm; FA-CA algorithms; KSP-FF algorithm; NSFNET topology; RSA algorithms; bandwidth efficiency; blocking probability; congestion avoidance; elastic optical networks; first-fit assignment; fragmentation-aware RSA algorithm; joint routing and spectrum assignment; k-shortest-path routing; lightpath provisioning process; link capacity; misalignment subproblems; network nodes; spatial 2D fragmentation-aware routing and spectrum assignment algorithms; spectral 2D fragmentation-aware routing and spectrum assignment algorithms; spectral slots; time complexity; traffic load; two-dimensional fragmentation problem; Algorithm design and analysis; Bandwidth; Optical fiber networks; Optimized production technology; Routing; Telecommunication traffic; Time complexity; Algorithm; Elastic optical networking; Routing and spectrum assignment; Spectrum fragmentation;
fLanguage :
English
Journal_Title :
Optical Communications and Networking, IEEE/OSA Journal of
Publisher :
ieee
ISSN :
1943-0620
Type :
jour
DOI :
10.1364/JOCN.5.00A100
Filename :
6645104
Link To Document :
بازگشت