Finding disjoint paths in networks with star shared risk link groups

Abstract

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

Ant Colony Optimization Based Handoff Scheme and Verifiable Secret Sharing Security with M-M Scheme for VoIP

“…In this research paper, the ACS variant is followed for developing the ACO approach for resolving the handoff issue. Figure 1 IP networks; there are also possibilities for using paths more than two for communicating between a pair of terminals employing an overlay routing mechanism [21].…”

“…In order to maintain continuous connectivity during this period, the mobile client has to switch between APs, in a process known as a handoff. Implementing the handover with the CT might lead to high delays, for this reason, numerous explanations have been proposed to solve this problem by introducing temporary anchor points [21][22]. In the proposed solution the anchor point is not temporary, however permanent.…”

Time complexity of two disjoint simple paths

“…There are, not closely related, problems, including [12][13][14], which consider di erent versions of nding disjoint paths inside a set of sources and a set of targets.…”

Detection of spatially-close fiber segments in optical networks

“…This section builds upon Section II by grouping spatiallyclose fibers in the same risk group. A risk group is often defined as a set of fibers sharing an adjacent node or duct, e.g., [13], [14], [15]. We propose a broader definition of risk groups, such that a risk group is a set of fibers that are spatially close to every other fiber in the same set.…”