Survivable virtual topology routing under shared risk link groups in WDM networks

Todimala, A.; Ramamurthy, Byrav

doi:10.1109/broadnets.2004.81

Cited by 25 publications

(12 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This formulation is hence solved efficiently when the number of such colors is low. This fortunately seems to be the case in practical instances [1,7]. This also proves that the Minimum Color Path problem is polynomial when the number of colors of span more than 1 is bounded by a given constant k.…”

supporting

confidence: 53%

“…Consequently several heuristic algorithms have been proposed in the literature [1,3,4,7,9]. Indeed, despite the theoretical complexity of the problem, algorithms computing good color paths are still needed.…”

Section: Coping With Minimum Color Pathmentioning

confidence: 99%

“…In these settings, customers expect an uninterrupted service, even in the event of failures such as power outages, equipment failures, natural disasters and cable cuts. Many layer wide protection schemes have been proposed in the literature, as for instance for the WDM optical networks [1]. One method to provide survivability is through path protection schemes, in which a disjoint backup path is precomputed for every working path.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Shared Risk Resource Groups and Survivability in Multilayer Networks

Coudert

Pérennès

Rivano

et al. 2006

2006 International Conference on Transparent Optical Networks

View full text Add to dashboard Cite

Failure resilience is a desired feature of the Internet. Most traditional restoration architectures are designed assuming single failure cases, which is not adequate in present day multilayer networks. Multiple link failure models, such as Shared Risk Link Groups (SRLG), Shared Risk Node Groups (SRNG), and more generally Shared Risk Resource Groups (SRRG), are becoming critical in survivable network design. These shared risk models have been unified through the notion of colored graphs. In this paper we provide an efficient MILP formulation for the minimum color path problem which is related to finding a path of maximum reliability in a multilayer network and is thus essential issue of network survivability.

show abstract

supporting

confidence: 53%

Section: Coping With Minimum Color Pathmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Shared Risk Resource Groups and Survivability in Multilayer Networks

Coudert

Pérennès

Rivano

et al. 2006

2006 International Conference on Transparent Optical Networks

View full text Add to dashboard Cite

show abstract

“…Note that many authors use, in the case k = 2, diverse routing instead of 2-diverse routing. With no restriction on the graph structure and on the assignment of SRLGs to edges, even finding two SRLG-disjoint paths is NP-complete [23], and therefore many heuristics have been proposed [19,28,[32][33][34][35]. The problem is polynomial in some specific cases of localized failures: when SRLGs have span 1 (i.e.…”

Section: Related Workmentioning

confidence: 99%

Finding disjoint paths in networks with star shared risk link groups

Bermond

Coudert

D’Angelo

et al. 2015

Theoretical Computer Science

View full text Add to dashboard Cite

International audienceThe notion of Shared Risk Link Groups (SRLG) has been introduced to capture surviv-ability issues where some links of a network fail simultaneously. In this context, the k-diverse routing problem is to find a set of k pairwise SRLG-disjoint paths between a given pair of end nodes of the network. This problem has been proven NP-complete in general and some polynomial instances have been characterized. In this paper, we investigate the k-diverse routing problem in networks where the SRLGs are localized and satisfy the star property. This property states that a link may be subject to several SRLGs, but all links subject to a given SRLG are incident to a common node. We first provide counterexamples to the polynomial time algorithm proposed by X. Luo and B. Wang (DRCN'05) for computing a pair of SRLG-disjoint paths in networks with SRLGs satisfying the star property, and then prove that this problem is in fact NP-complete. We then characterize instances that can be solved in polynomial time or are fixed parameter tractable, in particular when the number of SRLGs is constant, the maximum degree of the vertices is at most 4, and when the network is a directed acyclic graph. Finally we consider the problem of finding the maximum number of SRLG-disjoint paths in networks with SRLGs satisfying the star property. We prove that this problem is NP-hard to approximate within O(|V | 1−ε) for any 0 < ε < 1, where V is the set of nodes in the network. Then, we provide exact and approximation algorithms for relevant subcases

show abstract

“…A survivable virtual topology as in [9,10] may be designed so that the virtual topology maintains the connectivity even after failure of a node. This guarantees the traffic that is affected due to failure of a node may be routed on multiple lightpaths.…”

Section: Motivationmentioning

confidence: 99%

Virtual Topology Reconfiguration for Node Failures in Wavelength Routed Optical Networks

Sreenath

Ramaswamy

2005

Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services - (I

View full text Add to dashboard Cite

In Wavelength Routed Wavelength Division Multiplexing (WR-WDM) networks, a set of lightpaths (all-optical communication paths) defines the virtual topology. In the event of a node failure, the virtual topology may be partitioned so that a set of nodes may not able to communicate with another set of nodes. In such a case, the restoration of disturbed lightpaths may be indispensable. Hence, it may be necessary to alter the existing virtual topology. Altering of a virtual topology is called as virtual topology reconfiguration. In this paper, we propose a methodology for reconfiguration of virtual topology in the event of a node failure. The proposed virtual topology reconfiguration methodology strikes a balance between the objective function value and number of changes committed to the virtual topology and assures all-to-all communication path (either using single hop or multi-hop path) in the virtual topology. The objective function value decides how best the topology is suited for the given traffic demand. The number of changes decides the extent of traffic disruption in the network while performing changes in the existing virtual topology.

show abstract

Survivable virtual topology routing under shared risk link groups in WDM networks

Cited by 25 publications

References 9 publications

Shared Risk Resource Groups and Survivability in Multilayer Networks

Shared Risk Resource Groups and Survivability in Multilayer Networks

Finding disjoint paths in networks with star shared risk link groups

Virtual Topology Reconfiguration for Node Failures in Wavelength Routed Optical Networks

Contact Info

Product

Resources

About