Skip to main content
SpringerLink
Log in

Vacation models in discrete time

  • Published:
Queueing Systems Aims and scope Submit manuscript

An Erratum to this article was published on 01 December 2003

Abstract

A class of single server vacation queues which have single arrivals and non-batch service is considered in discrete time. It is shown that provided the interarrival, service, vacation, and server operational times can be cast with Markov-based representation then this class of vacation model can be studied as a matrix–geometric or a matrix-product problem – both in the matrix–analytic family – thereby allowing us to use well established results from Neuts (1981). Most importantly it is shown that using discrete time approach to study some vacation models is more appropriate and makes the models much more algorithmically tractable. An example is a vacation model in which the server visits the queue for a limited duration. The paper focuses mainly on single arrival and single unit service systems which result in quasi-birth-and-death processes. The results presented in this paper are applicable to all this class of vacation queues provided the interarrival, service, vacation, and operational times can be represented by a finite state Markov chain.

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. A.S. Alfa, A discrete MAP / PH / 1 queue with vacations and exhaustive time-limited service, Oper. Res. Lett. 18 (1995) 31–40.

    Google Scholar 

  2. A.S. Alfa, A discrete MAP / PH / 1 vacation queue with gated time-limited service, Queueing Systems, 29 (1998) 35–54.

    Google Scholar 

  3. A.S. Alfa, Discrete time vacation models and matrix–analytic method, Internal Report, University of Windsor (June, 2001).

  4. A.S. Alfa and W. Li, Matrix–geometric solution of the discrete time GI / G / 1 system, Stochastic Models 17(4) (2001) 541–554.

    Google Scholar 

  5. J.R. Artalejo, Analysis of an M / G / 1 queue with constant repeated attempts and server vacations, Comput. Oper. Res. 24(6) (1997) 493–504.

    Google Scholar 

  6. B. Avi-Itzhak and P. Naor, Some queueing problems with the service station subject to server breakdowns, Oper. Res. 10 (1962) 303–320.

    Google Scholar 

  7. C. Blondia, Finite capacity vacation models with non-renewal input, J. Appl. Probab. 28 (1991) 174–197.

    Google Scholar 

  8. L. Bright and P.G. Taylor, Calculating the equilibrium distribution in level dependent quasi-birth-anddeath processes, Stochastic Models 11(3) (1995) 497–525.

    Google Scholar 

  9. H. Bruneel, Analysis of discrete-time buffer with single server output, subject to interruption process, in: '84 (Elsevier, Amsterdam, 1984) pp. 103–115.

    Google Scholar 

  10. H. Bruneel, Analysis of an infinite buffer system with random server interruption, Comput. Oper. Res. 11 (1994) 373–386.

    Google Scholar 

  11. X. Chao and Y.Q. Zhao, Analysis of multi-server queues with station and server vacation, European J. Oper. Res. 110(2) (1998) 392–406.

    Google Scholar 

  12. B.D. Choi, Single server retrial queues with priority calls, Math. Computer Modelling 30(3/4) (1999) 7–32.

    Google Scholar 

  13. S.C. Dafermos and M.F. Neuts, A single server queue in discrete time, Cahiers C.E.R.O. 13 (1971) 23–40.

    Google Scholar 

  14. B.T. Doshi, A note on stochastic decomposition in a GI / G / 1 queue with vacations or set-up times, J. Appl. Probab. 22 (1985) 419.

    Google Scholar 

  15. B.T. Doshi, Queueing systems with vacations – a survey, Queueing Systems 1 (1986) 29–66.

    Google Scholar 

  16. B.T. Doshi, Generalization of the stochastic decopmosition results for the single-server queues with vacations, Stochastic Models 6 (1990) 307–333.

    Google Scholar 

  17. B.T. Doshi, Single server queues with vacations, in: Stochastic Analysis of Computer and Communications Systems, ed. H. Takagi (1990) pp. 217–265.

  18. M. Eisenberg and K.K. Leung, A single-server queue with vacations and non-gated time-limited service, Performance Evaluation 12 (1991) 115–125.

    Google Scholar 

  19. A. Federgruen and L. Green, Queueing systems with service interruptions, Oper. Res. 34(5) (1986) 752–768.

    Google Scholar 

  20. A. Federgruen and L. Green, Queueing systems with service interruptions II, Naval Res. Logistics 35 (1988) 345–358.

    Google Scholar 

  21. J.M. Ferrandiz, The BMAP / GI / 1 queue with server set-up times and server vacations, Adv. in Appl. Probab. 25 (1993) 235–254.

    Google Scholar 

  22. S.W. Fuhrman and R.B. Cooper, Stochastic decomposition in the M / G / 1 queue with generalized vacations, Oper. Res. 33 (1985) 1117–1129.

    Google Scholar 

  23. D.P. Gaver, Jr., A waiting line with interrupted service including priorities, J. Roy. Statist. Soc. B 24 (1962) 73–90.

    Google Scholar 

  24. C.M. Harris and W.G. Marchal, State dependence in M / G / 1 server vacation models, Oper. Res. 36 (1988) 560–565.

    Google Scholar 

  25. F. Ishizaki, T. Takine and T. Hasegawa, Analysis of a discrete-time queue with gated priority, Performance Evaluation 23 (1995) 121–143.

    Google Scholar 

  26. F. Ishizaki, T. Takine, Y. Takahashi and T. Hasegawa, A generalized SBBP / G / 1 queue and its applications, Performance Evaluation 21 (1994) 163–181.

    Google Scholar 

  27. J. Keilson, Queues subject to service interuptions, Ann. Math. Statist. 33 (1962) 1314–1322.

    Google Scholar 

  28. J. Keilson and L.D. Servi, Oscillating random walk models for GI / G/ 1 vacation systems with Bernoulli schedules, J. Appl. Probab. 23 (1986) 790–802.

    Google Scholar 

  29. B.K. Kumar and D. Arivudainambi, The M / G / 1 retrial queue with Bernoulli schedules and general retrial times, Comput. Math. Appl. 43(1/2) (2002) 15–30.

    Google Scholar 

  30. G. Latouche and V. Ramaswami, Introduction to Matrix Analytic Methods in Stochastic Modeling, ASA–SIAM Series on Applied Probability (1999).

  31. H.W. Lee, B.Y. Ahn and N.I. Park, Decompositions of the queue length distributions in the MAP / G / 1 queue under multiple and single vacations with N-policy, Stochastic Models 17(2) (2001) 157–190.

    Google Scholar 

  32. H.W. Lee, S.S. Lee, J.O. Park and K.C. Chae, Analysis of the Mx / G / 1 queue with N-policy and multiple vacations, J. Appl. Probab. 31 (1994) 476–496.

    Google Scholar 

  33. T.T. Lee, M / G / 1 / N queue with vacation time and limited service discipline, Performance Evaluation 9 (1989) 181–190.

    Google Scholar 

  34. K.K. Leung and M. Eisenberg, A single-server queue with vacations and gated time-limited service, IEEE Trans. Commun. 38(9) (1990) 1454–1462.

    Google Scholar 

  35. Y. Levy and U. Yechiali, Utilization of the idle time in an M / G / 1 queue, Managm. Sci. 22 (1975) 202–211.

    Google Scholar 

  36. Y. Levy and U. Yechiali, M/M/s queues with server vacations, INFOR 14 (1976) 153–163.

    Google Scholar 

  37. H. Li and T. Yang, A single-server retrial queue with server vacation and a finite number of input sources, European J. Oper. Res. 85(1) (1995) 149–160.

    Google Scholar 

  38. H. Li and Y. Zhu, M ( n ) / G / 1 / N queues with generalized vacations, Comput. Oper. Res. 24(4) (1997) 301–316.

    Google Scholar 

  39. D.M. Lucantoni, New results on the single server queue with a batch Markovian arrival process, Stochastic Models 7 (1991) 1–46.

    Google Scholar 

  40. D.M. Lucantoni, K.S. Meier-Hellstern and M.F. Neuts, A single-server queue with server vacations and a class of non-renewal arrival processes, Adv. in Appl. Probab. 22 (1990) 676–705.

    Google Scholar 

  41. S.K. Matendo, A single-server queue with server vacations and a batch Markovian arrival process, Cahiers C.E.R.O. 35 (1993) 87–114.

    Google Scholar 

  42. I.L. Mitrani and B. Avi-Itzhak, A many server queue with service interruptions, Oper. Res. 16 (1968) 628–638.

    Google Scholar 

  43. M. Miyazawa, Decomposition formulas for sngle-server queues with vacations: A unified approach by rate conservation law, Stochastic Models 10 (1994) 389–413.

    Google Scholar 

  44. M.F. Neuts, A versatile Markovian point process, J. Appl. Probab. 16 (1979) 764–779.

    Google Scholar 

  45. M.F. Neuts, Matrix–Geometric Solutions in Stochastic Models – An Algorithmic Approach (Johns Hopkins Univ. Press, Baltimore, MD, 1981).

    Google Scholar 

  46. M.F. Neuts, Structured Stochastic Matrices of the M / G / 1 Type and their Applications (Marcel Dekker, New York, 1989).

    Google Scholar 

  47. M.F. Neuts, Some promising directions in algorithmic probability, in: Advances in Matrix Analytic Methods for Stochastic Models, eds. A.S. Alfa and S. Chakravarthy (Notable Publications, NJ, 1998) pp. 429–443.

    Google Scholar 

  48. V. Ramaswami and P.G. Taylor, Some properties of the rate operators in level dependent quasi-birthand-death processes with a countable number of phases, Stochastic Models 12(1) (1996) 143–164.

    Google Scholar 

  49. H. Schellhaas, Single server queues with a batch Markovian arrival process and server vacations, OR Spektrum 15 (1994) 189–196.

    Google Scholar 

  50. B. Sengupta, A queue with service interruption in an alternating random environment, Oper. Res. 38 (1990) 308–318.

    Google Scholar 

  51. D. Shi, J. Guo and L. Liu, SPH-distributions and the rectangle-iterative algorithm, in: Matrix–Analytic Methods in Stochastic Models, eds. S. Chakravarthy and A.S. Alfa (Marcel Dekker, New York, 1996) pp. 207–224.

    Google Scholar 

  52. D. Shi and D. Liu, Markovian models for non-negative random variables, in: Advances in Matrix Analytic Methods for Stochastic Models, eds. A.S. Alfa and S. Chakravarthy (Notable Publications, NJ, 1998) pp. 403–427.

    Google Scholar 

  53. M. Shomrony and U. Yechiali, Burst arrival queues with server vacations and random timers, Math. Methods Oper. Res. 53 (2001) 117–146.

    Google Scholar 

  54. H. Takagi, Queueing Analysis: A Foundation of Performance Evaluation, Vol. 1: Vacation and Priority Systems, Part 1 (North-Holland, Amsterdam, 1991).

  55. H. Takagi, Time-dependent process of M / G / 1 vacation models with exhaustive service, J. Appl. Probab. 29 (1992) 418–429.

    Google Scholar 

  56. T. Takine and T. Hasegawa, A batch SPP / G / 1 queue with multiple vacations and exhaustive service disicpline, Telecommunication Systems 1 (1993) 195–215.

    Google Scholar 

  57. T. Takine and B. Sengupta, A single server queue with service interruptions, Queueing Systems 26 (1997) 285–300.

    Google Scholar 

  58. N. Tian and Z.G. Zhang, A discrete-time GI / Geo / 1 queue with multiple vacations, Queueing Systems 40(3) (2002) 283–294.

    Google Scholar 

  59. R.L. Tweedie, Operator-geometric stationary distributions for Markov chains, with aplications to queueing models, Adv. in Appl. Probab. 14(2) (1982) 368–391.

    Google Scholar 

  60. H.C. White and L.S. Christie, Queueing with preemptive priorities or with breakdown, Oper. Res. 6 (1958) 79–95.

    Google Scholar 

  61. Z.G. Zhang, R.G. Vickson and M.J.A. van Eenige, Optimal two-threshold policies in an M / G / 1 queue with two vacation types, Performance Evaluation 29(1) (1997) 63–80.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, University of Manitoba, Winnipeg, MB, Canada, R3T 5V6

    Attahiru Sule Alfa

Authors
  1. Attahiru Sule Alfa
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

An erratum to this article can be found at http://dx.doi.org/10.1023/B:QUES.0000018028.16682.ef

Rights and permissions

Reprints and permissions

About this article

Cite this article

Alfa, A.S. Vacation models in discrete time. Queueing Systems 44, 5–30 (2003). https://doi.org/10.1023/A:1024028722553

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1024028722553

Search

Navigation