Discounted integral priority routing for data networks

A Discounted Integral Priority (DIP) packet routing algorithm is presented. The method is derived for the network flow model of packet routing used for the derivation of backpressure type methods. Unlike backpressure type methods, DIP routing is designed to reduce the queue lengths rather than simply stabilize them. Our work leverages time discounted integral control to generate an adaptive packet routing algorithm which significantly outperforms its optimization motivated counterparts. Connections are drawn with stochastic heavy ball methods which allow implementation of a decaying stepsize. Stability proofs are presented for a stochastic heavy ball variant of the Discounted Integral Priority routing algorithm with a decaying step size. Our numerical experiments implement Discounted Integral Priority Routing with a unit step size and demonstrate fast convergence and significantly smaller steady state queue backlogs as compared with Soft Backpressure and Accelerated Backpressure.

[1]  Alejandro Ribeiro,et al.  Accelerated dual descent for network optimization , 2011, Proceedings of the 2011 American Control Conference.

[2]  Michael J. Neely.  Energy Optimal Control for Time-Varying Wireless Networks , 2006, IEEE Trans. Inf. Theory.

[3]  A. Robert Calderbank,et al.  Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures , 2007, Proceedings of the IEEE.

[4]  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).

[5]  Y. Nesterov.  A method for solving the convex programming problem with convergence rate O(1/k^2) , 1983 .

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

[7]  Yoram Singer,et al.  Adaptive Subgradient Methods for Online Learning and Stochastic Optimization , 2011, J. Mach. Learn. Res..

[8]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[9]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1990, 29th IEEE Conference on Decision and Control.

[10]  K. Schittkowski,et al.  NONLINEAR PROGRAMMING , 2022 .

[11]  Marc Teboulle,et al.  Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems , 2009, IEEE Transactions on Image Processing.

[12]  Johannes Grotendorst,et al.  Asymptotic series of generalized Lambert W function , 2014, ACCA.

[13]  Alejandro Ribeiro,et al.  Separation Principles in Wireless Networking , 2010, IEEE Transactions on Information Theory.

[14]  Alejandro Ribeiro,et al.  Accelerated backpressure algorithm , 2013, 2013 IEEE Global Communications Conference (GLOBECOM).

[15]  Boris Polyak.  Some methods of speeding up the convergence of iteration methods , 1964 .

[16]  Rayadurgam Srikant,et al.  The Mathematics of Internet Congestion Control , 2003 .

[17]  S. Flåm.  Optimization under Uncertainty using Momentum , 2004 .

[18]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[19]  Alejandro Ribeiro,et al.  Stochastic soft backpressure algorithms for routing and scheduling in wireless ad-hoc networks , 2009, 2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP).

[20]  Asuman E. Ozdaglar,et al.  Distributed Subgradient Methods for Multi-Agent Optimization , 2009, IEEE Transactions on Automatic Control.

[21]  Xuan Kong,et al.  Adaptive Signal Processing Algorithms: Stability and Performance , 1994 .

[22]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[23]  John N. Tsitsiklis,et al.  Gradient Convergence in Gradient methods with Errors , 1999, SIAM J. Optim..

[24]  Alejandro Ribeiro,et al.  Accelerated Dual Descent for Network Flow Optimization , 2014, IEEE Transactions on Automatic Control.