Adaptive multilevel modulation for grooming in elastic cloud optical networks

被引:6
作者
Yu, Cunqian [1 ]
Hou, Weigang [1 ,2 ,3 ]
Wu, Ying [1 ]
Wu, Jingjing [1 ]
Sun, Zhimin [1 ]
机构
[1] Northeastern Univ, Coll Informat Sci & Engn, Shenyang 110819, Peoples R China
[2] State Key Lab Networking & Switching Technol, Beijing 100876, Peoples R China
[3] State Key Lab Informat Photon & Opt Commun, Beijing 100876, Peoples R China
基金
中国国家自然科学基金;
关键词
Elastic optical network; Cloud computing; Green grooming; Adaptive multilevel modulation; ALLOCATION;
D O I
10.1007/s11107-015-0543-x
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In order to mitigate the mismatch of granularities between fixed grid and client traffic, the elastic optical network (EON) was proposed by using orthogonal frequency division multiplexing. In EONs, the bandwidth variable transponder adjusts the number of bits per symbol, so that an optical signal generates by using just enough sub-carriers each with appropriate modulation level. Owing to the advantage of line-rate adaption above, the application of cloud computing has witnessed rapid growth in EONs. However, bandwidth variable transponders consume more power compared with ordinary ones, which will lead to a power-thirsty EON if no effective measure is taken. As a result, the green grooming was proposed for EONs. Unfortunately, the adaptive multilevel modulation was neglected in the current works focusing on green grooming. Thus, in this paper, we design a novel modulation adaptive grooming with guaranteeing transmission performances in green EONs. The distance-adaptive spectrum resource allocation is applied to the green grooming algorithm previously designed by us for EONs. The simulation results show that the adaptive multilevel modulation plays an important role on saving spectrum and power consumption for the green grooming in EONs, because the spectral bandwidth can be saved by increasing the number of bits per symbol to transmit the same data rate.
引用
收藏
页码:524 / 531
页数:8
相关论文
共 25 条
  • [1] [Anonymous], P OECC
  • [2] [Anonymous], P OFC
  • [3] [Anonymous], P OFC
  • [4] [Anonymous], 2012, 2012 IEEE C EV COMP, DOI DOI 10.1109/SURV.2012.010912.00123
  • [5] [Anonymous], P ECOC
  • [6] [Anonymous], 2011, OPT FIB COMM C EXP N
  • [7] [Anonymous], 2012, P ECOC
  • [8] [Anonymous], P OFC
  • [9] [Anonymous], P ECOC
  • [10] [Anonymous], P OFC