On combining shortest-path and back-pressure routing over multihop wireless networks

Lei Ying, Sanjay Shakkottai, Aneesh Reddy

Research output: Chapter in Book/Report/Conference proceedingConference contribution

86 Citations (Scopus)

Abstract

Back-pressure based algorithms based on the algorithm by Tassiulas and Ephremides have recently received much attention for jointly routing and scheduling over multi-hop wireless networks. However a significant weakness of this approach has been in routing, because the traditional back-pressure algorithm explores and exploits all feasible paths between each source and destination. While this extensive exploration is essential in order to maintain stability when the network is heavily loaded, under light or moderate loads, packets may be sent over unnecessarily long routes and the algorithm could be very inefficient in terms of end-to-end delay and routing convergence times. This paper proposes new routing/scheduling back-pressure algorithms that not only guarantees network stability (throughput optimality), but also adaptively selects a set of optimal routes based on shortest-path information in order to minimize average path-lengths between each source and destination pair. Our results indicate that under the traditional back-pressure algorithm, the end-to-end packet delay first decreases and then increases as a function of the network load (arrival rate). This surprising low-load behavior is explained due to the fact that the traditional back-pressure algorithm exploits all paths (including very long ones) even when the traffic load is light. On the other-hand, the proposed algorithm adaptively selects a set of routes according to the traffic load so that long paths are used only when necessary, thus resulting in much smaller end-to-end packet delays as compared to the traditional back-pressure algorithm.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM
Pages1674-1682
Number of pages9
DOIs
StatePublished - 2009
Externally publishedYes
Event28th Conference on Computer Communications, IEEE INFOCOM 2009 - Rio de Janeiro, Brazil
Duration: Apr 19 2009Apr 25 2009

Other

Other28th Conference on Computer Communications, IEEE INFOCOM 2009
CountryBrazil
CityRio de Janeiro
Period4/19/094/25/09

Fingerprint

Wireless networks
Scheduling
Telecommunication traffic
Throughput

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Ying, L., Shakkottai, S., & Reddy, A. (2009). On combining shortest-path and back-pressure routing over multihop wireless networks. In Proceedings - IEEE INFOCOM (pp. 1674-1682). [5062086] https://doi.org/10.1109/INFCOM.2009.5062086

On combining shortest-path and back-pressure routing over multihop wireless networks. / Ying, Lei; Shakkottai, Sanjay; Reddy, Aneesh.

Proceedings - IEEE INFOCOM. 2009. p. 1674-1682 5062086.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ying, L, Shakkottai, S & Reddy, A 2009, On combining shortest-path and back-pressure routing over multihop wireless networks. in Proceedings - IEEE INFOCOM., 5062086, pp. 1674-1682, 28th Conference on Computer Communications, IEEE INFOCOM 2009, Rio de Janeiro, Brazil, 4/19/09. https://doi.org/10.1109/INFCOM.2009.5062086
Ying L, Shakkottai S, Reddy A. On combining shortest-path and back-pressure routing over multihop wireless networks. In Proceedings - IEEE INFOCOM. 2009. p. 1674-1682. 5062086 https://doi.org/10.1109/INFCOM.2009.5062086
Ying, Lei ; Shakkottai, Sanjay ; Reddy, Aneesh. / On combining shortest-path and back-pressure routing over multihop wireless networks. Proceedings - IEEE INFOCOM. 2009. pp. 1674-1682
@inproceedings{e8e82d8113c541c3a9dbedcca8500566,
title = "On combining shortest-path and back-pressure routing over multihop wireless networks",
abstract = "Back-pressure based algorithms based on the algorithm by Tassiulas and Ephremides have recently received much attention for jointly routing and scheduling over multi-hop wireless networks. However a significant weakness of this approach has been in routing, because the traditional back-pressure algorithm explores and exploits all feasible paths between each source and destination. While this extensive exploration is essential in order to maintain stability when the network is heavily loaded, under light or moderate loads, packets may be sent over unnecessarily long routes and the algorithm could be very inefficient in terms of end-to-end delay and routing convergence times. This paper proposes new routing/scheduling back-pressure algorithms that not only guarantees network stability (throughput optimality), but also adaptively selects a set of optimal routes based on shortest-path information in order to minimize average path-lengths between each source and destination pair. Our results indicate that under the traditional back-pressure algorithm, the end-to-end packet delay first decreases and then increases as a function of the network load (arrival rate). This surprising low-load behavior is explained due to the fact that the traditional back-pressure algorithm exploits all paths (including very long ones) even when the traffic load is light. On the other-hand, the proposed algorithm adaptively selects a set of routes according to the traffic load so that long paths are used only when necessary, thus resulting in much smaller end-to-end packet delays as compared to the traditional back-pressure algorithm.",
author = "Lei Ying and Sanjay Shakkottai and Aneesh Reddy",
year = "2009",
doi = "10.1109/INFCOM.2009.5062086",
language = "English (US)",
isbn = "9781424435135",
pages = "1674--1682",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

T1 - On combining shortest-path and back-pressure routing over multihop wireless networks

AU - Ying, Lei

AU - Shakkottai, Sanjay

AU - Reddy, Aneesh

PY - 2009

Y1 - 2009

N2 - Back-pressure based algorithms based on the algorithm by Tassiulas and Ephremides have recently received much attention for jointly routing and scheduling over multi-hop wireless networks. However a significant weakness of this approach has been in routing, because the traditional back-pressure algorithm explores and exploits all feasible paths between each source and destination. While this extensive exploration is essential in order to maintain stability when the network is heavily loaded, under light or moderate loads, packets may be sent over unnecessarily long routes and the algorithm could be very inefficient in terms of end-to-end delay and routing convergence times. This paper proposes new routing/scheduling back-pressure algorithms that not only guarantees network stability (throughput optimality), but also adaptively selects a set of optimal routes based on shortest-path information in order to minimize average path-lengths between each source and destination pair. Our results indicate that under the traditional back-pressure algorithm, the end-to-end packet delay first decreases and then increases as a function of the network load (arrival rate). This surprising low-load behavior is explained due to the fact that the traditional back-pressure algorithm exploits all paths (including very long ones) even when the traffic load is light. On the other-hand, the proposed algorithm adaptively selects a set of routes according to the traffic load so that long paths are used only when necessary, thus resulting in much smaller end-to-end packet delays as compared to the traditional back-pressure algorithm.

AB - Back-pressure based algorithms based on the algorithm by Tassiulas and Ephremides have recently received much attention for jointly routing and scheduling over multi-hop wireless networks. However a significant weakness of this approach has been in routing, because the traditional back-pressure algorithm explores and exploits all feasible paths between each source and destination. While this extensive exploration is essential in order to maintain stability when the network is heavily loaded, under light or moderate loads, packets may be sent over unnecessarily long routes and the algorithm could be very inefficient in terms of end-to-end delay and routing convergence times. This paper proposes new routing/scheduling back-pressure algorithms that not only guarantees network stability (throughput optimality), but also adaptively selects a set of optimal routes based on shortest-path information in order to minimize average path-lengths between each source and destination pair. Our results indicate that under the traditional back-pressure algorithm, the end-to-end packet delay first decreases and then increases as a function of the network load (arrival rate). This surprising low-load behavior is explained due to the fact that the traditional back-pressure algorithm exploits all paths (including very long ones) even when the traffic load is light. On the other-hand, the proposed algorithm adaptively selects a set of routes according to the traffic load so that long paths are used only when necessary, thus resulting in much smaller end-to-end packet delays as compared to the traditional back-pressure algorithm.

UR - http://www.scopus.com/inward/record.url?scp=70349653234&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70349653234&partnerID=8YFLogxK

U2 - 10.1109/INFCOM.2009.5062086

DO - 10.1109/INFCOM.2009.5062086

M3 - Conference contribution

AN - SCOPUS:70349653234

SN - 9781424435135

SP - 1674

EP - 1682

BT - Proceedings - IEEE INFOCOM

ER -