Dependable WDM networks with edge-disjoint p-cycles

Authors:
Chuan-Ching Sue;Yung-Chiao Chen;Min-Shao Shieh;Sy-Yen Kuo
Affiliations:
Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan;Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan;Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan;Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan
Venue:
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Year:
2004

Citing 8
Cited 0

Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs

IEEE/ACM Transactions on Networking (TON)
Generalized loop-back recovery in optical mesh networks

IEEE/ACM Transactions on Networking (TON)
New options and insights for survivable transport networks

IEEE Communications Magazine
A framework for service-guaranteed shared protection in WDM mesh networks

IEEE Communications Magazine
Protection cycles in mesh WDM networks

IEEE Journal on Selected Areas in Communications
IP layer restoration and network planning based on virtual protection cycles

IEEE Journal on Selected Areas in Communications
Fault management in IP-over-WDM networks: WDM protection versus IP restoration

IEEE Journal on Selected Areas in Communications
Hamiltonian p-cycles for fiber-level protection in semi-homogeneous homogeneous and optical networks

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a fault tolerant mechanism on the optical network design with edge-disjoint P-cycles (EDPC). EDPC is a special type of traditional P-cycles, that is, no common edges are allowed to exist between any two P-cycles. Previously published schemes for computing P-cycles are time consuming and do not survive multiple link failures when P-cycles have common edges. Instead of using the complex ILP, a heuristic method based on link state routing which is compatible to the traditional open shortest path first (OSPF) network protocol is proposed to speed up the construction of EDPC. The results show that the EDPC method can tolerate more link failures and improve the restoration efficiency for traditional P-cycles with the decrease of two working units for every two P-cycles.