Cluster-based back-pressure routing algorithm

Authors:
Lei Ying;R. Srikant;Don Towsley;Shihuan Liu
Affiliations:
Department of Electrical and Computer Engineering, Iowa State University, Ames, IA;Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, Urbana, IL;Department of Computer Science, University of Massachusetts Amherst, Amherst, MA;Department of Electrical and Computer Engineering, Iowa State University, Ames, IA
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2011

Citing 12
Cited 0

Guidelines for interdomain traffic engineering

ACM SIGCOMM Computer Communication Review
Stability of end-to-end algorithms for joint routing and rate control

ACM SIGCOMM Computer Communication Review
Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks

IEEE/ACM Transactions on Networking (TON)
Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm

Queueing Systems: Theory and Applications
Optimal Routing with Multiple Traffic Matrices Tradeoff between Average andWorst Case Performance

ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
Maximizing throughput in wireless networks via gossiping

SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Multi-path TCP: a joint congestion control and routing scheme to exploit path diversity in the internet

IEEE/ACM Transactions on Networking (TON)
Dynamic load balancing without packet reordering

ACM SIGCOMM Computer Communication Review
Distributed link scheduling with constant overhead

Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A simple local-control approximation algorithm for multicommodity flow

SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Determining the optimal configuration for the zone routing protocol

IEEE Journal on Selected Areas in Communications
Joint congestion control, routing, and MAC for stability and fairness in wireless networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

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 backpressure 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.