DocumentCode
3117173
Title
K-shortest path algorithm for overlay protection in optical networks
Author
Wang, Xi ; Zhang, Qiong ; Palacharla, Paparao ; Naito, Takao
Author_Institution
Photonics Networking Lab., Fujitsu Labs. of America, Inc., Richardson, TX, USA
fYear
2009
fDate
13-17 July 2009
Firstpage
1
Lastpage
2
Abstract
We present a k-shortest path algorithm for overlay demand routing in optical networks. The proposed algorithm can find paths in trap topologies and show higher demand routing success rate compared to shortest path algorithm-based approaches.
Keywords
optical fibre networks; telecommunication network routing; telecommunication network topology; telecommunication security; k-shortest path algorithm; optical networks; overlay demand routing; overlay protection; trap topologies; Costs; Laboratories; Multiprotocol label switching; Network topology; Optical fiber networks; Photonics; Protection; Routing; SONET; Telecommunication traffic;
fLanguage
English
Publisher
ieee
Conference_Titel
OptoElectronics and Communications Conference, 2009. OECC 2009. 14th
Conference_Location
Hong Kong
Print_ISBN
978-1-4244-4102-0
Electronic_ISBN
978-1-4244-4103-7
Type
conf
DOI
10.1109/OECC.2009.5215722
Filename
5215722
Link To Document