Coudert, David and Pérennes, Stéphane and Rivano, Hervé and Voge, Marie-Emilie - Combinatorial optimization in networks with Shared Risk Link Groups

dmtcs:1459 - Discrete Mathematics & Theoretical Computer Science, May 3, 2016, Vol. 18 no. 3
Combinatorial optimization in networks with Shared Risk Link Groups

Authors: Coudert, David and Pérennes, Stéphane and Rivano, Hervé and Voge, Marie-Emilie

The notion of Shared Risk Link Groups (SRLG) captures survivability issues when a set of links of a network may fail simultaneously. The theory of survivable network design relies on basic combinatorial objects that are rather easy to compute in the classical graph models: shortest paths, minimum cuts, or pairs of disjoint paths. In the SRLG context, the optimization criterion for these objects is no longer the number of edges they use, but the number of SRLGs involved. Unfortunately, computing these combinatorial objects is NP-hard and hard to approximate with this objective in general. Nevertheless some objects can be computed in polynomial time when the SRLGs satisfy certain structural properties of locality which correspond to practical ones, namely the star property (all links affected by a given SRLG are incident to a unique node) and the span 1 property (the links affected by a given SRLG form a connected component of the network). The star property is defined in a multi-colored model where a link can be affected by several SRLGs while the span property is defined only in a mono-colored model where a link can be affected by at most one SRLG. In this paper, we extend these notions to characterize new cases in which these optimization problems can be solved in polynomial time. We also investigate the computational impact of the transformation from the multi-colored model to the mono-colored one. Experimental results are presented to validate the proposed algorithms and principles.


Source : oai:HAL:hal-01053859v4
Volume: Vol. 18 no. 3
Section: Distributed Computing and Networking
Published on: May 3, 2016
Submitted on: May 3, 2016
Keywords: colored graphs,Shared Risk Link Group,complexity,algorithms,Multi-layer networks,[INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI]


Share

Browsing statistics

This page has been seen 310 times.
This article's PDF has been downloaded 226 times.