Study on dynamic routing and spectrum assignment in bitrate flexible optical networks

  • Authors:
  • Xin Wan;Nan Hua;Hanyi Zhang;Xiaoping Zheng

  • Affiliations:
  • State Key Laboratory on Integrated Optoelectronics, National Laboratory for Information Science and Technology, Department of Electronic Engineering, Tsinghua University, Beijing, People's Republi ...;State Key Laboratory on Integrated Optoelectronics, National Laboratory for Information Science and Technology, Department of Electronic Engineering, Tsinghua University, Beijing, People's Republi ...;State Key Laboratory on Integrated Optoelectronics, National Laboratory for Information Science and Technology, Department of Electronic Engineering, Tsinghua University, Beijing, People's Republi ...;State Key Laboratory on Integrated Optoelectronics, National Laboratory for Information Science and Technology, Department of Electronic Engineering, Tsinghua University, Beijing, People's Republi ...

  • Venue:
  • Photonic Network Communications
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

The exponential growth of Internet traffic necessitates high-capacity optical networks and has also highlighted the importance of bandwidth-flexible and multi-granularity transport platforms. Improving both transport capacity and bandwidth flexibility is a significant challenge in optical networks. A bitrate flexible network architecture that is based on orthogonal frequency division multiplexing has been proposed as a promising solution for meeting this challenge. In the current study, we focus on the online routing and spectrum assignment problems in the aforementioned network architecture and introduce a general solution for dynamic bitrate flexible traffic in distributed environments. A novel spectrum representation method based on continuous spectrum segments is introduced into the networks. Segment-based routing and signaling mechanisms provide general solutions that support both the conventional slot-based networks and the ideal fully gridless networks. The routing algorithms and spectrum selection approaches are demonstrated and compared in a simulation. Performance estimation indicates that random spectrum segment assignment achieves the lowest capacity blocking rate in light traffic, whereas the adaptive routing plus minimum residual spectrum scheme obtains the lowest capacity blocking rate under heavy traffic.