Cluster-based back-pressure routing algorithm

Lei Ying, R. Srikant, Don Towsley, Shihuan Liu

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

The back-pressure algorithm introduced in 1992 by Tassiulas and Ephremides is a well-known distributed and adaptive routing/scheduling algorithm where nodes only need the queue-length information of neighboring nodes to make routing decisions. Packets are adaptively routed in the network according to congestion information, which makes the algorithm resilient to traffic and topology changes. However, the back-pressure algorithm requires routers to maintain a separate queue for each destination, which precludes its implementation in large-scale networks. In this paper, we propose a distributed cluster-based back-pressure routing algorithm that retains the adaptability of back-pressure routing while significantly reducing the number of queues that have to be maintained at each node.

Original languageEnglish (US)
Article number5759110
Pages (from-to)1773-1786
Number of pages14
JournalIEEE/ACM Transactions on Networking
Volume19
Issue number6
DOIs
StatePublished - Dec 2011
Externally publishedYes

Fingerprint

Routing algorithms
Scheduling algorithms
Routers
Topology

Keywords

  • Back-pressure algorithm
  • clustering
  • distributed and adaptive routing
  • throughput-optimal

ASJC Scopus subject areas

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

Cite this

Cluster-based back-pressure routing algorithm. / Ying, Lei; Srikant, R.; Towsley, Don; Liu, Shihuan.

In: IEEE/ACM Transactions on Networking, Vol. 19, No. 6, 5759110, 12.2011, p. 1773-1786.

Research output: Contribution to journalArticle

Ying, L, Srikant, R, Towsley, D & Liu, S 2011, 'Cluster-based back-pressure routing algorithm', IEEE/ACM Transactions on Networking, vol. 19, no. 6, 5759110, pp. 1773-1786. https://doi.org/10.1109/TNET.2011.2141682
Ying, Lei ; Srikant, R. ; Towsley, Don ; Liu, Shihuan. / Cluster-based back-pressure routing algorithm. In: IEEE/ACM Transactions on Networking. 2011 ; Vol. 19, No. 6. pp. 1773-1786.
@article{fc2d96507e4247058349487d3165df3b,
title = "Cluster-based back-pressure routing algorithm",
abstract = "The back-pressure algorithm introduced in 1992 by Tassiulas and Ephremides is a well-known distributed and adaptive routing/scheduling algorithm where nodes only need the queue-length information of neighboring nodes to make routing decisions. Packets are adaptively routed in the network according to congestion information, which makes the algorithm resilient to traffic and topology changes. However, the back-pressure algorithm requires routers to maintain a separate queue for each destination, which precludes its implementation in large-scale networks. In this paper, we propose a distributed cluster-based back-pressure routing algorithm that retains the adaptability of back-pressure routing while significantly reducing the number of queues that have to be maintained at each node.",
keywords = "Back-pressure algorithm, clustering, distributed and adaptive routing, throughput-optimal",
author = "Lei Ying and R. Srikant and Don Towsley and Shihuan Liu",
year = "2011",
month = "12",
doi = "10.1109/TNET.2011.2141682",
language = "English (US)",
volume = "19",
pages = "1773--1786",
journal = "IEEE/ACM Transactions on Networking",
issn = "1063-6692",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - Cluster-based back-pressure routing algorithm

AU - Ying, Lei

AU - Srikant, R.

AU - Towsley, Don

AU - Liu, Shihuan

PY - 2011/12

Y1 - 2011/12

N2 - The back-pressure algorithm introduced in 1992 by Tassiulas and Ephremides is a well-known distributed and adaptive routing/scheduling algorithm where nodes only need the queue-length information of neighboring nodes to make routing decisions. Packets are adaptively routed in the network according to congestion information, which makes the algorithm resilient to traffic and topology changes. However, the back-pressure algorithm requires routers to maintain a separate queue for each destination, which precludes its implementation in large-scale networks. In this paper, we propose a distributed cluster-based back-pressure routing algorithm that retains the adaptability of back-pressure routing while significantly reducing the number of queues that have to be maintained at each node.

AB - The back-pressure algorithm introduced in 1992 by Tassiulas and Ephremides is a well-known distributed and adaptive routing/scheduling algorithm where nodes only need the queue-length information of neighboring nodes to make routing decisions. Packets are adaptively routed in the network according to congestion information, which makes the algorithm resilient to traffic and topology changes. However, the back-pressure algorithm requires routers to maintain a separate queue for each destination, which precludes its implementation in large-scale networks. In this paper, we propose a distributed cluster-based back-pressure routing algorithm that retains the adaptability of back-pressure routing while significantly reducing the number of queues that have to be maintained at each node.

KW - Back-pressure algorithm

KW - clustering

KW - distributed and adaptive routing

KW - throughput-optimal

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

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

U2 - 10.1109/TNET.2011.2141682

DO - 10.1109/TNET.2011.2141682

M3 - Article

AN - SCOPUS:84655162246

VL - 19

SP - 1773

EP - 1786

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

IS - 6

M1 - 5759110

ER -