Dynamic routing and spectrum assignment algorithms in flexible optical networks: An overview

Author

Nan Hua ; Yang Liu ; Xin Wan ; Xiaoping Zheng ; Zhigang Liu

Author_Institution

Dept. of Electron. Eng., Tsinghua Univ., Beijing, China

fYear

2012

fDate

8-10 Aug. 2012

Firstpage

251

Lastpage

255

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.

Keywords

communication complexity; optical fibre networks; telecommunication network routing; adaptive routing; blocking performance; computational complexity; dynamic routing; fixed alternative routing; flexible optical network; spectrum assignment algorithm; Bandwidth; Computational complexity; Decision support systems; Heuristic algorithms; Integrated optics; Optical fiber networks; Routing; flexible optical networks; orthogonal frequency division multiplexing (OFDM); routing and spectrum assignment (RSA); spectrum segments;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications and Networking in China (CHINACOM), 2012 7th International ICST Conference on

Conference_Location

Kun Ming

Print_ISBN

978-1-4673-2698-8

Electronic_ISBN

978-1-4673-2697-1

Type

conf

DOI

10.1109/ChinaCom.2012.6417485

Filename

6417485