Bias Based General Framework for Delay Reduction in Backpressure Routing Algorithm

In queueing networks, it is well known that the throughput-optimal backpressure routing algorithm results in poor delay performance for light and moderate traffic loads. To improve delay performance of backpressure routing algorithm, available works exploit various information of queueing networks, such as queue length, shortest path and packet delay, to direct packets to shorter routes to their destinations. Despite different forms of these works, they share the common characteristic: using bias to help backpressure routing to reduce packet delay. From this observation, we propose in this paper a bias based general framework to reduce packet delay of backpressure routing algorithm. Our framework is general in the sense that it not only covers many bias based variants of backpressure routing algorithm as special cases but also enables machine learning based methods to be adopted to further improve delay performance. Based on the general framework, we propose a specific Q-learning based backpressure routing algorithm to reduce packet delay.

[1]  Richard S. Sutton,et al.  Reinforcement Learning: An Introduction , 1998, IEEE Trans. Neural Networks.

[2]  Vincent K. N. Lau,et al.  A Survey on Delay-Aware Resource Control for Wireless Systems—Large Deviation Theory, Stochastic Lyapunov Drift, and Distributed Stochastic Learning , 2011, IEEE Transactions on Information Theory.

[3]  Ping Yin,et al.  Improving Backpressure-based Adaptive Routing via Incremental Expansion of Routing Choices , 2017, 2017 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS).

[4]  Lei Ying,et al.  On Combining Shortest-Path and Back-Pressure Routing Over Multihop Wireless Networks , 2011, IEEE/ACM Transactions on Networking.

[5]  Ran Liu,et al.  Enhancing the Delay Performance of Dynamic Backpressure Algorithms , 2016, IEEE/ACM Trans. Netw..

[6]  Leandros Tassiulas,et al.  Resource Allocation and Cross-Layer Control in Wireless Networks , 2006, Found. Trends Netw..

[7]  H. T. Mouftah,et al.  A virtual queue-based back-pressure scheduling algorithm for wireless sensor networks , 2015, EURASIP J. Wirel. Commun. Netw..

[8]  O. Rajitha,et al.  Backpressure-Based Packet-By-Packet Adaptive Routing For Traffic Management in Communication Networks , 2014 .

[9]  Ness B. Shroff,et al.  Delay-Based Back-Pressure Scheduling in Multihop Wireless Networks , 2011, IEEE/ACM Transactions on Networking.

[10]  Michael J. Neely,et al.  Dynamic power allocation and routing for satellite and wireless networks with time varying channels , 2003 .

[11]  Michael L. Littman,et al.  Packet Routing in Dynamically Changing Networks: A Reinforcement Learning Approach , 1993, NIPS.

[12]  Eytan Modiano,et al.  Dynamic power allocation and routing for time varying wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[13]  Eleftheria Athanasopoulou,et al.  Back-Pressure-Based Packet-by-Packet Adaptive Routing in Communication Networks , 2013, IEEE/ACM Transactions on Networking.