Finding disjoint paths in networks

Sidhu, Deepinder P.; Nair, Raj; Abdallah, Shukri

doi:10.1145/115992.115998

Cited by 103 publications

(25 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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

“…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

show abstract

“…The survival of the fittest principle ensures that the overall quality of the population improves as the algorithm progresses from one generation to the next. Several algorithms for finding disjoint paths are presented in [9], [10].…”

Section: Related Workmentioning

confidence: 99%

Adaptive Multipath Multimedia Streaming Architecture for Mobile Networks With Proactive Buffering Using Mobile Proxies

Bose¹,

Kannan²

2007

CIT

View full text Add to dashboard Cite

Real-time multimedia transport has stringent bandwidth, delay and loss requirements. Providing support for such applications in infrastructure-based single hop wireless networks is a great challenge. Since mobile networks are characterized by host mobility, providing continuous streaming service in such an environment is an uphill task. In order to achieve continuous multimedia streaming, we propose an innovative multipath architecture for multimedia streaming. Existing multipath architectures are not efficient for mobile networks, where, in addition to normal streaming requirements, we need to handle the frequently occurring hand-offs. In our architecture, multiple paths, identified using an efficient genetic algorithm, are used to provide robust streaming in case of link failures. Dynamic encoding schemes are used in the server to adapt according to network conditions based on the feedback received from the network. In addition, hand-offs are predicted proactively and mobile agents containing the buffered data are migrated to the predicted base station. Altogether, the architecture provides robust multimedia streaming service under varying network conditions. We have simulated the performance of our architecture using Network Simulator (NS -2) and the results are promising.

show abstract

“…Multipath routing protocols in wired networks has been widely developed in [9], [6], [4], and [19]. These protocols use table-driven algorithms (link state or distance vector) to compute multiple routes.…”

Section: Introductionmentioning

confidence: 99%

Multipath Power Sensitive Routing Protocol for Mobile Ad Hoc Networks

Subramanian

Anto

Vasudevan

et al. 2004

Wireless on-Demand Network Systems

View full text Add to dashboard Cite

Abstract. Mobile Ad hoc Networks are characterized by multi-hop wireless links, without any infrastructure, and frequent host mobility. A plethora of routing protocols has been proposed. A class of routing protocols called ondemand protocols has recently gained attention because of their efficiency and low routing overhead. As the mobile nodes in the network work on low power batteries, the need to take into account their power consumption arises. This paper focuses on a particular on-demand routing protocol, called Dynamic Source Routing, and shows how an efficient heuristic based Multipath technique can improve the mean time to node failure and maintain the variance in the power of all the nodes as low as possible. In the Multipath Power Sensitive Routing Protocol (MPSR) every node in the network is treated equally and the overall network is stable for a long time. An interesting feature of using this protocol is that the end-to-end packet delay does not increase significantly. The results of extensive simulation show that the performance of MPSR protocol is on an increasing trend as mobility increases when compared to the Dynamic Source Routing.

show abstract

Finding disjoint paths in networks

Cited by 103 publications

References 1 publication

An Overview of Algorithms for Network Survivability

An Overview of Algorithms for Network Survivability

Adaptive Multipath Multimedia Streaming Architecture for Mobile Networks With Proactive Buffering Using Mobile Proxies

Multipath Power Sensitive Routing Protocol for Mobile Ad Hoc Networks

Contact Info

Product

Resources

About