Path protection in translucent WDM optical networks

Authors:
Q. Rahman;S. Bandyopadhyay;A. Bari;A. Jaekel;Y. P. Aneja
Affiliations:
University of Windsor, Windsor, ON, Canada;University of Windsor, Windsor, ON, Canada;University of Windsor, Windsor, ON, Canada;University of Windsor, Windsor, ON, Canada;University of Windsor, Windsor, ON, Canada
Venue:
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Year:
2010

Citing 6
Cited 0

Survivability and Traffic Grooming in WDM Optical Networks

Survivability and Traffic Grooming in WDM Optical Networks
Dissemination of Information in Optical Networks: From Technology to Algorithms (Texts in Theoretical Computer Science. An EATCS Series)

Dissemination of Information in Optical Networks: From Technology to Algorithms (Texts in Theoretical Computer Science. An EATCS Series)
Dynamic lightpath allocation in translucent WDM optical networks

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Network design in realistic "all-optical" backbone networks

IEEE Communications Magazine
Translucent optical networks: the way forward [Topics in Optical Communications]

IEEE Communications Magazine
Survivability in optical networks

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Translucent WDM networks are receiving attention as longhaul back bone networks. One important aspect of such networks that has not received attention is the possibility of cycles in the path of a translucent network. This is the first work on implementing path protection in translucent networks, considering the possibility of cycles. Two formulations have been proposed here for dynamic lightpath allocation. The first is more comprehensive but may take an unacceptably long time. The second formulation is very fast but, in general, has slightly worse performance. We have studied the performances of these formulations using a number of well-known networks.