Title :
Adaptive routing and wavelength assignment algorithms for hierarchical architecture in ASON
Author :
Luo, Pei ; Huang, Shanguo ; Li, Bin ; Zhang, Jie ; Gu, Wanyi
Author_Institution :
Key Lab. of Opt. Commun. & Lightwave Technol., Beijing Univ. of Posts & Telecommun., Beijing, China
Abstract :
The hierarchical routing and wavelength assignment problem in Automatic Switched Optical Network (ASON) is researched. Based on our analysis, three adaptive algorithms called MLLR (Multi-Layer Least Loaded Routing Algorithm), WMLCR (Wavelength-graph-based Multi-Layer Least Congestion Routing Algorithm) and BMR (Backtracking-based Multi-Layer Routing Algorithm) are proposed. A platform named AHORSP (ASON based hierarchical optimal routing & signaling platform) supporting our routing scheme is proposed and demonstrated. The simulation shows that the proposed algorithms can have comprehensive application on the basis of their convenience to be realized, low BP performance and acceptable operation time.
Keywords :
optical switches; telecommunication network routing; wavelength assignment; ASON; BMR; WMLCR; adaptive routing; automatic switched optical network; backtracking-based multi-layer routing algorithm; fixed alternate routing; hierarchical architecture; hierarchical routing; multi-layer least loaded routing algorithm; resource balancing; wavelength assignment algorithms; wavelength-graph-based multi-layer least congestion routing algorithm; Communications technology; Intelligent networks; Laboratories; Load management; Maximum likelihood linear regression; Network topology; Optical fiber communication; Optical fiber networks; Wavelength assignment; Wavelength routing; ASON; fixed alternate routing; hierarchical routing; resource balancing; routing and wavelength assignment;
Conference_Titel :
Network Infrastructure and Digital Content, 2009. IC-NIDC 2009. IEEE International Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-4244-4898-2
Electronic_ISBN :
978-1-4244-4900-6
DOI :
10.1109/ICNIDC.2009.5360843
