Hostname: page-component-74656f9884-c52kr Total loading time: 0 Render date: 2026-11-09T10:12:25.830Z Has data issue: false hasContentIssue false
  • English
  • Français

On the Shortest Queue Policy for the Tandem Parallel Queue

Published online by Cambridge University Press:  27 July 2009

Arie Hordijk  and
Ger Koole
Arie Hordijk
Affiliation:
Department of Mathematics and Computer Science University of Leiden, postbus 9512 2300 RA Leiden, The Netherlands
Ger Koole
Affiliation:
Department of Mathematics and Computer Science University of Leiden, postbus 9512 2300 RA Leiden, The Netherlands
Get access Rights & Permissions [Opens in a new window]

Abstract

We consider two nodes in tandem. At each node or service center, there are two exponential servers present with the same service rate μ and each with its own queue. Customers arrive at the first node according to a Poisson process with arrival rate λ. At their arrival, they have to be assigned to one of the servers, so they are routed to one of the queues at node 1. Customers leaving center 1 enter node 2 and are routed to one of the queues at node 2. In this paper, we consider the case with full information and the case with partial information.

Information

Type
Articles
Information
Probability in the Engineering and Informational Sciences , Volume 6 , Issue 1 , January 1992 , pp. 63 - 79
Copyright
Copyright © Cambridge University Press 1992

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Abdel-Gawad, E.F. (1984). Optimal control of arrivals and routing in a network of queues. Ph.D. thesis, North Carolina State University, Raleigh.Google Scholar
Adan, I.J.B.F., Wessels, J., & Zijm, W.H.M. (1991). Analysis of the asymmetric shortest queue problem. Queueing Systems 8: 1–58.CrossRefGoogle Scholar
Beutler, F.J. & Teneketzis, D. (1989). Routing in queueing networks under imperfect information: Stochastic dominance and thresholds. Stochastics and Stochastic Reports 26: 81–100.CrossRefGoogle Scholar
Conolly, B.W. (1984). The autostrada queueing problem. Journal of Applied Probability 21: 394–403.CrossRefGoogle Scholar
Davis, E. (1977). Optimal control of arrivals to a two-server queueing system with separate queues. Ph.D. thesis, North Carolina State University, Raleigh.Google Scholar
Ephremides, A., Varaiya, P., & Walrand, J. (1980). A simple dynamic routing problem. IEEE Transactions on Automatic Control 25: 690–693.CrossRefGoogle Scholar
Hajek, B. (1984). Optimal control of two interacting service stations. IEEE Transactions on Automatic Control 29: 491–499.CrossRefGoogle Scholar
Halfin, S. (1985). The shortest queue problem. Journal of Applied Probability 22: 865–878.CrossRefGoogle Scholar
Hariharan, R., Kulkarni, V.G., & Stidham, S. (1990). A survey of research relevant to virtual-circuit routing in telecommunication networks. Technical Report UNC/OR/TR 90−13, University of North Carolina at Chapel Hill.Google Scholar
Hariharan, R., Kulkarni, V.G., & Stidham, S. (1990). Optimal control of admission and routing to two parallel infinite-server queues. Proceedings of the 29th IEEE Conference on Decision and Control.CrossRefGoogle Scholar
Hordijk, A. & Koole, G. (1990). Note on the optimality of the generalized shortest queue policy. Probability in the Engineering and Informational Sciences 4: 477–487.CrossRefGoogle Scholar
Houck, D. J. (1987). Policies for routing customers to parallel queues. Operations Research 35: 306–310.CrossRefGoogle Scholar
Johri, P.K. (1989). Optimality of the shortest line discipline with state-dependent service times. European Journal of Operations Research 41: 157–161.CrossRefGoogle Scholar
Kulkarni, V.G. & Serin, Y. (1992). Optimal implementable policies: Discounted cost case. Operations Research (to appear).Google Scholar
Lehtonen, T. (1981). Stochastic comparisons for many server queues. Ph.D. thesis, Helsinki School of Economics.Google Scholar
Loeve, A. & Pols, M. (1990). Optimale toewijzing van klanten in wachtrijmodellen met twee bedieningscentra. Master's thesis, University of Leiden (in Dutch).Google Scholar
Menich, R. & Serfozo, R.F. (1991). Monotonicity and optimality of symmetric parallel processing systems. Queueing Systems 9: 403–418.CrossRefGoogle Scholar
Towsley, D., Sparaggis, P.D., & Cassandras, C.G. (1992). Optimal routing and buffer allocation for a class of finite capacity queueing systems. IEEE Transactions on Automatic Control (to appear).CrossRefGoogle Scholar
Walrand, J. (1988). An introduction to queueing networks. Englewood Cliffs, NJ: Prentice-Hall.Google Scholar
Weber, R.R. (1978). On the optimal assignment of customers to parallel queues. Journal of Applied Probability 15: 406–413.CrossRefGoogle Scholar
Whitt, W. (1986). Deciding which queue to Join: Some counterexamples. Operations Research 34: 55–62.CrossRefGoogle Scholar
Winston, W. (1977). Optimality of the shortest line discipline. Journal of Applied Probability 14: 181–189.CrossRefGoogle Scholar