Skip to main content
SpringerLink
Log in

Upper and lower bounds for the waiting time in the symmetric shortest queue system

  • Computational Methods
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In this paper we compare the exponential symmetric shortest queue system with two related systems: the shortest queue system with Threshold Jockeying and the shortest queue system with Threshold Blocking. The latter two systems are easier to analyse and are shown to give tight lower and upper bounds respectively for the mean waiting time in the shortest queue system. The approach also gives bounds for the distribution of the total number of jobs in the system.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. I.J.B.F. Adan, J. Wessels and W.H.M. Zijm, Analysis of the symmetric shortest queue problem, Stochastic Mod. 6 (1990) 691–713.

    Google Scholar 

  2. I.J.B.F. Adan, J. Wessels and W.H.M. Zijm, Matrix-geometric analysis of the shortest queue problem with threshold jockeying, Oper. Res. Lett. 13 (1993) 107–112.

    Article  Google Scholar 

  3. J.P.C. Blanc, The power-series algorithm applied to the shortest-queue model, Oper. Res. 40 (1992) 157–167.

    Article  MathSciNet  Google Scholar 

  4. J.W. Cohen and O.J. Boxma,Boundary Value Problems in Queueing System Analysis (North-Holland, Amsterdam, 1983).

    Google Scholar 

  5. B.W. Conolly, The autostrada queueing problem, J. Appl. Prob. 21 (1984) 394–403.

    Google Scholar 

  6. N.M. van Dijk and B.F. Lamond, Simple bounds for finite single-server exponential tandem queues, Oper. Res. 36 (1988) 470–477.

    Google Scholar 

  7. N.M. van Dijk and J. van der Wal, Simple bounds and monotonicity results for finite multi-server exponential tandem queues, Queueing Syst. 4 (1989) 1–16.

    Article  Google Scholar 

  8. G. Fayolle and R. Iasnogorodski, Two coupled processors: the reduction to a Riemann-Hilbert problem, Z. Wahrsch. Verw. Gebiete (1979) 325–351.

  9. L. Flatto and H.P. McKean, Two parallel queues with equal servicing rates, Science Report, RC5916, IBM (1977).

  10. L. Flatto and H.P. McKean, Two queues in parallel, Comm. Pure Appl. Math. 30 (1977) 255–263.

    Google Scholar 

  11. G.J. Foschini and J. Salz, A basic dynamic routing problem and diffusion, IEEE Trans. Commun. COM-26 (1978) 320–327.

    Article  Google Scholar 

  12. I. Gertsbakh, The shorter queue problem: A numerical study using the matrix-geometric solution, Eur. J. Oper. Res. 15 (1984) 374–381.

    Article  Google Scholar 

  13. W.K. Grassmann, Transient and steady state results for two parallel queues, OMEGA Int. J. Manag. Sci. 8 (1980) 105–112.

    Article  Google Scholar 

  14. W.K. Grassmann and Y. Zhao, A numerically stable algorithm for two server queue models, Queueing Syst. 8 (1991) 59–80.

    Google Scholar 

  15. F.A. Haight, Two queues in parallel, Biometrica 45 (1958) 401–410.

    Google Scholar 

  16. S. Halfin, The shortest queue problem, J. Appl. Prob. 22 (1985) 865–878.

    Google Scholar 

  17. G. Hooghiemstra, M. Keane and S. van de Ree, Power series for stationary distributions of coupled processor models, SIAM J. Appl. Math. (1988) 1159–1166.

  18. J.F.C. Kingman, Two similar queues in parallel, Ann. Math. Statist. 32 (1961) 1314–1323.

    Google Scholar 

  19. C. Knessl, B.J. Matkowsky, Z. Schuss and C. Tier, Two parallel queues with dynamic routing, IEEE Trans. Commun. COM-34 (1986) 1170–1175.

    Article  Google Scholar 

  20. J.C.S. Lui and R.R. Muntz, Algorithmic approach to bounding the mean response time of a minimum expected delay routing system, Perf. Eval. Rev. 20 (1992) 140–151.

    Google Scholar 

  21. R.D. Nelson and T.K. Philips, An approximation to the response time for shortest queue routing, Perf. Eval. Rev. 17 (1989) 181–189.

    Google Scholar 

  22. M.F. Neuts,Matrix-Geometric Solutions in Stochastic Models (Johns Hopkins University Press, Baltimore, 1981).

    Google Scholar 

  23. V. Ramaswami and G. Latouche, A general class of Markov processes with explicit matrixgeometric solutions, OR Spectrum 8 (1986) 209–218.

    Google Scholar 

  24. B.M. Rao and M.J.M. Posner, Algorithmic and approximation analysis of the shorter queue model, Naval Res. Log. 34 (1987) 381–398.

    Google Scholar 

  25. R. Schassberger, Ein Wartesystem mit zwei parallelen Warteschlängen, Computing 3 (1968) 110–124.

    Google Scholar 

  26. R. Schassberger, A service system with two parallel queues, Computing 4 (1969) 24–29.

    Google Scholar 

  27. J. van der Wal and P.J. Schweitzer, Iterative bounds on the equilibrium distribution of a finite Markov chain, Prob. Eng. Inf. Sci. 1 (1987) 117–131.

    Article  Google Scholar 

  28. J. van der Wal, Monotonicity of the throughput of a closed expoential queueing network in the number of jobs, OR Spectrum 11 (1989) 97–100.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Eindhoven University of Technology, Eindhoven, The Netherlands

    Ivo Adan, Geert-Jan van Houtum & Jan van der Wal

Authors
  1. Ivo Adan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Geert-Jan van Houtum
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jan van der Wal
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Adan, I., van Houtum, GJ. & van der Wal, J. Upper and lower bounds for the waiting time in the symmetric shortest queue system. Ann Oper Res 48, 197–217 (1994). https://doi.org/10.1007/BF02024665

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02024665

Keywords

Search

Navigation