Multiuser rate-based flow control

Flow and congestion control allow the users of a telecommunication network to regulate the traffic that they send into the network in accordance with the quality of service that they require. Flow control may be performed by the network, as is the case in asynchronous transfer mode (ATM) networks (the available bit rate (ABR) transfer capacity), or by the users themselves, as is the case in the Internet [transmission control protocol/Internet protocol (TCP/IP)]. We study both situations using optimal control and dynamic game techniques. The first situation leads to the formulation of a dynamic team problem, while the second one leads to a dynamic noncooperative game, for which we establish the existence and uniqueness of a linear Nash equilibrium and obtain a characterization of the corresponding equilibrium policies along with the performance costs. We further show that when the users update their policies in a greedy manner, not knowing a priori the utilities of the other players, the sequence of policies thus generated converges to the Nash equilibrium. Finally, we study an extension of the model that accommodates multiple traffic types for each user, with the switching from one type of traffic to another being governed by a Markov jump process. Presentation of some numerical results complements this study.

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

[2]  Alan Weiss,et al.  Analysis of a rate-based control strategy with delayed feedback , 1992, SIGCOMM 1992.

[3]  M. Ritter,et al.  Network buffer requirements of the rate-based control mechanism for ABR services , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[4]  Ariel Orda,et al.  Architecting noncooperative networks , 1995, Eighteenth Convention of Electrical and Electronics Engineers in Israel.

[5]  E. Altman,et al.  Multi-user rate-based flow control with action delays: a team-theoretic approach , 1997, Proceedings of the 36th IEEE Conference on Decision and Control.

[6]  Bhaskar Chakravorti Optimal flow control of an M/M/1 queue with a balanced budget , 1994, IEEE Trans. Autom. Control..

[7]  Ariel Orda,et al.  Virtual path bandwidth allocation in multi-user networks , 1995, Proceedings of INFOCOM'95.

[8]  Christos Douligeris,et al.  A game theoretic perspective to flow control in telecommunication networks , 1992 .

[9]  Christos Douligeris,et al.  Fairness in network optimal flow control: optimality of product forms , 1991, IEEE Trans. Commun..

[10]  F. Bonomi,et al.  The rate-based flow control framework for the available bit rate ATM service , 1995, IEEE Netw..

[11]  Alan Weiss,et al.  Analysis of a rate-based control strategy with delayed feedback , 1992, SIGCOMM '92.

[12]  Ariel Orda,et al.  Virtual path bandwidth allocation in multiuser networks , 1997, TNET.

[13]  Hiroyuki Ohsaki,et al.  Rate-based congestion control for ATM networks , 1995, CCRV.

[14]  Aurel A. Lazar,et al.  On the existence of equilibria in noncooperative optimal flow control , 1995, JACM.

[15]  Derya Cansever,et al.  Decentralized algorithms for flow control in networks , 1986, 1986 25th IEEE Conference on Decision and Control.

[16]  Jean-Chrysostome Bolot,et al.  End-to-end packet delay and loss behavior in the internet , 1993, SIGCOMM '93.

[17]  Larry L. Peterson,et al.  TCP Vegas: End to End Congestion Avoidance on a Global Internet , 1995, IEEE J. Sel. Areas Commun..

[18]  B. Sanders A private good/public good decomposition for optimal flow control of an M/M/1 queue , 1985 .

[19]  Ariel Orda,et al.  Achieving network optima using Stackelberg routing strategies , 1997, TNET.

[20]  Christos Douligeris,et al.  Convergence of synchronous and asynchronous algorithms in multiclass networks , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[21]  T. Basar,et al.  Optimal rate control for high speed telecommunication networks , 1995, Proceedings of 1995 34th IEEE Conference on Decision and Control.

[22]  H. Chizeck,et al.  Controllability, stabilizability, and continuous-time Markovian jump linear quadratic control , 1990 .

[23]  Aurel A. Lazar,et al.  Optimal Decentralized Flow Control of Markovian Queueing Networks with Multiple Controllers , 1991, Perform. Evaluation.

[24]  Christos Douligeris,et al.  Convergence of synchronous and asynchronous greedy algorithms in a multiclass telecommunications environment , 1992, IEEE Trans. Commun..

[25]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[26]  Van Jacobson,et al.  Congestion avoidance and control , 1988, SIGCOMM '88.

[27]  T. Başar,et al.  Dynamic Noncooperative Game Theory , 1982 .

[28]  Ariel Orda,et al.  Competitive routing in multiuser communication networks , 1993, TNET.

[29]  Raj Jain,et al.  Erica+: extensions to the erica switch algorithm , 1995 .

[30]  B. Anderson,et al.  Optimal control: linear quadratic methods , 1990 .

[31]  A. Udaya Shankar,et al.  Analysis of a fluid approximation to flow control dynamics , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.