Skip to main content Accessibility help
×
Home

On the Shortest Queue Policy for the Tandem Parallel Queue

  • Arie Hordijk (a1) and Ger Koole (a1)

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.

Copyright

References

Hide All
Abdel-Gawad, E.F. (1984). Optimal control of arrivals and routing in a network of queues. Ph.D. thesis, North Carolina State University, Raleigh.
Adan, I.J.B.F., Wessels, J., & Zijm, W.H.M. (1991). Analysis of the asymmetric shortest queue problem. Queueing Systems 8: 158.
Beutler, F.J. & Teneketzis, D. (1989). Routing in queueing networks under imperfect information: Stochastic dominance and thresholds. Stochastics and Stochastic Reports 26: 81100.
Conolly, B.W. (1984). The autostrada queueing problem. Journal of Applied Probability 21: 394403.
Davis, E. (1977). Optimal control of arrivals to a two-server queueing system with separate queues. Ph.D. thesis, North Carolina State University, Raleigh.
Ephremides, A., Varaiya, P., & Walrand, J. (1980). A simple dynamic routing problem. IEEE Transactions on Automatic Control 25: 690693.
Hajek, B. (1984). Optimal control of two interacting service stations. IEEE Transactions on Automatic Control 29: 491499.
Halfin, S. (1985). The shortest queue problem. Journal of Applied Probability 22: 865878.
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.
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.
Hordijk, A. & Koole, G. (1990). Note on the optimality of the generalized shortest queue policy. Probability in the Engineering and Informational Sciences 4: 477487.
Houck, D. J. (1987). Policies for routing customers to parallel queues. Operations Research 35: 306310.
Johri, P.K. (1989). Optimality of the shortest line discipline with state-dependent service times. European Journal of Operations Research 41: 157161.
Kulkarni, V.G. & Serin, Y. (1992). Optimal implementable policies: Discounted cost case. Operations Research (to appear).
Lehtonen, T. (1981). Stochastic comparisons for many server queues. Ph.D. thesis, Helsinki School of Economics.
Loeve, A. & Pols, M. (1990). Optimale toewijzing van klanten in wachtrijmodellen met twee bedieningscentra. Master's thesis, University of Leiden (in Dutch).
Menich, R. & Serfozo, R.F. (1991). Monotonicity and optimality of symmetric parallel processing systems. Queueing Systems 9: 403418.
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).
Walrand, J. (1988). An introduction to queueing networks. Englewood Cliffs, NJ: Prentice-Hall.
Weber, R.R. (1978). On the optimal assignment of customers to parallel queues. Journal of Applied Probability 15: 406413.
Whitt, W. (1986). Deciding which queue to Join: Some counterexamples. Operations Research 34: 5562.
Winston, W. (1977). Optimality of the shortest line discipline. Journal of Applied Probability 14: 181189.

Related content

Powered by UNSILO

On the Shortest Queue Policy for the Tandem Parallel Queue

  • Arie Hordijk (a1) and Ger Koole (a1)

Metrics

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.