Optimal anticipative congestion control of flows with time-varying input stream

This paper is concerned with a new type of congestion control method that we call anticipative congestion control, which exploits probabilistic information available at a network node about congestion at other nodes. Motivated by the Internet flows behaving according to the Transmission Control Protocol, we consider a flow with time-varying input stream. We design a Markov decision process model for flow admission control and characterize the Whittle index in a closed form. This index measures the efficiency of flow data transmission at a router. We prove that such an index policy is optimal and that it further implies optimality of threshold policies. We apply the results to obtain an expression of the index for a single-bottleneck flow under several types of fairness criteria.

[1]  P. Naor.  The Regulation of Queue Size by Levying Tolls , 1969 .

[2]  J. Gittins,et al.  A forwards induction approach to candidate drug selection , 2011, Advances in Applied Probability.

[3]  José Niño-Mora,et al.  Dynamic priority allocation via restless bandit marginal productivity indices , 2007, 2304.06115.

[4]  Eytan Modiano,et al.  Fairness and Optimal Stochastic Control for Heterogeneous Networks , 2005, IEEE/ACM Transactions on Networking.

[5]  Fernando Paganini,et al.  Achieving network stability and user fairness through admission control of TCP connections , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

[6]  E. Garst,et al.  Birth , 1954 .

[7]  P. Jacko.  Marginal productivity index policies for dynamic priority allocation in restless bandit models , 2011 .

[8]  José Niño-Mora,et al.  Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach , 2002, Math. Program..

[9]  R. Srikant,et al.  A Mathematical Framework for Designing a Low-Loss, Low-Delay Internet , 2004 .

[10]  Mart Molle,et al.  Short-circuiting the congestion signaling path for AQM algorithms using reverse flow matching , 2005, Comput. Commun..

[11]  Kang G. Shin,et al.  The BLUE active queue management algorithms , 2002, TNET.

[12]  Alexei B. Piunovskiy.  Bicriteria Optimization of a Queue with a Controlled Input Stream , 2004, Queueing Syst. Theory Appl..

[13]  Eitan Altman,et al.  Generalized α-fair resource allocation in wireless networks , 2008, 2008 47th IEEE Conference on Decision and Control.

[14]  R. F. Brown,et al.  PERFORMANCE EVALUATION , 2019, ISO 22301:2019 and business continuity management – Understand how to plan, implement and enhance a business continuity management system (BCMS).

[15]  Deborah Estrin,et al.  Recommendations on Queue Management and Congestion Avoidance in the Internet , 1998, RFC.

[16]  Jianhua Cao,et al.  Linear programming relaxations and marginal productivity index policies for the buffer sharing problem , 2008, Queueing Syst. Theory Appl..

[17]  José Niño Mora.  Restless Bandits, Partial Conservation Laws and Indexability , 2000 .

[18]  P. Whittle.  Restless Bandits: Activity Allocation in a Changing World , 1988 .

[19]  F. Paganini,et al.  Congestion control with adaptive multipath routing based on optimization , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[20]  Derong Liu.  The Mathematics of Internet Congestion Control , 2005, IEEE Transactions on Automatic Control.

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

[22]  P. Whittle.  Restless bandits: activity allocation in a changing world , 1988, Journal of Applied Probability.

[23]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[24]  Jean C. Walrand,et al.  Fair end-to-end window-based congestion control , 2000, TNET.

[25]  Richard Weber,et al.  Comments on: Dynamic priority allocation via restless bandit marginal productivity indices , 2007 .

[26]  Costas Courcoubetis,et al.  Pricing communication networks - economics, technology and modelling , 2003, Wiley-Interscience series in systems and optimization.

[27]  Rayadurgam Srikant,et al.  The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications) , 2004 .

[28]  Sally Floyd,et al.  Promoting the use of end-to-end congestion control in the Internet , 1999, TNET.

[29]  Laurent Massoulié,et al.  Arguments in favour of admission control for TCP flows , 1999 .

[30]  P. Jacko,et al.  Congestion Avoidance with Future-Path Information , 2007 .

[31]  Damon Wischik,et al.  How to Mark Fairly , 1999 .

[32]  J. Gani,et al.  Birth, immigration and catastrophe processes , 1982, Advances in Applied Probability.

[33]  Fernando Paganini,et al.  Internet congestion control , 2002 .

[34]  Andreas Pitsillides,et al.  Congestion Control in Computer Networks , 2007 .