A predictive flow control scheme for efficient network utilization and QoS

In this paper, we develop a new predictive flow control scheme and analyze its performance. This scheme controls the nonreal-time (controllable) traffic based on predicting the real-time (uncontrollable) traffic. The goal of the work is to operate the network in a low congestion, high throughput regime. We provide a rigorous analysis of the performance of our flow control method and show that the algorithm has attractive and useful properties. From our analysis we obtain an explicit condition that gives us design guidelines on how to choose a predictor. We learn that it is especially important to take the queueing effect into account in developing the predictor. We also provide numerical results comparing different predictors that use varying degrees of information from the network.

[1]  Ness B. Shroff,et al.  A central-limit-theorem-based approach for analyzing queue behavior in high-speed networks , 1998, TNET.

[2]  San-qi Li,et al.  A linear dynamic model for design of stable explicit-rate ABR control schemes , 1997, Proceedings of INFOCOM '97.

[3]  Eitan Altman,et al.  Congestion control as a stochastic control problem with action delays , 1999, Autom..

[4]  Sally Floyd,et al.  TCP and explicit congestion notification , 1994, CCRV.

[5]  T. Hughes,et al.  Signals and systems , 2006, Genome Biology.

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

[7]  Eitan Altman,et al.  Rate based flow control with bandwidth information , 1997, Eur. Trans. Telecommun..

[8]  Ness B. Shroff,et al.  Use of the supremum distribution of Gaussian Processes in queueing analysis with long-range Dependence and self-similarity , 2000 .

[9]  P. Glynn,et al.  Logarithmic asymptotics for steady-state tail probabilities in a single-server queue , 1994, Journal of Applied Probability.

[10]  Semyon M. Meerkov,et al.  Feedback control of congestion in packet switching networks: the case of a single congested node , 1993, TNET.

[11]  Ness B. Shroff,et al.  Queueing properties of feedback flow control systems , 2005, IEEE/ACM Transactions on Networking.

[12]  Eitan Altman,et al.  Discrete-Time Analysis of Adaptive Rate Control Mechanisms , 1993, Data Communication Networks and their Performance.

[13]  Catherine Rosenberg,et al.  A game theoretic framework for bandwidth allocation and pricing in broadband networks , 2000, TNET.

[14]  R. M. Loynes,et al.  The stability of a queue with non-independent inter-arrival and service times , 1962, Mathematical Proceedings of the Cambridge Philosophical Society.

[15]  A. Udaya Shankar,et al.  Dynamical behavior of rate-based flow control mechanisms , 1990, CCRV.

[16]  Nanying Yin,et al.  On closed loop rate control for ATM cell relay networks , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

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

[18]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[19]  N. Shroff,et al.  On the asymptotic relationship between the overflow probability and the loss ratio , 2001, Advances in Applied Probability.

[20]  Ravi Mazumdar,et al.  Cell loss asymptotics in buffers fed by heterogeneous long-tailed sources , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[21]  A. Zwart.  A fluid queue with a finite buffer and subexponential input , 2000, Advances in Applied Probability.

[22]  Raj Jain,et al.  The osu scheme for congestion avoidance using explicit rate indication , 1994 .