Dynamic multi-path routing and how it compares with other dynamic routing algorithms for high speed wide area network

Bahk, Saewoong; Zarki, Magda El

doi:10.1145/144179.144205

Cited by 68 publications

(19 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In AOMDV [17], describes that the changes are necessary in the basic AODV route discovery mechanism to enable computation of multiple link disjoint routes between source destination pairs. Note that any intermediate node _ on the route between a source _ and a destination _ can also form such multiple routes to _, thus making available a large number of routes between the network using the route discovery and the route maintenance.…”

Section: International Journal Of Science and Research (Ijsr) India mentioning

confidence: 99%

Survey of Routing Protocols for Mobile Ad hoc Networks

Batra¹,

Shukla²,

Thakur³

et al. 2012

IOSRJCE

View full text Add to dashboard Cite

Abstract:The main objective of this paper is to investigate the environment based protocol such as AODV, AOMDV and LCR .Mobile Ad hoc networks can be also defined as a collection of mobile nodes that intercommunicate on shared wireless channels. The primary goal of such an ad hoc network routing protocol is to provide correct and efficient route establishment between pair of nodes so that messages may be delivered in time. From this survey paper we can conclude that the AOMDV protocol performs better than the other two protocols in an Ad hoc Network.

show abstract

Section: International Journal Of Science and Research (Ijsr) India mentioning

confidence: 99%

Survey of Routing Protocols for Mobile Ad hoc Networks

Batra¹,

Shukla²,

Thakur³

et al. 2012

IOSRJCE

View full text Add to dashboard Cite

show abstract

“…This parallelism in transmission is achieved by splitting the original data volume into smaller blocks and sending these blocks of data via selected multiple paths from s to d; which in turn reduces congestion as well as end-toend delay. Although utilization of multiple paths has been explored in the wired networks [1,3,11], in order to provide improved performance against single path, it has also been shown in [14] that deployment of multiple paths does not necessarily result in a lower end-to-end delay. Furthermore, most of the existing work considers only spatial multipath, whereas our work takes into account both spatial and temporal multipaths.…”

Section: Introductionmentioning

confidence: 99%

An adaptive framework for QoS routing through multiple paths in ad hoc wireless networks

Das

Mukherjee

Bandyopadhyay

et al. 2003

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

We propose an adaptive framework for computing multiple paths in temporal and spatial domains to transmit a large volume of data packets from a source s to a destination d in ad hoc wireless networks. The objective is to achieve quality of service (QoS) by minimizing end-to-end delay for packet delivery. We consider two aspects in this framework. The first aspect is to perform preemptive route rediscoveries before the occurrence of route errors while transmitting a large volume of data from s to d: This helps us to find out dynamically a series of possible paths in temporal domain to complete the data transfer. The second aspect is to select multiple paths in spatial domain for data transfer at any instant of time, and to distribute the data packets in sequential blocks over those paths in order to reduce congestion and end-to-end delay. A notion of link stability and path stability is also defined, and a unified mechanism is proposed to address the above two aspects that relies on evaluating a path based on link and path stability. Our solution method uses Lagrangean relaxation and subgradient heuristics to solve an optimization formulation of the problem in order to compute the paths and the corresponding data distribution, both in temporal and spatial domains. Simulation experiments demonstrate that the proposed framework helps in significantly reducing the end-to-end delay and the required number of routerediscoveries.

show abstract

“…The control path for multipath routing has also also been studied in the context of connection-oriented networks with reservations; see for example [13], [14], [15], [16], [17] and the references therein. Protocols devised in this context seek to balance signaling overhead and the number of established paths with throughput optimization and quality-of-service constraints.…”

Section: Introductionmentioning

confidence: 99%

Opportunistic traffic scheduling over multiple network paths

Cetinkaya

Knightly

Ieee Infocom 2004

View full text Add to dashboard Cite

Abstract-Multipath routing enables a network's traffic to be split among two or more possibly disjoint paths in order to reduce latency, improve throughput, and balance traffic loads. Yet, once the control plane establishes multiple routes, a policy is needed for efficiently splitting traffic among the selected paths. In this paper, we introduce Opportunistic Multipath Scheduling (OMS), a technique for exploiting short term variations in path quality to minimize delay, while simultaneously ensuring that the splitting rules dictated by the routing protocol are satisfied. In particular, OMS uses measured path conditions on time scales of up to several seconds to opportunistically favor low-latency high-throughput paths. However, a naive policy that always selects the highest quality path would violate the routing protocol's path weights and potentially lead to oscillation. Consequently, OMS ensures that over longer time scales relevant for traffic management policies, traffic is split according to the ratios determined by the routing protocol. We develop a model of OMS and derive an asymptotic lower bound on the performance of OMS as a function of path conditions (mean, variance, and Hurst parameter) for self-similar traffic. An example finding from the model is that long-time-scale traffic fluctuations represented by a larger Hurst parameter improve the performance gain of OMS vs. round-robin scheduling, even under paths that are statistically identical. Finally, we use an extensive simulation-based performance study to evaluate the accuracy of the analytical model, explore the impact of OMS on TCP throughput, and study the impact of factors such as delayed measurements.

show abstract

Dynamic multi-path routing and how it compares with other dynamic routing algorithms for high speed wide area network

Cited by 68 publications

References 5 publications

Survey of Routing Protocols for Mobile Ad hoc Networks

Survey of Routing Protocols for Mobile Ad hoc Networks

An adaptive framework for QoS routing through multiple paths in ad hoc wireless networks

Opportunistic traffic scheduling over multiple network paths

Contact Info

Product

Resources

About