On the Role of Queue Length Information in Network Control

We study the role played by queue length information in the operation of flow control and server allocation policies. We first consider a simple model of a single server queue with congestion-based flow control. The input rate at any instant is decided by a flow control policy, based on the queue occupancy. We identify a simple “two-threshold” control policy, which achieves the best possible exponential scaling for the queue congestion probability, for any rate of control. We show that when the control channel is reliable, the control rate needed to ensure the optimal decay exponent for the congestion probability can be made arbitrarily small. However, if control channel erasures occur probabilistically, we show the existence of a critical erasure probability threshold beyond which the congestion probability undergoes a drastic increase due to the frequent loss of control packets. We also determine the optimal amount of error protection to apply to the control signals by using a simple bandwidth sharing model. Finally, we show that the queue length based server allocation problem can also be treated using this framework and that the results obtained for the flow control setting can also be applied to the server allocation case.

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

[2]  Robert G. Gallager,et al.  Basic limits on protocol information in data communication networks , 1976, IEEE Trans. Inf. Theory.

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

[4]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[5]  John N. Tsitsiklis,et al.  Asymptotic buffer overflow probabilities in multiclass multiplexers: an optimal control approach , 1998, IEEE Trans. Autom. Control..

[6]  Lizhong Zheng,et al.  Effective resource allocation in a queue: How much control is necessary? , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[7]  Rayadurgam Srikant,et al.  The role of queue length information in congestion control and resource pricing , 1999, Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304).

[8]  Eytan Modiano,et al.  On the Trade-Off Between Control Rate and Congestion in Single Server Systems , 2009, IEEE INFOCOM 2009.

[9]  R. Srikant,et al.  On the Connection-Level Stability of Congestion-Controlled Communication Networks , 2008, IEEE Transactions on Information Theory.

[10]  Leandros Tassiulas,et al.  Dynamic server allocation to parallel queues with randomly varying connectivity , 1993, IEEE Trans. Inf. Theory.

[11]  ModianoEytan,et al.  Fairness and optimal stochastic control for heterogeneous networks , 2008 .

[12]  Robert G. Gallager,et al.  Discrete Stochastic Processes , 1995 .

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

[14]  M.J. Neely,et al.  Order Optimal Delay for Opportunistic Scheduling in Multi-User Wireless Uplinks and Downlinks , 2008, IEEE/ACM Transactions on Networking.

[15]  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.