Skip to main content Accessibility help

On the Optimality of Trunk Reservation in Overflow Processes

  • Viên Nguyen (a1)


This paper discusses an optimal dynamic policy for a queueing system with M servers, no waiting room, and two types of customers. Customer types differ with respect to the reward that is paid on commencement of service, but service times are exponentially distributed with the same mean for both types of customers. The arrival stream of one customer type is generated by a Poisson process, and the other customer type arrives according to the overflow process of an M/M/m/m queue. The objective is to determine a policy for admitting customers to maximize the expected long-run average reward.

By posing the problem in the framework of Markov decision processes and exploiting properties of submodular functions, the optimal policy is shown to be a “generalized trunk reservation policy”; in other words, the optimal policy accepts higher-paying customers whenever possible and accepts lower-paying customers only if fewer than c1 servers are busy, where i is the number of busy servers in the overflow queue. Computational issues are also discussed. More specifically, approximations of the overflow process by an interrupted Poisson process and a Poisson process are investigated.



Hide All
Derman, C. (1970). Finite state Markovian decision. New York: Academic Press.
Foschini, G. & Gopinath, B. (1981). Optimum allocation of servers to two types of competing customers. IEEE Transactions on Communication 29: 10511055.
Howard, R. (1960). Dynamic programming and Markov processes. New York: Wiley.
Kuczura, , Anatol., (1973). The interrupted Poisson process as an overflow process. Bell System Technical Journal 52: 437448.
Lippman, S. (1975). Applying a new device in the optimization of exponential queueing systems. Operations Research 23: 687710.
Odoni, A. (1969). On finding the maximal gain for Markov decision processes. Operations Research 17: 857860.
Ott, T. & Krishnan, K. (1985). State dependent routing of telephone traffic and the use of separable routing schemes. Proceedings of the 11th International Teletraffic Congress, Kyoto, Japan.
Ross, S. (1983). Introduction to stochastic dynamical programming. New York: Academic Press.
Schweitzer, P. (1971). Iterative solution of the functional equation of undiscounted Markov renewal programming. Journal of Mathematical Analysis and Applications 34: 495501.
Serfozo, R. (1981). Optimal control of random walks, birth and death processes, and queues. Advances in Applied Probability 13: 6183.
Stidham, S. Jr, (1985). Optimal control of admission to a queueing system. IEEE Transactions on Automated Control AC-30: 705713.
Tijms, H. (1986). Stochastic modelling and analysis: A computational approach. New York: Wiley.
Tijms, H. & Eikenboom, A. (1986). A simple technique in Markovian control with applications to resource allocation in communication networks. Operations Research Letters 5: 2532.
Van Nunen, J. & Puterman, M. (1983). Computing optimal control limits for G1/M/S queueing systems with controlled arrivals. Management Science 29: 725734.
White, D.J. (1963). Dynamic programming, Markov chains, and the method of successive approximations. Journal of Mathematical Analysis and Applications 6: 373376.

Related content

Powered by UNSILO

On the Optimality of Trunk Reservation in Overflow Processes

  • Viên Nguyen (a1)


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.