Optimal control of admission to a queueing system

Congestion in a queueing system can sometimes be controlled by restricting arrivals, either by "closing a gate" or by charging an entrance fee or toll. We review both static (open-loop) and dynamic (closed-loop) models for control of admission to a queueing system. The main emphases are on the difference between socially optimal and individually optimal (equilibrium) controls and on the use of dynamic-programming inductive analysis to show that an optimal control is monotonic or characterized by one or more "critical numbers." We discuss the potential for use of these models in the analysis of computer/ communication systems and compare the results to certain others in the literature.

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

[2]  Uri Yechiali,et al.  On Optimal Balking Rules and Toll Charges in the GI/M/1 Queuing Process , 1971, Oper. Res..

[3]  U. Yechiali.  Customers' Optimal Joining Rules for the GI/M/s Queue , 1972 .

[4]  Niels Chr. Knudsen.  Individual and Social Optimization in a Multiserver Queue with a General Cost-Benefit Structure , 1972 .

[5]  Matthew J. Sobel.  Optimal Operation of Queues , 1974 .

[6]  Shaler Stidham,et al.  Optimal Control of Queueing Systems , 1974 .

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

[8]  Manfred SchÄl,et al.  Conditions for optimality in dynamic programming and for the limit of n-stage optimal policies to be optimal , 1975 .

[9]  Pramode K. Verma,et al.  Analysis of a Packet-Switched Network with End-to-End Congestion Control and Random Routing , 1977, ICCC.

[10]  Shaler Stidham,et al.  Individual versus Social Optimization in Exponential Congestion Systems , 1977, Oper. Res..

[11]  B. Doshi.  Continuous time control of the arrival process in an m/g/1 queue , 1977 .

[12]  Michael J. Magazine,et al.  A Classified Bibliography of Research on Optimal Design and Control of Queues , 1977, Oper. Res..

[13]  Donald M. Topkis,et al.  Minimizing a Submodular Function on a Lattice , 1978, Oper. Res..

[14]  Shaler Stidham,et al.  Socially and Individually Optimal Control of Arrivals to a GI/M/1 Queue , 1978 .

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

[16]  G. J. Foschini,et al.  A Basic Dynamic Routing Problem and Diffusion , 1978, IEEE Trans. Commun..

[17]  Kashi R. Balachandran,et al.  Class Dominance Characteristics at a Service Facility , 1979 .

[18]  Richard F. Serfozo,et al.  Technical Note - An Equivalence Between Continuous and Discrete Time Markov Decision Processes , 1979, Oper. Res..

[19]  M. Reiser,et al.  A Queueing Network Analysis of Computer Communication Networks with Window Flow Control , 1979, IEEE Trans. Commun..

[20]  Leonard Kleinrock,et al.  Power and deterministic rules of thumb for probabilistic problems in computer communications , 1979 .

[21]  Harry Rudin,et al.  Dynamic Routing and Flow Control , 1980, IEEE Trans. Commun..

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

[23]  S. Stidham,et al.  Control of arrivals to a stochastic input–output system , 1980, Advances in Applied Probability.

[24]  Mario Gerla,et al.  Flow Control: A Comparative Survey , 1980, IEEE Trans. Commun..

[25]  Jeffrey M. Jaffe,et al.  Flow Control Power is Nondecentralizable , 1981, IEEE Trans. Commun..

[26]  Matthew Rosenshine,et al.  Optimal control for entry of many classes of customers to an M/M/1 queue , 1981 .

[27]  Shaler Stidham,et al.  On the convergence of successive approximations in dynamic programming with non-zero terminal reward , 1981, Z. Oper. Research.

[28]  R. Serfozo.  Optimal control of random walks, birth and death processes, and queues , 1981, Advances in Applied Probability.

[29]  K. Bharath-Kumar,et al.  A new approach to performance-oriented flow control , 1981, IEEE Trans. Commun..

[30]  Tak-Shing Peter Yum,et al.  The Join-Biased-Queue Rule and Its Application to Routing in Computer Communication Networks , 1981, IEEE Trans. Commun..

[31]  Jeffrey M. Jaffe,et al.  Bottleneck Flow Control , 1981, IEEE Trans. Commun..

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

[33]  A. Segall,et al.  An optimal control approach to dynamic routing in networks , 1982 .

[34]  U. Ozguner,et al.  On decentralized dynamic routing for congested traffic networks , 1982 .

[35]  D. Bertsekas,et al.  Projected Newton methods and optimization of multicommodity flows , 1982, 1982 21st IEEE Conference on Decision and Control.

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

[37]  S. Stidham,et al.  Individual versus Social Optimization in the Allocation of Customers to Alternative Servers , 1983 .

[38]  Martin L. Puterman,et al.  Computing Optimal Control Limits for GI/M/S Queuing Systems with Controlled Arrivals , 1983 .

[39]  P. R. Kumar,et al.  Optimal control of a queueing system with two heterogeneous servers , 1984 .

[40]  K. Waldmann,et al.  Optimal control of arrivals to multiserver queues in a random environment , 1984 .

[41]  Bruce E. Hajek,et al.  Extremal Splittings of Point Processes , 1985, Math. Oper. Res..

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