Skip to main content
SpringerLink
Log in

A Survey for Stochastic Decomposition in Vacation Queues

  • Chapter
  • First Online:
Stochastic Models in Reliability, Network Security and System Safety (JHC80 2019)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1102))

Abstract

The study of vacation queue started in the 1970s. Up to now, it has made abundant achievements, formed a theoretical framework with stochastic decomposition as the core, and has been applied to many fields. This paper gives a comprehensive overview of the research results and analysis methods of vacation queue, including its applications in the communication networks.

The essence of vacation queue is that the service may be interrupted. As early as 1982, Jinhua Cao and Kan Cheng studied a kind of repairable queueing system, which was the earliest work involving vacation queue at home. From then on, a group of domestic scholars began to engage in the study of vacation queue, and achieved a series of important achievements, which are also described in this paper.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Erlang, A.K.: Solution of some problems in the theory of probabilities of significance in automatic telephone exchanges. Post Off. Electr. Eng. J. 10, 189–197 (1917)

    Google Scholar 

  2. Saaty, T.L.: Elements of Queue Theory. McGraw Hill, New York (1961)

    MATH  Google Scholar 

  3. Takacs, L.: Introduction to the Theory of Queues. Oxford University Press, New York (1962)

    MATH  Google Scholar 

  4. Kleinrock, L.: Queueing Systems, vol. 1–2. Wiley, New York (1975)

    MATH  Google Scholar 

  5. Gross, D., Harris, C.M.: Fundamentals of Queueing Theory. Wiley, New York (1985)

    MATH  Google Scholar 

  6. Hsu, G.H.: Stochastic Service System. Science Press, Beijing (1980)

    Google Scholar 

  7. Levy, Y., Yechiali, U.: Utilization of idle time in an M/G/1 queueing system. Manag. Sci. 22, 202–211 (1975)

    Article  MATH  Google Scholar 

  8. Doshi, B.T.: Queueing systems with vacation-a survey. Queueing Syst. 1, 29–66 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  9. Teghem, J.: Control of the service process in queueing system. Eur. J. Oper. Res. 23, 141–158 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  10. Tian, N., Zhang, D., Cao, C.: The GI/M/1 queue with exponential vacations. Queueing Syst. 5, 331–344 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  11. Chatterjee, U., Mukherjee, S.: GI/M/1 queue with server vacation. J. Oper. Res. Soc. 41, 83–87 (1990)

    Article  MATH  Google Scholar 

  12. Doshi, B.: A note on stochastic decomposition in a GI/G/1 queue with vacation times or set-up times. J. Appl. Probab. 22, 419–428 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  13. Levy, Y., Yechiali, U.: An M/M/s queue with servers’ vacations. INFOR 14, 153–163 (1976)

    MathSciNet  MATH  Google Scholar 

  14. Igaki, N.: Exponential two server queue with N-policy and multiple vacations. Queueing Syst. 10, 279–294 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  15. Tian, N., Zhang, Z.: The steady theory for GI/M/c queue with synchronous vacations. OR Trans. 5(1), 70–80 (2001). (in Chinese)

    MathSciNet  Google Scholar 

  16. Tian, N., Gao, Z., Zhang, Z.: The equilibrium theory for queueing system M/M/c queue with asynchronous vacations. Acta Mathematicae Applicatae Sinica 24(2), 185–194 (2001). (in Chinese)

    MathSciNet  MATH  Google Scholar 

  17. Tian, N.: The M/M/c queue with synchronous times of phase type set-up. Acta Mathematicae Applicatae Sinica 20(2), 275–281 (1997). (in Chinese)

    MathSciNet  MATH  Google Scholar 

  18. Tian, N., Hou, Y.: The PH structure in queueing systems M/M/c with synchronous vacations. Mathematica Applicata 1, 5–8 (1998). (in Chinese)

    MATH  Google Scholar 

  19. Tian, N., Li, Q.: The M/M/c queue with phase type synchronous vacations. J. Syst. Sci. Math. Sci. 63(1), 7–16 (2000)

    MathSciNet  MATH  Google Scholar 

  20. Xu, X., Zhang, Z.G.: The analysis of multi-server queue with single vacation and an \((e, d)\) policy. Perform. Eval. 63(8), 825–838 (2006)

    Article  Google Scholar 

  21. Tian, N., Zhang, Z.G.: A two threshold vacation policy in multi-server queueing systems. Eur. J. Oper. Res. 168, 153–163 (2006)

    Article  MATH  Google Scholar 

  22. Zhang, Z.G., Tian, N.: Analysis on queueing systems with synchronous vacation of partial servers. Perform. Eval. 52, 282–296 (2003)

    Google Scholar 

  23. Zhang, Z.G., Tian, N.: Analysis of queueing systems with synchronous single vacation for some servers. Queueing Syst. 45, 161–175 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  24. Chao, X., Zhao, Y.: Analysis of multi-server queue with station and server vacation. Eur. J. Oper. Res. 110, 392–406 (1998)

    Article  MATH  Google Scholar 

  25. Tian, N., Zhang, Z.G.: Stationary distributions of GI/M/c queue with PH type vacations. Queueing Syst. 49, 341–351 (2003)

    MathSciNet  MATH  Google Scholar 

  26. Tian, N., Li, Q., Cao, J.: Conditional stochastic decomposition in M/M/c queue with server vacation. Stoch. Models 14, 367–377 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  27. Doshi, B.: Conditional and unconditional distribution for M/G/1 type queues with server vacations. Queueing Syst. 7, 229–252 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  28. Bose, S.K.: An Introduction to Queueing Systems. Kluwer Academic, Dordrecht (2001)

    Google Scholar 

  29. Takagi, H.: Queueing Analysis, a Foundation of Performance Evaluation, vol. 1–2. North-Holland, Amsterdam (1993)

    Google Scholar 

  30. Dshalalow, J.: Frontiers in Queueing. CRC Press, New York (1997)

    MATH  Google Scholar 

  31. Tian, N., Zhang, Z.G.: Vacation Queueing Models-Theory and Applications. International Series in Operations Research & Management Science, vol. 93. Springer, New York (2006). https://doi.org/10.1007/978-0-387-33723-4

    Book  MATH  Google Scholar 

  32. Fuhrmann, S.: A note on the M/G/1 queue with server vacations. Oper. Res. 32, 1368–1373 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  33. Doshi, B.: An M/G/1 queue with variable vacations. In: Proceedings International Conference on Performance Modeling, Sophia Antipolis, France (1985)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  35. Levy, H., Kleinrock, I.: A queue with starter and a queue with vacations: delay analysis by decomposition. Oper. Res. 34, 426–436 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  36. Takagi, H.: Time-dependent process of M/G/1 with exhaustive service. J. Appl. Probab. 29, 418–424 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  37. Lee, T.: M/G/1/N queue with vacation time and exhaustive service discipline. Oper. Res. 32, 774–784 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  38. Lee, H., Lee, S., Park, J.: Analysis of M\(^X\)/G/1 queue with N-policy and multiple vacations. J. Appl. Probab. 31, 476–496 (1994)

    MathSciNet  MATH  Google Scholar 

  39. Keilson, J., Servi, L.: Dynamics of the M/G/1 vacation model. Oper. Res. 35, 575–582 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  40. Keilson, J., Ramaswami, R.: The backlog and deletion-time process for M/G/1 vacation models with exhaustive servece discipline. J. Appl. Probab. 25, 404–412 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  41. Heyman, D.: The T-policy for the M/G/1 queue. Manag. Sci. 23, 775–778 (1977)

    Article  MATH  Google Scholar 

  42. Balachandran, K., Tijms, H.: On the D-policy for the M/G/1 queue. Manag. Sci. 21, 1073–1076 (1975)

    Article  MATH  Google Scholar 

  43. Artalejo, J.: Some results on the M/G/1 queue with N-policy. Asia-Pac. J. Oper. Res. 15, 147–157 (1998)

    MathSciNet  MATH  Google Scholar 

  44. Artalejo, J.: On the M/G/1 queue with D-policy. Appl. Math. Model. 25, 1055–1069 (2001)

    Article  MATH  Google Scholar 

  45. Yadin, M., Naor, P.: Queueing systems with a removable server. Oper. Res. 14, 393–405 (1963)

    Article  Google Scholar 

  46. Lee, H., Srinivasan, M.: Control policies for the M\(^{X}\)/G/1 queueing system. Manag. Sci. 35, 707–712 (1989)

    MathSciNet  MATH  Google Scholar 

  47. Baba, Y.: On the M\(^X\)/G/1 queue with vacation time. Oper. Res. Lett. 5, 93–98 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  48. Tian, N.: The queue M/G/1 with multiple adaptive vacation. Mathematica Applicata 4, 12–18 (1992). (in Chinese)

    MATH  Google Scholar 

  49. Fuhrmann, S., Cooper, R.: Stochastic decompositions in the M/G/1 queue with generalized vacations. Oper. Res. 32, 1117–1129 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  50. Shanthi Kumar, J.: On stochastic decomposition in M/G/1 type queue with generalized server vacation. Oper. Res. 36, 516–569 (1988)

    MathSciNet  Google Scholar 

  51. Li, H., Zhu, Y.: On M/G/1 queue with exhaustive service and generalized vacations. Adv. Appl. Probab. 27, 510–531 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  52. Sun, W., Guo, P., Tian, N.: Equilibrium threshold stratigies in observable queueing systems with setup/closedown times. Central Eur. J. Oper. Res. 18(3), 241–268 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  53. Sun, W., Li, S.: Equilibrium and optimal balking strategies of customers in markov queue with multiple vacations and N-policy. Appl. Math. Model. 40, 284–301 (2016)

    Article  MathSciNet  Google Scholar 

  54. Sun, W., Li, S.: Stochastic Service System under the Vision of Economics. Publishing House of Electronics Industry, Beijing (2017). (in Chinese)

    Google Scholar 

  55. Wang, J.: Fundament of Queuing Game Theory. Science Press, Beijing (2016). (in Chinese)

    Google Scholar 

  56. Brunnel, H., Kim, B.: Discrete-Time Models for Communication System Including ATM. Kluwer Academic Publishers, Boston (1993)

    Book  Google Scholar 

  57. Woodward, M.: Communication and Computer Networks: Modeling with Discrete-Time Queues. IEEE Computer Society Press, Los Alamitos (1994)

    Google Scholar 

  58. Kobayashi, H., Konheim, A.: Queueing models for computer communications analysis. IEEE Trans. Commun. 25, 1–9 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  59. Zhang, Z., Tian, N.: Diserete time Geom/G/1 queue with multiple adaptive vacations. Queuing Syst. 38, 419–429 (2001)

    Article  MATH  Google Scholar 

  60. Fiems, D., Bruneel, H.: Discrete time queueing systems with vacations governed by geometrically distributed times. In: Proceedings Africom, Fifth International Conference on Communication Systems (2001)

    Google Scholar 

  61. Fiems, D., Bruneel, H.: Analysis of a diserete time queueing system with timed vacations. Queueing Syst. 42, 243–254 (2002)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

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

    Article  MATH  Google Scholar 

  64. Alfa, A.S.: A discrete MAP/PH/1 queue with vacations and exhaustive service. Oper. Res. Lett. 18, 31–40 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  65. Alfa, A.S.: Vacation models in discrete time. Queueing Syst. 44, 5–30 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  66. Heyman, D., Sobel, M.: Stochastic Models in Operations Research. McGraw-Hill Publishing, New York (1982)

    MATH  Google Scholar 

  67. Ross, S.M.: Stochastic Processes. Wiley, New York (1997)

    Google Scholar 

  68. Levy, H.: Analysis of cyclic polling systems with binomial-gated service. In: Hasegawa, T., Takagi, H., Takahashi, Y. (eds.) Performance of Distributed and Paralled System, pp. 127–139. North-Holland, Amsterdam (1989)

    Google Scholar 

  69. Browne, S., Coffman, E., Gilbert, E., Wright, E.: Gated exhaustive parallel service. Probab. Eng. Inform. Sci. 6, 217–239 (1992)

    Article  MATH  Google Scholar 

  70. Browne, S., Kella, O.: Parallel service with vacations. Oper. Res. 43, 870–878 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  71. Altman, E., Blabc, H., Khamisy, A., Yechiali, U.: Gated-type polling systems with walking and switch-in times. Stoch. Models 10, 741–763 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  72. Altman, E., Khamisy, A., Yechiali, U.: On elevator polling with globally gated regime. Queueing Syst. 11, 85–90 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  73. Bacot, J., Dshalalow, J.: A bulk input queueing system with batch gated service and multiple vacation policy. Math. Comput. Model. 34, 873–886 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  74. Altman, E.: Stochastic recursive equations with applications to queue with dependent vacations. Ann. Oper. Res. 112, 43–61 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  75. Choi, B., Kim, B., Choi, S.: An M/G/1 queue with multiple type of feedback gated vacations and FIFS policy. Comput. Oper. Res. 30, 1289–1309 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  76. Ishizaki, F., Takine, T., Hasegawa, T.: Analysis of a discrete-time queue with gated priority. Perform. Eval. 23, 121–143 (1995)

    Article  MATH  Google Scholar 

  77. Fiems, D., Vuyst, S., Bruneel, H.: The combined gated exhaustive vacation system in discrete time. Perform. Eval. 49, 221–239 (2002)

    Article  MATH  Google Scholar 

  78. Leung, K., Eisenberg, M.: A single queue with vacations and gated time-limited service. In: IEEE INFOCOM, vol. 89, pp. 899–906 (1989)

    Google Scholar 

  79. Leung, K., Eisenberg, M.: A single queue with vacations and non-gated time-limited service. In: IEEE INFOCOM, vol. 90, pp. 277–283 (1990)

    Google Scholar 

  80. Lee, T.: M/G/1/N queue with vacation time and limited service discipline. Perform. Eval. 9, 181–190 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  81. Lee, T.: Analysis of infinite server polling system with correlated input process and state dependent vacations. Eur. J. Oper. Res. 115, 392–412 (1990)

    Article  Google Scholar 

  82. Takagi, H., Leung, K.: Analysis of a discrete-time queueing system with time-limited service. Queueing Syst. 18, 183–197 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  83. Ma, Z., Tian, N.: Pure limited service Geom/G/1 queue with multiple adaptive vacations. J. Comput. Inform. Syst. 9(3), 515–521 (2005)

    Google Scholar 

  84. Ma, Z., Tian, N.: M/G/1 gated service system with multiple adaptive vacation. J. Comput. Inform. Syst. 1(4), 985–991 (2005)

    Google Scholar 

  85. Takagi, H.: Mean message waiting time in a symmetric polling system. In: Glenbe (ed.) Performance 1984, pp. 293–302. Elsevier Science Publishers (1985)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  87. Keilson, J., Servi, L.: Bloking probabilities for M/G/1 vacation system with occupancy level dependent schedules. Oper. Res. 37, 134–140 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  88. Servi, L.: Average delay approximation of M/G/1 cyclic queue with Bernoulli schedules. IEEE J. Sel. Areas Commun. 4, 813–822 (1986). SAC-4

    Article  Google Scholar 

  89. Ramaswami, R., Servi, L.: The busy period of the M/G/1 vacation model with a Bernoulli schedule. Stoch. Models 4, 507–521 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  90. Choi, B., Park, K.: The M/G/1 retrial queue with Bernoulli schedule. Queueing Syst. 7, 219–228 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  91. Tedijanto, E.: Exact results for the cyclic service queue with a Bernoulli schedule. Perform. Eval. 11, 107–115 (1990)

    Article  MathSciNet  Google Scholar 

  92. Wortman, M., Desney, R., Kiessler, P.: The M/G/1 Bernoulli feedback queue with vacations. Queueing Syst. 9, 353–364 (1991)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  94. Madan, K., Abu-Dayyeh, W., Taiyyan, F.: A two server queue with Bernoulli schedules and a single vacation policy. Appl. Math. Comput. 145, 59–171 (2003)

    MathSciNet  MATH  Google Scholar 

  95. Cao, J., Cheng, K.: Analysis of M/G/1 queueing system with repairable service station. Acta Mathematicae Applicatae Sinica 5(2), 113–127 (1982). (in Chinese)

    Article  MathSciNet  MATH  Google Scholar 

  96. Cao, J.: Ananlysis of the service equipment repairable machine service model. J. Math. Res. Appl. 4, 89–96 (1985). (in Chinese)

    MATH  Google Scholar 

  97. Wang, J., Cao, J., Li, Q.: Reliability analysis of the retrial queue with server breakdowns and repeairs. Queueing Syst. 38, 363–380 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  98. Bischof, W.: Analysis of M/G/1 queues with setup time and vacations under six different service disciplines. Queueing Syst. 39, 265–301 (2001)

    Article  MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

  100. Neuts, M.: Structured Stochastic Matrices of M/G/1 Type and Their Applications. Marcel Dekker, New York (1989)

    MATH  Google Scholar 

  101. Latouche, G., Rammaswami, V.: Introduction to Matrix Analytic Methods in Stochastic Modeling. ASA-SCAM Series on Applied Probability, New York (1999)

    Google Scholar 

  102. Li, Q.: Constructive Computation in Stochastic Models With Applications. RG-Factorization. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-11492-2

    Book  MATH  Google Scholar 

  103. Tian, N., Yue, D.: Quasi Birth and Death Process and Matrix Geometric Solution. Science Press, Beijing (2002). (in Chinese)

    Google Scholar 

  104. Tian, N.: The GI/M/1 queueing system with single exponential vacation. J. Syst. Sci. Complexity 13(1), 1–9 (1993). (in Chinese)

    MathSciNet  MATH  Google Scholar 

  105. Tian, N., Zhang, Z.G.: The discrete time GI/Geom/1 queue with multiple vacations. Queueing Syst. 40, 283–294 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  106. Zhang, Z.G., Tian, N.: The N-threshold for the GI/M/1 queue. Oper. Res. Lett. 32, 77–84 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  107. Tian, N.: The GI/M/1 queue with phase type vacations. Acta Mathematicae Applicatae Sinica 16(4), 452–461 (1993). (in Chinese)

    MathSciNet  MATH  Google Scholar 

  108. Tian, N., Zhang, Z.G.: A note on GI/M/1 queue with PH type setup times or server vacations. INFOR 41, 341–351 (2004)

    Google Scholar 

  109. Dukhovny, A.: Vacations in GI\(^X\)/M\(^X\)/1 systems an Riemann boundary value problems. Queueing Syst. 217, 351–366 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  110. Karaesmen, F., Gupta, S.: The finite capacity GI/M/1/N queue with server vacations. J. Oper. Res. Soc. 47, 817–828 (1996)

    Article  MATH  Google Scholar 

  111. Laxmi, P., Gupta, U.: On the finite-buffer bulk service queue with general independent arrival. Oper. Res. Lett. 25, 957–967 (1999)

    Article  MathSciNet  Google Scholar 

  112. Ke, J.: The analysis of a general input queue with N-policy and exponential vacations. Queueing Syst. 45, 135–160 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  113. Machihara, F.: A GI/SM/1 queue with vacations depending on service times. Stoch. Models 11, 671–690 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  114. Tian, N.: Progress of the multiserver vacation queueing system. J. Yanshn Univ. 22(1), 32–35 (1998). (in Chinese)

    MathSciNet  Google Scholar 

  115. Tian, N.: Stochastic Service System with Vacation. Beking University Press, Beijing (2001). (in Chinese)

    Google Scholar 

  116. Vinod, B.: Exponential queue with server vacations. J. Oper. Res. Soc. 37, 1007–1014 (1986)

    Article  MATH  Google Scholar 

  117. Bardhan, I.: Diffusion approximations for GI/M/s queue with service interruptions. Oper. Res. Lett. 13, 175–182 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  118. Servi, L., Finn, S.: M/M/1 queue with working vacations (M/M/1/MV). Perform. Eval. 50, 41–52 (2001)

    Article  Google Scholar 

  119. Liu, W., Xu, X., Tian, N.: Stochastic decompositions in the M/M/1 queue with working vacations. Oper. Res. Lett. 35, 595–600 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  120. Tian, N., Zhao, X., Wang, K.: The M/M/1 queue with single working vacation. Int. J. Inf. Manage. Sci. 19(4), 621–634 (2008)

    MathSciNet  MATH  Google Scholar 

  121. Li, J., Tian, N.: The M/M/1 queue with working vacations and vacation interruption. JSSSE 16(1), 121–127 (2007)

    MATH  Google Scholar 

  122. Xu, X., Zhang, Z., Tian, N.: The M/M/1 queue with single working vacation and setup times. Int. J. Oper. Res. 6(3), 420–434 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  123. Tian, N., Ma, Z., Liu, M.: The discrete time Geom/Geom/1 queue with multiple working vacations. Appl. Math. Model. 32, 2941–2953 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  124. Baba, Y.: Analysis of a GI/M/1 queue with multiple working vacations. Oper. Res. Lett. 33, 201–209 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  125. Li, J.: Structural Matrix Method and Working Vacation Queue. Science Press, Beijing (2016). (in Chinese)

    Google Scholar 

  126. Banik, A., Gupta, U., Pathak, S.: On the GI/M/1/N queue with multiple working vacations-analytic analysis and computation. Appl. Math. Model. 31, 1701–1710 (2007)

    Article  MATH  Google Scholar 

  127. Li, J., Tian, N., Ma, Z.: Performance analysis of GI/M/1 queue with working vacations and vacation interruption. Appl. Math. Model. 32, 2715–2730 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  128. Yu, M., Tang, Y., Fu, Y.: Steady state analysis of the GI/M/1/L queue with multiple working vacations and partial batch rejection. Comput. Ind. Eng. 56, 1243–1253 (2009)

    Article  Google Scholar 

  129. Chae, K., Lim, D., Yang, W.: The GI/M/1/L queue and the GI/Geom/1 queue both with single working vacation. Perform. Eval. 66, 356–367 (2009)

    Article  Google Scholar 

  130. Li, J., Tian, N.: Performance analysis of a GI/M/1 queue with single working vacation. Appl. Math. Comput. 267, 4960–4971 (2011)

    MathSciNet  MATH  Google Scholar 

  131. Laxmi, P., Goswami, V., Suchitra, V.: Analysis of GI/M(n)/1/N queue with single working vacation and vacation interruption. Int. J. Math. Comput. 7(4), 475–481 (2013)

    Google Scholar 

  132. Li, J., Tian, N.: The discrete time GI/Geom/1 queue with working vacation and vacation interruption. Appl. Math. Comput. 185, 1–10 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  133. Kim, J., Chae, K.: Analysis of queue-length distribution of the M/G/1 queue with working vacations. In: Hawaii International Conference on Statistics and Related Fields (2003)

    Google Scholar 

  134. Wu, D., Takagi, H.: M/G/1 queue with working vacations. Perform. Eval. 63, 654–681 (2006)

    Article  Google Scholar 

  135. Yi, X., Kim, J., Chae, K.: The Geom/G/1 queue with disaster and multiple working vacations. Stoch. Models 23, 537–549 (2007)

    Article  MathSciNet  Google Scholar 

  136. Li, J., Tian, N., Zhang, Z., Luh, H.: Analysis of the M/G/1 queue with exponentially working vacations-a matrix analytic approach. Queueing Syst. 61, 139–166 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  137. Li, J., Liu, W., Tian, N.: Steady state analysis of a discrete time batch arrival queue with working vacations. Perform. Eval. 67, 897–912 (2010)

    Article  Google Scholar 

  138. Zhang, M., Hou, Z.: Performance analysis of MAP/G/1 queue with working vacations and vacation interruption. Appl. Math. Model. 35, 1551–1560 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  139. Gao, S., Liu, Z.: An M/G/1 queue with single working vacation and vacation interruption under Bernoulli schedule. Appl. Math. Model. 37, 1564–1579 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  140. Tian, N., Li, J., Zhang, Z.: Matrix analytic method and working vacation queues-a survey. Int. J. Inf. Manage. Sci. 20, 603–633 (2009)

    MathSciNet  MATH  Google Scholar 

  141. Tian, N., Xu, X., Ma, Z.: Discrete Time Queueing Theory. Science Press, Beijing (2008). (in Chinese)

    Google Scholar 

  142. Kuehn, P.: Multiqueue systems with non-exhaustive cyclic service. Bell Syst. Tech. J. 58, 671–698 (1979)

    Article  MATH  Google Scholar 

  143. Gavish, B., Sumita, U.: Analysis of channed and disk subsystems in computer systems. Queueing Syst. 3(1), 1–23 (1988)

    Article  MATH  Google Scholar 

  144. Zhang, Z.G., Vickson, R., Eenige, M.: Optimal two threshold policies in an M/G/1 queue with two vacation type. Perform. Eval. 29, 63–80 (1997)

    Article  MATH  Google Scholar 

  145. Ghafir, H., Silio, C.: Performance analysis of a multiple access ring network. IEEE Trans. Commun. 41, 1494–1506 (1993)

    Article  MATH  Google Scholar 

  146. Hassan, M., Atiquzzaman, M.: A delayed vacation model of an M/G/1 queue with setup time and its application to SVCC-based ATM networks. IEICE Trans. Commun. E80–B, 317–323 (1997)

    Google Scholar 

  147. Niu, Z., Takahashi, Y., Endo, N.: Performance evaluation of SVC-based IP-over-ATM networks. IEICE Trans. Commun. E81–B, 948–957 (1998)

    Google Scholar 

  148. Niu, Z., Takahashi, Y.: A finite capacity queue with exhaustive vacation/close-down/setup time and Markov arrival processes. Queueing Syst. 31, 1–23 (1999)

    Article  MATH  Google Scholar 

  149. Jin, S., Tian, N.: Performance evaluation of virtual channel switching system based on discrete time queue. J. China Inst. Commun. 25(6), 58–68 (2004). (in Chinese)

    Google Scholar 

  150. Jin, S., Tian, N.: Performance evaluation of connection oriented user initiated session based on discrete time queueing. Syst. Eng. Electron. 27, 931–935 (2005). (in Chinese)

    Google Scholar 

  151. Jin, S., Yue, W., Tian, N.: Performance analysis of ARQ schems in selfsimilar traffic. Technical report of IEICE, pp. 41–46 (2007)

    Google Scholar 

  152. Jin, S., Huo, Z.: Performance Analysis of Switched Virtual Channels. Publishing House of Electronics Industry, Beijing (2007). (in Chinese)

    Google Scholar 

  153. Shen, L.: Performance Analysis and Optimization of E-Commerce System Based on Partial Server’ Vacation. Doctoral Dissertation of Yanshan University (2005). (in Chinese)

    Google Scholar 

  154. Liu, M., Ma, Z., Tian, N.: Performance of admission control for multi-traffic in wireless communication network base on discrete time queue. J. China Inst. Commun. 27, 230–234 (2006). (in Chinese)

    Google Scholar 

  155. Liu, M., Tian, N.: Modeling of base station in wireless networks with finite user population discrete time delay and loss system. J. Beijing Univ. Posts Telecommun. 30, 27–31 (2007). (in Chinese)

    Google Scholar 

  156. Huo, Z., Yue, W., Tian, N., Jin, S.: Modelling and performance evaluation for the sleep mode in IEEE 802.16e wireless networks. In: Proceeding 11th IEEE International Conference on Communication Systems, Guangzhou, pp. 1140–1144 (2008)

    Google Scholar 

  157. Huo, Z., Jin, S., Tian, N., Wang, Y.: Modelling and performance evaluation of the sleep mode in IEEE 802.16e wireless networks with selfsimilar traffic. J. China Univ. Posts Telecommun. 66(4), 34–41 (2009)

    Article  Google Scholar 

Download references

Acknowledgements

The authors would like to thank the anonymous referees for their constructive comments that help us to improve the present paper, and thank the support from Natural Science Foundation of Hebei province, China (No. A2019203313) and Key Project of Scientific Research in Higher Education of Hebei Province (Natural Sciences Class), China (No. ZD2019079).

Author information

Authors and Affiliations

  1. School of Science, Yanshan University, Qinhuangdao, 66004, Hebei, People’s Republic of China

    Naishuo Tian, Xiuli Xu & Zhanyou Ma

  2. School of Information Science and Engineering, Yanshan University, Qinhuangdao, 066004, Hebei, People’s Republic of China

    Shunfu Jin

  3. School of Economics and Management, Qinhuangdao, 066004, Hebei, People’s Republic of China

    Wei Sun

Authors
  1. Naishuo Tian
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiuli Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhanyou Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Shunfu Jin
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Wei Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiuli Xu .

Editor information

Editors and Affiliations

  1. School of Economics and Management, Beijing University of Technology, Beijing, China

    Quan-Lin Li

  2. School of Management Science and Engineering, Central University of Finance and Economics, Beijing, China

    Jinting Wang

  3. School of Economics and Management, Beijing University of Technology, Beijing, China

    Hai-Bo Yu

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Tian, N., Xu, X., Ma, Z., Jin, S., Sun, W. (2019). A Survey for Stochastic Decomposition in Vacation Queues. In: Li, QL., Wang, J., Yu, HB. (eds) Stochastic Models in Reliability, Network Security and System Safety. JHC80 2019. Communications in Computer and Information Science, vol 1102. Springer, Singapore. https://doi.org/10.1007/978-981-15-0864-6_6

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-0864-6_6

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-0863-9

  • Online ISBN: 978-981-15-0864-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation