Cluster-based back-pressure routing algorithm

Lei Ying, R. Srikant, Don Towsley

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

27 Citations (Scopus)

Abstract

We study scalable, distributed, and adaptive routing algorithms for communication networks. The back-pressure algorithm introduced in [21] 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, and 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 prevents its implementation in large-scale networks like the Internet. In this paper, we propose a cluster-based back-pressure routing algorithm, which retains the distributability and adaptability of back-pressure routing, while significantly reducing the number of queues that have to be maintained at each node. Since the cluster-based algorithm performs adaptive load-balancing in the network, it has the potential to eliminate the need for off-line traffic engineering in the Internet.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM
Pages1157-1165
Number of pages9
DOIs
StatePublished - 2008
Externally publishedYes
EventINFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications - Phoenix, AZ, United States
Duration: Apr 13 2008Apr 18 2008

Other

OtherINFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications
CountryUnited States
CityPhoenix, AZ
Period4/13/084/18/08

Fingerprint

Routing algorithms
Adaptive algorithms
Internet
Scheduling algorithms
Routers
Resource allocation
Telecommunication networks
Topology

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture

Cite this

Ying, L., Srikant, R., & Towsley, D. (2008). Cluster-based back-pressure routing algorithm. In Proceedings - IEEE INFOCOM (pp. 1157-1165). [4509691] https://doi.org/10.1109/INFOCOM.2007.96

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

Proceedings - IEEE INFOCOM. 2008. p. 1157-1165 4509691.

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

Ying, L, Srikant, R & Towsley, D 2008, Cluster-based back-pressure routing algorithm. in Proceedings - IEEE INFOCOM., 4509691, pp. 1157-1165, INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications, Phoenix, AZ, United States, 4/13/08. https://doi.org/10.1109/INFOCOM.2007.96
Ying L, Srikant R, Towsley D. Cluster-based back-pressure routing algorithm. In Proceedings - IEEE INFOCOM. 2008. p. 1157-1165. 4509691 https://doi.org/10.1109/INFOCOM.2007.96
Ying, Lei ; Srikant, R. ; Towsley, Don. / Cluster-based back-pressure routing algorithm. Proceedings - IEEE INFOCOM. 2008. pp. 1157-1165
@inproceedings{0ba8002d09c44edbb5b48f43c12ba3ac,
title = "Cluster-based back-pressure routing algorithm",
abstract = "We study scalable, distributed, and adaptive routing algorithms for communication networks. The back-pressure algorithm introduced in [21] 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, and 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 prevents its implementation in large-scale networks like the Internet. In this paper, we propose a cluster-based back-pressure routing algorithm, which retains the distributability and adaptability of back-pressure routing, while significantly reducing the number of queues that have to be maintained at each node. Since the cluster-based algorithm performs adaptive load-balancing in the network, it has the potential to eliminate the need for off-line traffic engineering in the Internet.",
author = "Lei Ying and R. Srikant and Don Towsley",
year = "2008",
doi = "10.1109/INFOCOM.2007.96",
language = "English (US)",
isbn = "9781424420261",
pages = "1157--1165",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

T1 - Cluster-based back-pressure routing algorithm

AU - Ying, Lei

AU - Srikant, R.

AU - Towsley, Don

PY - 2008

Y1 - 2008

N2 - We study scalable, distributed, and adaptive routing algorithms for communication networks. The back-pressure algorithm introduced in [21] 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, and 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 prevents its implementation in large-scale networks like the Internet. In this paper, we propose a cluster-based back-pressure routing algorithm, which retains the distributability and adaptability of back-pressure routing, while significantly reducing the number of queues that have to be maintained at each node. Since the cluster-based algorithm performs adaptive load-balancing in the network, it has the potential to eliminate the need for off-line traffic engineering in the Internet.

AB - We study scalable, distributed, and adaptive routing algorithms for communication networks. The back-pressure algorithm introduced in [21] 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, and 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 prevents its implementation in large-scale networks like the Internet. In this paper, we propose a cluster-based back-pressure routing algorithm, which retains the distributability and adaptability of back-pressure routing, while significantly reducing the number of queues that have to be maintained at each node. Since the cluster-based algorithm performs adaptive load-balancing in the network, it has the potential to eliminate the need for off-line traffic engineering in the Internet.

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

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

U2 - 10.1109/INFOCOM.2007.96

DO - 10.1109/INFOCOM.2007.96

M3 - Conference contribution

AN - SCOPUS:51349103148

SN - 9781424420261

SP - 1157

EP - 1165

BT - Proceedings - IEEE INFOCOM

ER -