Dynamic routing and spectrum assignment algorithms in flexible optical networks: An overview
Nan Hua, Yang Liu, Xin Wan, Xiaoping Zheng, Zhigang Liu
Abstract
Nan Hua, Yang Liu, Xin Wan, Xiaoping Zheng, Zhigang Liu
Abstract
In this paper, we examine the current research on the dynamic routing and spectrum assignment (RSA) problem in flexible optical networks. The existing RSA algorithms are classified into three main categories: fixed routing (FR), fixed alternative routing (FAR) and adaptive routing (AR). We select the representative algorithms within each category, and briefly introduce their concept, advantage and drawback. Comparison among these algorithms is made in respect of blocking performance, computational complexity and so on.
OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, we examine the current research on the dynamic routing and spectrum assignment (RSA) problem in flexible optical networks. The existing RSA algorithms are classified into three main categories: fixed routing (FR), fixed alternative routing (FAR) and adaptive routing (AR). We select the representative algorithms within each category, and briefly introduce their concept, advantage and drawback. Comparison among these algorithms is made in respect of blocking performance, computational complexity and so on.
Key concepts: Computer science, Static routing, Adaptive routing, Link-state routing protocol, Destination-Sequenced Distance Vector routing, Routing (electronic design automation), Multipath routing, Dynamic Source Routing