Back-pressure-based packet-by-packet adaptive routing in communication networks

Authors:
Eleftheria Athanasopoulou;Loc X. Bui;Tianxiong Ji;R. Srikant;Alexander Stolyar
Affiliations:
Coordinated Science Laboratory and Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, Urbana, IL;School of Engineering, Tan Tao University, Long An, Vietnam;Google, Inc., Mountain View, CA and Coordinated Science Laboratory and Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, Urbana, IL;Coordinated Science Laboratory and Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, Urbana, IL;Bell Labs, Alcatel-Lucent, Murray Hill, NJ
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2013

Citing 13
Cited 1

Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm

Queueing Systems: Theory and Applications
XORs in the air: practical wireless network coding

Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Enabling distributed throughput maximization in wireless mesh networks: a partitioning approach

Proceedings of the 12th annual international conference on Mobile computing and networking
A simple local-control approximation algorithm for multicommodity flow

SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
A refined performance characterization of longest-queue-first policy in wireless networks

Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks

Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Dynamic algorithms for multicast with intra-session network coding

IEEE Transactions on Information Theory
Network coding-aware rate control and scheduling in wireless networks

ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
Control of Multi-Hop Communication Networks for Inter-Session Network Coding

IEEE Transactions on Information Theory
Dynamic power allocation and routing for time-varying wireless networks

IEEE Journal on Selected Areas in Communications
A tutorial on cross-layer optimization in wireless networks

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
A novel architecture for reduction of delay and queueing structure complexity in the back-pressure algorithm

IEEE/ACM Transactions on Networking (TON)

LIFO-backpressure achieves near-optimal utility-delay tradeoff

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Back-pressure-based adaptive routing algorithms where each packet is routed along a possibly different path have been extensively studied in the literature. However, such algorithms typically result in poor delay performance and involve high implementation complexity. In this paper, we develop a new adaptive routing algorithm built upon the widely studied backpressure algorithm. We decouple the routing and scheduling components of the algorithm by designing a probabilistic routing table that is used to route packets to per-destination queues. The scheduling decisions in the case of wireless networks are made using counters called shadow queues. The results are also extended to the case of networks that employ simple forms of network coding. In that case, our algorithm provides a low-complexity solution to optimally exploit the routing-coding tradeoff.