Skip to main content Accessibility help

Customer routing to different servers with complete information

  • Zvi Rosberg (a1) and Parviz Kermani (a2)


In this paper we consider a queueing system having n exponential servers, each with its own queue and service rate. Customers arrive according to a Poisson process with rate λ, and upon arrival each customer must be routed to some server's queue. No jockeying amongst the queues is allowed and each server serves its queue according to a first-come-first-served discipline.

Each server i, 1 ≦ in, provides service with a state-dependent rate μ (i)(k), k = 0, 1, …. In addition, at every queue i, there is a deterministic holding cost which occurs at rate h (i)(k) while there are k customers at the queue.

An admissible routing policy is a policy that assigns each arriving customer to one of the queues. A decision at time t may be randomized and dependent on the queue lengths and decisions till time t . An optimal routing policy is an admissible policy that minimizes the long-run average holding cost.

In this study, we bound the optimal cost from below, by considering an ideal system, where each server optimally selects a given proportion of customers, irrespective of other servers' selections. From this ideal system we construct a class of admissible routing policies, the overflow routing class, that approximates the ideal situation for each server. Finally, we evaluate the policies and compare them to the lower bound.


Corresponding author

Postal address: Dept. of Computer Science, Technion—IIT, Haifa 32000, Israel. Research was done while this author was with IBM T. J. Watson Research center.
∗∗ Postal address: IBM T. J. Watson Research Center, P.O. Box 704, Yorktown Heights, NY 10598, USA.


Hide All
[1] Beutler, F. J. and Ross, K. W. (1986) Time-average optimal constrained semi-Markov decision processes. Adv. Appl. Prob. 18, 341359.
[2] Bovopoulos, A. D. and Lazar, A. A. (1985) Optimal Routing and Flow Control of a Network of Parallel Processors, Technical Report, Columbia University.
[3] Chandy, K. M., Herzog, U. and Woo, L. (1975) Parametric analysis of queueing networks. IBM J. Res. Develop. 19, 3642.
[4] Denardo, E. V. (1982) Dynamic Programming: Models and Applications. Prentice-Hall, Englewood Cliffs, N.J.
[5] Ephremides, A., Varaiya, P. and Walrand, J. (1980) A simple dynamic routing problem. IEEE Trans. Autom. Control 25, 690693.
[6] Gelenbe, E. and Mitrani, I. (1980) Analysis and Synthesis of Computer Systems. Academic Press, New York.
[7] Hajek, B. (1985) External splitting of point processes. Math. Operat. Res. 10, 543556.
[8] Hajek, B. (1984) Optimal control of two interacting service stations. IEEE Trans. Autom. Control 29, 491499.
[9] Krishnan, K. R. (1987) Joining the right queue: A Markov decision rule. Proc. 26th CDC, 18631868.
[10] Lippman, S. A. (1973) Semi-Markov decision processes with unbounded rewards. Management Sci. 29, 717731.
[11] Neuts, M. F. (1981) Matrix-Geometric Solutions in Stochastic Models. John Hopkins University Press, Baltimore, MD.
[12] Neuts, M. F. and Kumar, S. (1982) Algorithmic solution of some queues with overflows. Management Sci. 28, 925935.
[13] Rosberg, Z. (1986) Deterministic routing to buffered channels. IEEE Trans. Comm. 34, 604–507.
[14] Rosberg, Z. (1981) A note on the ergodicity of Markov chains. J. Appl. Prob. 18, 112121.
[15] Rosberg, Z. and Kermani, P. (1988) Customer routing to different servers with complete information. Technical Report, RC 13765, IBM T. J. Watson Res. Ctr.
[16] Rosberg, Z. and Towsley, D. (1985) Customer routing to parallel servers with different rates. IEEE Trans. Autom. Control 30, 11401143.
[17] Schal, M. (1975) Condition for optimality in dynamic programming and for the limit of n-stage optimal policies to be optimal. Z Warscheinlichkeitsth. 32, 179196.
[18] Schwartz, M. (1981) Routing and flow control in data networks. In New Concepts in Multi-user Communications, ed. Skwirzynski, J. K., NATO Advanced Study Institute, Series E: Applied Science 43.
[19] Weber, R. R. (1978) On the optimal assignment of customers to parallel servers. J. Appl. Prob. 15, 406413.
[20] Whitt, W. (1986) Deciding which queue to join: some counterexamples. Operat. Res. 34, 5562.
[21] Winston, W. L. (1977) Optimality of the shortest line discipline. J. Appl. Prob. 14, 181189.


Related content

Powered by UNSILO

Customer routing to different servers with complete information

  • Zvi Rosberg (a1) and Parviz Kermani (a2)


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.