DocumentCode :
3598357
Title :
On the tradeoffs between path computation efficiency and information abstraction in optical mesh networks
Author :
Hang Liu ; Bouillet, Eric ; Pendarakis, D. ; Komaee, N. ; Labourdette, J.-F. ; Chaudhuri, Swarat
Author_Institution :
Tellium, Inc.
Volume :
3
fYear :
2004
Firstpage :
1684
Lastpage :
1688
Abstract :
Distributed, IP-based control architecture has been proposed for switched optical mesh networks, as a means to automate operations, enhance interoperability and facilitate the deployment of new applications. While distributed control in general enhances scalability and flexibility, it also offers challenges to path computation, especially for shared mesh restored paths, because of the summarization of link state information disseminated by the routing protocol. This paper discusses the tradeoffs between the path computation efficiency and the abstraction level of link state information. Several heuristic algorithms for computing shared mesh restored paths are described, which require different levels of abstraction and summarization of link resource sharing information. The performance of these algorithms is compared in term of the efficiency of network capacity utilization, the computation complexity, and the amount of required network information. We show that with appropriately aggregated link state information the proposed path computation algorithms are able to utilize the network resource very efficiently.
Keywords :
Computer networks; Distributed control; Intelligent networks; Mesh networks; Optical computing; Optical control; Optical fiber networks; Optical receivers; Protection; Signal restoration; optical networks; path computation algorithms; shared mesh restoration;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications, 2004 IEEE International Conference on
Print_ISBN :
0-7803-8533-0
Type :
conf
DOI :
10.1109/ICC.2004.1312796
Filename :
1312796
Link To Document :
بازگشت