Distributed algorithms for computing shortest pairs of disjoint paths

Ogier, Richard G.; Rutenburg, V.; Shacham, N.

doi:10.1109/18.212275

Cited by 71 publications

(41 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, it should be noted that the first problem has also received significant attention in the literature (see [8], [11], [12], [16], [19]- [26]). In case the end-points have enough control over the path selection process, the centralized and distributed algorithms in references [27] and [28] can be used to find multiple disjoint paths over a large connected graph. However, applying such algorithms over the Internet requires modification of IP routing protocol and extra signaling between the nodes (routers).…”

mentioning

confidence: 99%

Path Diversity Over Packet Switched Networks: Performance Analysis and Rate Allocation

Fashandi

Gharan

Khandani

2010

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Path diversity works by setting up multiple parallel connections between the end points using the topological path redundancy of the network. In this paper, Forward Error Correction (FEC) is applied across multiple independent paths to enhance the end-to-end reliability. Network paths are modeled as erasure Gilbert-Elliot channels [1]- [5]. It is known that over any erasure channel, Maximum Distance Separable (MDS) codes achieve the minimum probability of irrecoverable loss among all block codes of the same size [6], [7]. Based on the adopted model for the error behavior, we prove that the probability of irrecoverable loss for MDS codes decays exponentially for an asymptotically large number of paths. Then, optimal rate allocation problem is solved for the asymptotic case where the number of paths is large. Moreover, it is shown that in such asymptotically optimal rate allocation, each path is assigned a positive rate iff its quality is above a certain threshold. The quality of a path is defined as the percentage of the time it spends in the bad state. Finally, using dynamic programming, a heuristic suboptimal algorithm with polynomial runtime is proposed for rate allocation over a finite number of paths. This algorithm converges to the asymptotically optimal rate allocation when the number of paths is large. The simulation results show that the proposed algorithm approximates the optimal rate allocation (found by exhaustive search) very closely for practical number of paths, and provides significant performance improvement compared to the alternative schemes of rate allocation.1

show abstract

mentioning

confidence: 99%

Path Diversity Over Packet Switched Networks: Performance Analysis and Rate Allocation

Fashandi

Gharan

Khandani

2010

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…where we used (5) and (6). By incorporating (4) into (7), we obtain an inequality for the number of blocks , into which we can split the -bit packet (8) In Fig.…”

Section: Description Of Our Schemementioning

confidence: 99%

Analysis of Multipath Routing—Part I: The Effect on the Packet Delivery Ratio

Tsirigos

Haas

2004

IEEE Trans. Wireless Commun.

147

View full text Add to dashboard Cite

Abstract-In this paper, we develop an analytical framework for evaluating multipath routing in mobile ad hoc networks. The instability of the topology (e.g., failure of links) in this type of network due to nodal mobility and changes in wireless propagation conditions makes transmission of time-sensitive information a challenging problem. To combat the inherent unreliability of these networks, we propose a routing scheme that uses multiple paths simultaneously by splitting the information between a multitude of paths, so as to increase the probability that the essential portion of the information is received at the destination without incurring excessive delay.Our scheme works by adding an overhead to each packet, which is calculated as a linear function of the original packet bits. The resulting packet (information and overhead) is fragmented into smaller blocks and distributed over the available paths. The probability of reconstructing the original information at the destination is derived in an analytical form and its behavior is studied for some special cases. It is shown that, under certain constraints, the packet dropping probability decreases as the number of used paths is increased.Index Terms-Ad hoc networks, ad hoc routing, alternative path routing, diversity coding, multipath routing, network fault tolerance, quality of service.

show abstract

“…For a distributed disjoint paths algorithm, we refer to the work of Ogier et al [122] and Sidhu et al [123].…”

Section: Min-sum Disjoint Pathsmentioning

confidence: 99%

An Overview of Algorithms for Network Survivability

Kuipers

2012

ISRN Communications and Networking

View full text Add to dashboard Cite

Network survivability-the ability to maintain operation when one or a few network components fail-is indispensable for present-day networks. In this paper, we characterize three main components in establishing network survivability for an existing network, namely, (1) determining network connectivity, (2) augmenting the network, and (3) finding disjoint paths. We present a concise overview of network survivability algorithms, where we focus on presenting a few polynomial-time algorithms that could be implemented by practitioners and give references to more involved algorithms.

show abstract

Distributed algorithms for computing shortest pairs of disjoint paths

Cited by 71 publications

References 8 publications

Path Diversity Over Packet Switched Networks: Performance Analysis and Rate Allocation

Path Diversity Over Packet Switched Networks: Performance Analysis and Rate Allocation

Analysis of Multipath Routing—Part I: The Effect on the Packet Delivery Ratio

An Overview of Algorithms for Network Survivability

Contact Info

Product

Resources

About