A novel architecture for reduction of delay and queueing structure complexity in the back-pressure algorithm

Authors:
Loc X. Bui;R. Srikant;Alexander Stolyar
Affiliations:
Department of Management Science and Engineering, Stanford University, Stanford, CA;Department of Electrical and Computer Engineering and Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL;Bell Laboratories, Alcatel-Lucent, Murray Hill, NJ
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2011

Citing 7
Cited 3

Fair end-to-end window-based congestion control

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

Queueing Systems: Theory and Applications
Greedy primal-dual algorithm for dynamic resource allocation in complex networks

Queueing Systems: Theory and Applications
Horizon: balancing tcp over multiple paths in wireless mesh network

Proceedings of the 14th ACM international conference on Mobile computing and networking
Large number of queues in tandem: Scaling properties under back-pressure algorithm

Queueing Systems: Theory and Applications
Resource pricing and the evolution of congestion control

Automatica (Journal of IFAC)
Joint congestion control, routing, and MAC for stability and fairness in wireless networks

IEEE Journal on Selected Areas in Communications

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

IEEE/ACM Transactions on Networking (TON)
Throughput-optimal scheduling in multihop wireless networks without per-flow information

IEEE/ACM Transactions on Networking (TON)
Delay-based back-pressure scheduling in multihop wireless networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The back-pressure algorithm is a well-known throughput-optimal algorithm. However, its implementation requires that each node has to maintain a separate queue for each commodity in the network, and only one queue is served at a time. This fact may lead to a poor delay performance even when the traffic load is not close to network capacity. Also, since the number of commodities in the network is usually very large, the queueing data structure that has to be maintained at each node is respectively complex. In this paper, we present a solution to address both of these issues in the case of a fixed-routing network scenario where the route of each flow is chosen upon arrival. Our proposed architecture allows each node to maintain only per-neighbor queues and, moreover, improves the delay performance of the back-pressure algorithm.