Novel Architectures and Algorithms for Delay Reduction in Back-pressure\n Scheduling and Routing

2009/01/09 by Loc Bui, Bui, Loc, R. Srikant +3 · 2 citations
Computer Science · Engineering · #Advanced Wireless Network Optimization #FOS: Computer and information sciences #Interconnection Networks and Systems #Mobile Ad Hoc Networks #Network Traffic and Congestion Control #Networking and Internet Architecture (cs.NI)

paper · pdf · doi:10.48550/arxiv.0901.1312

openalex publication_date 2009/01/09 · openalex created_date 2022/10/05 · openalex updated_date 2026/07/28

Abstract

The back-pressure algorithm is a well-known throughput-optimal algorithm.\nHowever, its delay performance may be quite poor even when the traffic load is\nnot close to network capacity due to the following two reasons. First, each\nnode has to maintain a separate queue for each commodity in the network, and\nonly one queue is served at a time. Second, the back-pressure routing algorithm\nmay route some packets along very long routes. In this paper, we present\nsolutions to address both of the above issues, and hence, improve the delay\nperformance of the back-pressure algorithm. One of the suggested solutions also\ndecreases the complexity of the queueing data structures to be maintained at\neach node.\n

Cited by

• Max-Weight Scheduling in Queueing Networks with Heavy-Tailed Traffic
• Towards a Queueing-Based Framework for In-Network Function Computation

Related

• Enhancing the Delay Performance of Dynamic Backpressure Algorithms
• A New Backpressure Algorithm for Joint Rate Control and Routing with Vanishing Utility Optimality Gaps and Finite Queue Lengths
• Backpressure-based Packet-by-Packet Adaptive Routing in Communication\n Networks
• Multi-Agent Q-Learning Aided Backpressure Routing Algorithm for Delay Reduction
• Delay-aware Backpressure Routing Using Graph Neural Networks