Optimal QoS control of interacting service stations

We consider a system of three queues and two types of packets. Each packet arriving at this system finds in front of it a controller who either sends it in the first queue or rejects it according to a QoS criterion. When the packet finishes its service in the first queue, it is probabilistically routed to one of two other parallel queues. The objective is to minimize a QoS discounted cost over an infinite horizon. The cost function is composed of a waiting cost per packet in each queue and a rejection cost in the first queue. Subsequently, we generalize this problem by considering a system of (m+1) queues and n types of packets. We show that an optimal policy is monotonic.

[1]  Robert T. Braden,et al.  Requirements for Internet Hosts - Communication Layers , 1989, RFC.

[2]  Anthony Ephremides,et al.  A simple dynamic routing problem , 1980 .

[3]  Zvi Rosberg,et al.  Optimal control of service in tandem queues , 1982 .

[4]  J. Ben Atkinson,et al.  An Introduction to Queueing Networks , 1988 .

[5]  I. Lambadaris,et al.  Optimal control of arrivals to a feedback queueing system , 1988, Proceedings of the 27th IEEE Conference on Decision and Control.

[6]  Anthony Ephremides,et al.  Optimal switching of voice and data at a network node , 1987, 26th IEEE Conference on Decision and Control.

[7]  Jr. Shaler Stidham.  Optimal control of admission to a queueing system , 1985 .

[8]  Jean C. Walrand,et al.  An introduction to queueing networks , 1989, Prentice Hall International editions.

[9]  Shaler Stidham,et al.  Control of arrivals to two queues in series , 1985 .

[10]  Pravin Varaiya,et al.  Lecture Notes on Optimization , 1972 .

[11]  I. Lambadaris,et al.  Jointly Optimal Admission and Routing Controls at a Network Node , 1994 .

[12]  V. Jacobson,et al.  Congestion avoidance and control , 1988, CCRV.

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

[14]  Steven A. Lippman,et al.  Applying a New Device in the Optimization of Exponential Queuing Systems , 1975, Oper. Res..

[15]  B. Hajek.  Optimal control of two interacting service stations , 1982, 1982 21st IEEE Conference on Decision and Control.

[16]  Abdelkrim Haqiq,et al.  Contrôle dynamique de flux dans un système d'attente avec panne , 1999, RAIRO Oper. Res..

[17]  S. Lippman.  On Dynamic Programming with Unbounded Rewards , 1975 .

[18]  R. Weber.  On the optimal assignment of customers to parallel servers , 1978, Journal of Applied Probability.

[19]  Aurel A. Lazar,et al.  Optimal flow control of a class of queueing networks in equilibrium , 1983 .

[20]  I. Lambadaris,et al.  Optimal service allocation among two heterogeneous traffic types with no queueing , 1987, 26th IEEE Conference on Decision and Control.

[21]  W. Richard Stevens,et al.  TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms , 1997, RFC.

[22]  Wayne L. Winston.  OPTIMALITY OF THE SHORTEST LINE DISCIPLINE , 1977 .