Abstract
We present a novel multi-constrains routing algorithm, called One-step Delay-constrained Pool Sharing (ODPS) algorithm, in a survivable mesh network. The goal of this algorithm is to compute a pair of link-disjoint primary and backup paths between a given source and destination nodes, which guarantees full recovery from any single link failure in the network. Our objective is to minimize the total end-to-end delay time along the primary and backup paths as well as the resources (such as backup bandwidth) used in the network. Our approach solves the trap-topology issue of the Two-step Delay-constrained Pool Sharing (TDPS) algorithm which we introduced in our earlier contribution. Using simulation, we have studied both TDPS and ODPS algorithms on the existing North-American transport networks. We show that ODPS avoids trap-topology, and outperforms TDPS in terms of the total end-to-end packet delay.
© 2007 Optical Society of America
PDF ArticleMore Like This
N. Mallick
NThB2 National Fiber Optic Engineers Conference (NFOEC) 2006
Yuanqiu Luo, Si Yin, Ting Wang, Shinya Nakamura, and Nirwan Ansari
NTuD2 National Fiber Optic Engineers Conference (NFOEC) 2007
Eric Bouillet, Jean-François Labourdette, Ramu Ramamurthy, and Sid Chaudhuri
ThW2 Optical Fiber Communication Conference (OFC) 2002