Performance analysis of reactive shortest path and multipath routing mechanism with load balance

Pham, Peter P.; Perreau, Sylvie

doi:10.1109/infcom.2003.1208677

Cited by 194 publications

(115 citation statements)

References 13 publications

Supporting

Mentioning

108

Contrasting

Unclassified

Order By: Relevance

“…uniform traffic demands [8,11,18]. In [18], Pham and Perreau, and later, in [19], Ganjali and Keshavarzian have studied the possible gain from using k-shortest paths instead of one.…”

Section: Related Workmentioning

confidence: 99%

“…In [18], Pham and Perreau, and later, in [19], Ganjali and Keshavarzian have studied the possible gain from using k-shortest paths instead of one. By using approximative modeling techniques, Pham et al argue that the use of multi-path routing always results in improvement to throughput.…”

Section: Related Workmentioning

confidence: 99%

“…As a first example we consider the standard example of a circular disk with unit radius (see, e.g., [4,11,12,18,19]). Due to the symmetry, the scalar flux in this system is a function of radius r only.…”

Section: Unit Diskmentioning

confidence: 99%

See 2 more Smart Citations

On the optimality of field-line routing in massively dense wireless multi-hop networks

Hyytiä

Virtamo²

2009

Performance Evaluation

View full text Add to dashboard Cite

A B S T R A C TWe consider the load balancing problem in large wireless multi-hop networks by applying the continuum approximation. The task is to find routes, geometric curves, such that the maximal traffic load in the network is minimized. In finite fixed networks, multi-path routes generally yield a lower congestion and thus allow higher throughput. In contrast, we show that in dense wireless multi-hop networks, the optimal load balancing can be achieved by a destination based single-path routing referred to as field-line routing. This is because any routing can be transformed to the corresponding field-line routing with the same or better performance, by using as paths, the field lines of the so-called destination flow associated with the original routing. The concepts are illustrated with two examples. In the case of a unit disk with unit traffic, the maximal load of 0.389 of a multi-path routing system is reduced to 0.343 by using the field-line routing. Similar improvements are also demonstrated for the unit square.

show abstract

“…uniform traffic demands [8,11,18]. In [18], Pham and Perreau, and later, in [19], Ganjali and Keshavarzian have studied the possible gain from using k-shortest paths instead of one.…”

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

On the optimality of field-line routing in massively dense wireless multi-hop networks

Hyytiä

Virtamo²

2009

Performance Evaluation

View full text Add to dashboard Cite

show abstract

“…To avoid this delay, multi-path routing could be adopted, allowing multiple candidate next hops for packet forwarding. However the overhead of multi-path routing grows fast and becomes intolerable as node mobility increases [9]. Another solution is to exploit routing layer feedback (eg, route broken/route repaired) to TCP.…”

Section: Airborne Swarmsmentioning

confidence: 99%

TCP over Geo-routing for High Mobility: Vehicle Grids and Airborne Swarms

2006

View full text Add to dashboard Cite

Summary. Ad hoc wireless networks have become the architecture of choice for peer to peer communications in areas where the telecommunications infrastructure is inadequate or has failed, A major challenge is the reliable delivery of data when nodes move. The reliable Internet protocol is TCP. However, TCP performs poorly in mobile ad hoc networks, mainly because of route breakage. To overcome this problem, a robust routing protocol must be used. To this effect, Geo-routing has recently received attention in large scale, mobile systems as it does not require endto-end path establishment and pre-computed packet forwarding routing structure at nodes. These properties make Geo-routing robust to highly dynamic route changes. For best performance, however, several parameters must be carefully tuned.In this paper we study the joint optimization of TCP and Geo-routing parameters to handle high speeds. We first introduce two highly mobile ad hoc scenarios that require reliable delivery, namely the vehicle urban grid and the airborne swarms. Then, we study the impact of critical system parameters (e.g., hello message exchange rate, delay timer in TCP for out-of-order delivery, etc) on the performance of both UDP and TCP. We improve hello message efficiency in Geo-routing by using an adaptive hello exchange scheme. Then, we fix the out-of-order problem in TCP by using a receiver-side out-of-order detection and delayed ack strategy. We show that these parameter adjustments are critical for efficient TCP over Geo-routing in highly mobile applications. With these enhancements our TCP with Geo-routing solution easily outperforms TCP over traditional ad hoc routing schemes, such as AODV.

show abstract

“…It is also important to factor in the choice of the routing approach the cost of the paths establishment. As the control overhead increases with the number of paths [6], it can potentially void the benefit of multipath routing. Therefore, estimating the probability of finding non-interfering paths given a network topology can help deciding whether for a particular network, multipath routing is an appropriate approach and if it can improve the system performance at all.…”

Section: Introductionmentioning

confidence: 99%

On the Probability of Finding Non-interfering Paths in Wireless Multihop Networks

Waharte

Boutaba

2008

NETWORKING 2008 Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet

View full text Add to dashboard Cite

Abstract. Multipath routing can improve system performance of capacity-limited wireless networks through load balancing. However, even with a single source and destination, intra-flow and inter-flow interference can void any performance improvement. In this paper, we show that establishing non-interfering paths can, in theory, leverage this issue. In practice however, finding non-interfering paths can be quite complex. In fact, we demonstrate that the problem of finding two non-interfering paths for a single source-destination pair is NP-complete. Therefore, an interesting problem is to determine if, given a network topology, non-interfering multipath routing is appropriate. To address this issue, we provide an analytic approximation of the probability of finding two non-interfering paths. The correctness of the analysis is verified by simulations.

show abstract

Performance analysis of reactive shortest path and multipath routing mechanism with load balance

Cited by 194 publications

References 13 publications

On the optimality of field-line routing in massively dense wireless multi-hop networks

On the optimality of field-line routing in massively dense wireless multi-hop networks

TCP over Geo-routing for High Mobility: Vehicle Grids and Airborne Swarms

On the Probability of Finding Non-interfering Paths in Wireless Multihop Networks

Contact Info

Product

Resources

About