Adaptive routing and spectrum allocation in elastic optical networks

被引:27
作者
Alyatama, Anwar [1 ]
Alrashed, Ibrahim [1 ]
Alhusaini, Ammar [1 ]
机构
[1] Kuwait Univ, Dept Comp Engn, POB 5969, Safat 13060, Kuwait
关键词
Orthogonal frequency-division multiplexing; Routing and spectrum allocation; DESIGN;
D O I
10.1016/j.osn.2016.10.001
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Elastic optical networks (EONs) have emerged as the preferred technology for future optical networks because of its ability to manage network resources efficiently and provide better spectrum utilization to cope with recent rapid changes in traffic behavior and the tremendous growth in bandwidth demand. An important factor in the success of EONs is routing and spectrum allocation (RSA). In this paper, we propose an adaptive RSA algorithm for EONs. The algorithm relies on the history of carried calls to learn the near-optimal searching sequence of the optical spectrum. The source node measures the gain (cost) of carrying a call at a set of contiguous subcarriers on subsequent (future) call arrival. This gain (cost) will be used to sort the routing and the starting frequencies. We present simulation results to show the efficiency of our new algorithm. Simulation shows savings for the normalized revenue loss can reach up to 70% over the static first-fit RSA with a faster setup time.
引用
收藏
页码:12 / 20
页数:9
相关论文
共 45 条
[1]   Dynamic spectrum allocation for orthogonal frequency-division multiplexing optical networks with survivability and multicasting [J].
Alyatama, Anwar .
JOURNAL OF HIGH SPEED NETWORKS, 2016, 22 (01) :1-13
[2]   Dynamic spectrum allocation in orthogonal frequency-division multiplexing optical networks [J].
Alyatama, Anwar .
JOURNAL OF ENGINEERING RESEARCH, 2014, 2 (03) :109-129
[3]  
[Anonymous], P IEEE GLOB 2014 DAL
[4]  
[Anonymous], IEEE ISIT
[5]  
[Anonymous], 2011, 1 EUR TEL SEM
[6]  
[Anonymous], 2012, IEEE COMM MAGAZINE
[7]  
[Anonymous], P INT C SENS TECHN A
[8]  
[Anonymous], IEEE GLOBECOM
[9]  
[Anonymous], EUR C EXH OPT COMM
[10]  
[Anonymous], P EUR C EXH OPT COMM