A New Heuristic for Finding the Shortest Path with a Disjoint Counterpart

Dahai Xu; Yang Chen; Chunming Qiao

Optical Fiber Communication Conference
Technical Digest (CD) (Optica Publishing Group, 2004),
paper ThG2

A New Heuristic for Finding the Shortest Path with a Disjoint Counterpart

Dahai Xu, Yang Chen, and Chunming Qiao

Optical Fiber Communication Conference 2004

Los Angeles, California United States
ISBN: 1-55752-767-9

From the session
Network Design II (ThG)

Not Accessible

Your library or personal account may give you access

Get PDF
Email
Share
Get Citation
Copy Citation Text
D. Xu, Y. Chen, and C. Qiao, "A New Heuristic for Finding the Shortest Path with a Disjoint Counterpart," in Optical Fiber Communication Conference, Technical Digest (CD) (Optica Publishing Group, 2004), paper ThG2.

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

Abstract

We describe a new heuristic for finding a shortest active path with a disjoint backup path (the Min-Min problem), which works better than other heuristics and is also a viable approach for shared path protection.

PDF Article

More Like This

Novel models for efficient shared-path protection

Chunming Qiao, Yizhi Xiong, and Dahai Xu
ThW3 Optical Fiber Communication Conference (OFC) 2002

Resilient RWA Algorithm Using Path Protection for Data Center Networks (DCNs)

Saja Al Mamoori, Arunita Jaekel, and Subir Bandyopadhyay
JTu4A.21 Integrated Photonics Research, Silicon and Nanophotonics (IPR) 2017

Finding Partially Disjoint Routes for Dual Fiber-Cut Protection on Bi-Connected Networks

Victor Yu Liu and Zhicheng Sui
NW3K.7 National Fiber Optic Engineers Conference (NFOEC) 2012

Previous Article Next Article