Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Heuristic for the maximum disjoint paths problem in wavelength-routed networks with shared-risk link groups [Invited]

Not Accessible

Your library or personal account may give you access

Abstract

We tackle the problem of finding the maximum number of link-disjoint paths between a pair of source-destination nodes in wavelength-routed networks, subject to the shared-risk link group (SRLG) constraints. We propose a simple heuristic algorithm whose main idea is to iteratively find the path with the minimum total weight of all the SRLGs through which it passes until no further path can be found, where the weight of each SRLG is basically proportional to its size, and those SRLGs appearing in the minimum cut between the source-destination nodes are assigned higher weights. Extensive simulation results show that the proposed method, with a complexity comparable to that of the simplest conventional k-shortest-path algorithm, steadily outperforms the best existing method.

© 2003 Optical Society of America

PDF Article
More Like This
Backup Reprovisioning After Shared Risk Link Group (SRLG) Failures in WDM Mesh Networks

Xu Shao, Yong Kee Yeo, Yuebin Bai, Jian Chen, Luying Zhou, and Lek Heng Ngoh
J. Opt. Commun. Netw. 2(8) 587-599 (2010)

On Shared Risk Link Group Optimization [Invited]

Guangzhi Li, Dongmei Wang, Timothy Gallivan, and Robert Doverspike
J. Opt. Commun. Netw. 4(11) B52-B57 (2012)

k-Connected Network Partitioning Under Shared Risk Link Groups

M. Masud Hasan, Farid Farahmand, and Jason P. Jue
J. Opt. Commun. Netw. 7(8) 695-706 (2015)

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All Rights Reserved