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

Lei Ying, Sanjay Shakkottai, Aneesh Reddy, Shihuan Liu

Research output: Contribution to journalArticle

88 Citations (Scopus)

Abstract

Back-pressure-type algorithms based on the algorithm by Tassiulas and Ephremides have recently received much attention for jointly routing and scheduling over multihop wireless networks. However, this approach has a significant weakness 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 a new routing/scheduling back-pressure algorithm 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)
Article number5675761
Pages (from-to)841-854
Number of pages14
JournalIEEE/ACM Transactions on Networking
Volume19
Issue number3
DOIs
StatePublished - Jun 2011
Externally publishedYes

Fingerprint

Wireless networks
Scheduling
Telecommunication traffic
Throughput

Keywords

  • Back-pressure routing
  • delay reduction
  • shortest-path routing
  • throughput-optimal

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Software
  • Computer Science Applications
  • Computer Networks and Communications

Cite this

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

In: IEEE/ACM Transactions on Networking, Vol. 19, No. 3, 5675761, 06.2011, p. 841-854.

Research output: Contribution to journalArticle

Ying, Lei ; Shakkottai, Sanjay ; Reddy, Aneesh ; Liu, Shihuan. / On combining shortest-path and back-pressure routing over multihop wireless networks. In: IEEE/ACM Transactions on Networking. 2011 ; Vol. 19, No. 3. pp. 841-854.
@article{103d082d7d694771a009b0c92e123e54,
title = "On combining shortest-path and back-pressure routing over multihop wireless networks",
abstract = "Back-pressure-type algorithms based on the algorithm by Tassiulas and Ephremides have recently received much attention for jointly routing and scheduling over multihop wireless networks. However, this approach has a significant weakness 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 a new routing/scheduling back-pressure algorithm 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.",
keywords = "Back-pressure routing, delay reduction, shortest-path routing, throughput-optimal",
author = "Lei Ying and Sanjay Shakkottai and Aneesh Reddy and Shihuan Liu",
year = "2011",
month = "6",
doi = "10.1109/TNET.2010.2094204",
language = "English (US)",
volume = "19",
pages = "841--854",
journal = "IEEE/ACM Transactions on Networking",
issn = "1063-6692",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

TY - JOUR

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

AU - Ying, Lei

AU - Shakkottai, Sanjay

AU - Reddy, Aneesh

AU - Liu, Shihuan

PY - 2011/6

Y1 - 2011/6

N2 - Back-pressure-type algorithms based on the algorithm by Tassiulas and Ephremides have recently received much attention for jointly routing and scheduling over multihop wireless networks. However, this approach has a significant weakness 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 a new routing/scheduling back-pressure algorithm 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-type algorithms based on the algorithm by Tassiulas and Ephremides have recently received much attention for jointly routing and scheduling over multihop wireless networks. However, this approach has a significant weakness 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 a new routing/scheduling back-pressure algorithm 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.

KW - Back-pressure routing

KW - delay reduction

KW - shortest-path routing

KW - throughput-optimal

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

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

U2 - 10.1109/TNET.2010.2094204

DO - 10.1109/TNET.2010.2094204

M3 - Article

VL - 19

SP - 841

EP - 854

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

IS - 3

M1 - 5675761

ER -