Using MCG to find PP-cycles in Planar Graphs

Wail Mardini; Oliver Yang; Yihua Zhai

Optical Fiber Communication Conference and Exposition and The National Fiber Optic Engineers Conference
Technical Digest (CD) (Optica Publishing Group, 2005),
paper JWA52

Using MCG to find PP-cycles in Planar Graphs

Wail Mardini, Oliver Yang, and Yihua Zhai

National Fiber Optic Engineers Conference 2005

Anaheim, California United States
ISBN: 1-55752-784-9

From the session
Poster Session II (JWA)

Not Accessible

Your library or personal account may give you access

Get PDF
Email
Share
Get Citation
Copy Citation Text
W. Mardini, O. Yang, and Y. Zhai, "Using MCG to find PP-cycles in Planar Graphs," in Optical Fiber Communication Conference and Exposition and The National Fiber Optic Engineers Conference, Technical Digest (CD) (Optica Publishing Group, 2005), paper JWA52.

Export Citation
- BibTex
- Endnote (RIS)
- HTML
- Plain Text
Save article

Abstract

We present a detailed study on finding p-cycles. Called pp-cycles (planar p-cycle), they can take the geographical nature of the network into account and protecting all links withen same area. An algorithm that exploits all these properties implemented and tested.

PDF Article

More Like This

Protection Cycle Covers in Optical Networks With Arbitrary Mesh Topologies

Georgios Ellinas, Shao Rong, Aklilu Hailemariam, and Thomas E. Stern
ThO4 Optical Fiber Communication Conference (OFC) 2000

Optical wireless networks: transceiver distribution provisioning

Ahmed M. Mahdy and Jitender S. Deogun
JWA59 National Fiber Optic Engineers Conference (NFOEC) 2005

Optical Implementation of Resilient Packet Rings Using Light-trails

Ashwin Gumaste and Si Qing Zheng
NThI3 National Fiber Optic Engineers Conference (NFOEC) 2005

Previous Article Next Article