SRLG-Diverse Routing with the Star Property - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

SRLG-Diverse Routing with the Star Property

Abstract

The notion of Shared Risk Link Groups (SRLG) has been introduced to capture survivability issues where some links of a network fail simultaneously. In this context, the diverse routing problem is to find a set of pairwise SRLG-disjoint paths between a given pair of end nodes of the network. This problem has been proved NP-complete in general and some polynomial instances have been characterized. In this paper, we investigate the 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 in the literature 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. Then, we devise polynomial time algorithms for practically relevant subcases, 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 such problem is NP-hard and hard to approximate. Then, we provide exact and approximation algorithms for relevant subcases.
Fichier principal
Vignette du fichier
SRLG-Divrse_Routing_with_the_Star.pdf (772.97 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00794638 , version 1 (26-02-2013)

Identifiers

  • HAL Id : hal-00794638 , version 1

Cite

Jean-Claude Bermond, David Coudert, Gianlorenzo d'Angelo, Fatima Zahra Moataz. SRLG-Diverse Routing with the Star Property. Design of Reliable Communication Networks, DRCN, Mar 2013, Budapest, Hungary. ⟨hal-00794638⟩
367 View
324 Download

Share

Gmail Mastodon Facebook X LinkedIn More