DocumentCode :
1873087
Title :
Using MCG to find PP-cycles in planar graphs [optical network applications]
Author :
Mardini, Wail ; Yang, Oliver ; Zhai, Yihua
Author_Institution :
Sch. of Inf. Technol., & Eng., Ottawa Univ., Ont., Canada
Volume :
3
fYear :
2005
fDate :
6-11 March 2005
Abstract :
We present a detailed study on finding p-cycles. Called pp-cycles (planar p-cycles), they can take the geographical nature of the network into account and protect all links within the same area. An algorithm that exploits all these properties is implemented and tested.
Keywords :
graph theory; optical fibre networks; MCG algorithm; area link protection; cycle graphs; optical networks; planar graphs; planar p-cycles; pp-cycles; Bandwidth; Information technology; Intelligent networks; NP-complete problem; Network topology; Optical fiber networks; Protection; Spine; Telecommunication traffic; Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Optical Fiber Communication Conference, 2005. Technical Digest. OFC/NFOEC
Print_ISBN :
1-55752-783-0
Type :
conf
DOI :
10.1109/OFC.2005.192849
Filename :
1501380
Link To Document :
بازگشت