research-article

Loop-Free Backpressure Routing Using Link-Reversal Algorithms

Authors:

Georgios Paschos,

Eytan ModianoAuthors Info & Claims

MobiHoc '15: Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing

Pages 87 - 96

https://doi.org/10.1145/2746285.2746304

Published: 22 June 2015 Publication History

Abstract

The backpressure routing policy is known to be a throughput optimal policy that supports any feasible traffic demand in data networks, but may have poor delay performance when packets traverse loops in the network. In this paper, we study loop-free backpressure routing policies that forward packets along directed acyclic graphs (DAGs) to avoid the looping problem. These policies use link reversal algorithms to improve the DAGs in order to support any achievable traffic demand.

For a network with a single commodity, we show that a DAG that supports a given traffic demand can be found after a finite number of iterations of the link-reversal process. We use this to develop a joint link-reversal and backpressure routing policy, called the loop free backpressure (LFBP) algorithm. This algorithm forwards packets on the DAG, while the DAG is dynamically updated based on the growth of the queue backlogs. We show by simulations that such a DAG-based policy improves the delay over the classical backpressure routing policy. We also propose a multicommodity version of the LFBP algorithm, and via simulation we show that its delay performance is better than that of backpressure.

References

[1]

L. Tassiulas and A. Ephremides, "Stability properties of constrained queueing systems and scheduling for maximum throughput in multihop radio networks," IEEE Transactions on Automatic Control, vol. 37, no. 12, pp. 1936--1949, December 1992.

[2]

L. X. Bui, R. Srikant and A. Stolyar, "A novel architecture for reduction of delay and queueing structure complexity in the back-pressure algorithm," IEEE/ACM Transactions on Networking, vol. 19, no. 6, pp. 1597--1609, December 2011.

Digital Library

[3]

M. J. Neely, E. Modiano and C. E. Rohrs, "Dynamic power allocation and routing for time varying wireless networks," IEEE Journal on Selected Areas in Communications, Special Issue on Wireless Ad-hoc Networks, vol. 23, no. 1, pp. 89--103, January 2005.

Digital Library

[4]

E. Gafni and D. Bertsekas, "Distributed algorithms for generating loop-free routes in networks with frequently changing topology," IEEE Transactions on Communications, vol. 29, no. 1, pp. 11--18, January 1981.

[5]

V.D. Park and M.S. Corson, "A highly adaptive distributed routing algorithm for mobile wireless networks," INFOCOM, 1997.

Digital Library

[6]

L. Georgiadis and L. Tassiulas, "Optimal overload response in sensor networks." IEEE Transactions on Information Theory, vol.52, no. 6, pp. 2684--2696, June 2006.

Digital Library

[7]

H. Xiong, R. Li, A. Eryilmaz and E. Ekici, "Delay-aware cross-layer design for network utility maximization in multi-hop networks." IEEE Journal on Selected Areas in Communications, vol. 29, no. 5, pp. 951--959, May 2011.

[8]

L. Ying, S. Shakkottai, A. Reddy and S. Liu, "On combining shortest-path and backpressure routing over multihop wireless networks," IEEE/ACM Transactions on Networking, vol. 19, no. 3, pp. 841--854, June 2011.

Digital Library

[9]

P.-K. Huang, X. Lin, and C.-C. Wang, "A low-complexity congestion control and scheduling algorithm for multihop wireless networks with order-optimal per-flow delay," IEEE/ACM Trans. on Networking, vol. 21, no. 2, pp. 2588--2596, April 2013.

Digital Library

[10]

M. J. Neely, "Stochastic network optimization with application to communication and queueing systems," Morgan & Claypool, 2010.

Digital Library

[11]

L. R. Ford and D. R. Fulkerson, "Maximal flow through a network," Canadian Journal of Mathematics, 8: 399, 1956.

[12]

L. Georgiadis, P. Georgatsos, K. Floros, and S. Sartzetakis, "Lexicographically optimal balanced networks," IEEE/ACM Transactions on Networking, vol.10, no. 6, pp. 818--829, December 2002.

Digital Library

[13]

L. Huang and M. J. Neely, "Delay reduction via Lagrange multipliers in stochastic network optimization," IEEE Transactions on Automatic Control, vol. 56, no. 4, pp. 842--857, April 2011.

[14]

L. Georgiadis, M. J. Neely and L. Tassiulas, "Resource allocation and cross-layer control in wireless networks," Foundations and trends in networking, Now Publishers Inc, 2006.

Digital Library

[15]

A. Rai, C.P. Li, G. Paschos, E. Modiano, "Loop-Free Backpressure Routing Using Link-Reversal Algorithms," http://arxiv.org/abs/1503.06857, Technical Report.

Cited By

Dong WChen GZhang XGao Y(2019)Trading Routing Diversity for Better Network PerformanceIEEE Transactions on Mobile Computing10.1109/TMC.2018.285927018:6(1433-1446)Online publication date: 1-Jun-2019
https://doi.org/10.1109/TMC.2018.2859270
Rai ALi CPaschos GModiano ERai AChih-ping Li Paschos GModiano E(2017)Loop-Free Backpressure Routing Using Link-Reversal AlgorithmsIEEE/ACM Transactions on Networking10.1109/TNET.2017.271580725:5(2988-3002)Online publication date: 1-Oct-2017
https://dl.acm.org/doi/10.1109/TNET.2017.2715807
Vargaftik SKeslassy IOrda A(2017)No Packet Left BehindIEEE/ACM Transactions on Networking10.1109/TNET.2017.270636625:4(2571-2584)Online publication date: 1-Aug-2017
https://dl.acm.org/doi/10.1109/TNET.2017.2706366
Show More Cited By

Index Terms

Loop-Free Backpressure Routing Using Link-Reversal Algorithms
1. Networks
  1. Network protocols
    1. Network layer protocols
      1. Routing protocols

Recommendations

Loop-Free Backpressure Routing Using Link-Reversal Algorithms

The backpressure routing policy is known to be a throughput optimal policy that supports any feasible traffic demand, but may have poor delay performance when packets traverse loops in the network. In this paper, we study loop-free backpressure routing ...
Improving Backpressure-based Adaptive Routing via Incremental Expansion of Routing Choices
ANCS '17: Proceedings of the Symposium on Architectures for Networking and Communications Systems

Backpressure-based adaptive routing algorithms have been studied extensively in the literature. Although backpressure-based adaptive routing algorithms have been shown to be network-wide throughput optimal, they typically have poor delay performance ...
On-Demand Loop-Free Routing with Link Vectors
ICNP '04: Proceedings of the 12th IEEE International Conference on Network Protocols

We present the on-demand link vector (OLIVE) protocol, a routing protocol for ad-hoc networks based on link-state information that is free of routing loops and supports destination-based packet forwarding. Routers exchange routing information reactively ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

MobiHoc '15: Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing

June 2015

436 pages

ISBN:9781450334891

DOI:10.1145/2746285

General Chairs:
Sherman Shen
University of Waterloo, Canada
,
Youxian Sun
Zhejiang University, China
,
Jiming Chen
Zhejiang University, China
,
Program Chairs:
Junshan Zhang
Arizona State University, USA
,
Gil Zussman
Columbia University, USA

Copyright © 2015 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 June 2015

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

NSF
ONR

Conference

MobiHoc'15

Sponsor:

SIGMOBILE

MobiHoc'15: The Sixteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing

June 22 - 25, 2015

Hangzhou, China

Acceptance Rates

MobiHoc '15 Paper Acceptance Rate 37 of 250 submissions, 15%;

Overall Acceptance Rate 296 of 1,843 submissions, 16%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
181
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Dong WChen GZhang XGao Y(2019)Trading Routing Diversity for Better Network PerformanceIEEE Transactions on Mobile Computing10.1109/TMC.2018.285927018:6(1433-1446)Online publication date: 1-Jun-2019
https://doi.org/10.1109/TMC.2018.2859270
Rai ALi CPaschos GModiano ERai AChih-ping Li Paschos GModiano E(2017)Loop-Free Backpressure Routing Using Link-Reversal AlgorithmsIEEE/ACM Transactions on Networking10.1109/TNET.2017.271580725:5(2988-3002)Online publication date: 1-Oct-2017
https://dl.acm.org/doi/10.1109/TNET.2017.2715807
Vargaftik SKeslassy IOrda A(2017)No Packet Left BehindIEEE/ACM Transactions on Networking10.1109/TNET.2017.270636625:4(2571-2584)Online publication date: 1-Aug-2017
https://dl.acm.org/doi/10.1109/TNET.2017.2706366
Jones NPaschos GShrader BModiano EJones NPaschos GShrader BModiano E(2017)An Overlay Architecture for Throughput Optimal Multipath RoutingIEEE/ACM Transactions on Networking10.1109/TNET.2017.270386725:5(2615-2628)Online publication date: 1-Oct-2017
https://dl.acm.org/doi/10.1109/TNET.2017.2703867
Zhang XDong WRen W(2016)Trading routing diversity for better network performance2016 IEEE 24th International Conference on Network Protocols (ICNP)10.1109/ICNP.2016.7784448(1-10)Online publication date: Nov-2016
https://doi.org/10.1109/ICNP.2016.7784448

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

EPUB

View this article in ePub.

Figures

Tables

Media

View Table of Conten