Skip to main content

Output Process in Batch-Arrival Queue with N-Policy and Multiple Vacations

  • Conference paper
Analytical and Stochastic Modeling Techniques and Applications (ASMTA 2013)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 7984))

Abstract

In the paper the M X/G/1-type queueing system with the N-policy and multiple vacations is considered. The output process, counting successive departures, is studied using the approach consisting of two main stages. Firstly, introducing an auxiliary model with the N-policy and multiple vacations, and applying the formula of total probability, the analysis is brought to the case of the corresponding system without restrictions in the service process, on its first busy cycle. Next, defining a delayed renewal process of successive vacation cycles, the general results are obtained. The explicit formula for the probability generating function of the Laplace transform of the distribution of the number of packets completely served before a fixed moment t is derived and written using transforms of “input” distributions of the system, and components of the Wiener-Hopf-type factorization identity connected with them. Moreover, illustrative numerical results are presented.

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

Access this chapter

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bratiichuk, M.S., Kempa, W.M.: Application of the superposition of renewal processes to the study of batch arrival queues. Queueing Syst. 44, 51–67 (2003)

    Article  MathSciNet  Google Scholar 

  2. Bratiichuk, M.S., Kempa, W.M.: Explicit formulae for the queue length distribution of batch arrival systems. Stoch. Models 20(4), 457–472 (2004)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  4. Jiang, F.-C.: Mitigation techniques for the energy hole problem in sernsor networks using N-policy M/G/1 queuing models. In: Proc. of Frontier Computing. Theory, Technologies and Applications, IET International Conference, Taichung, Taiwan, August 4-6, pp. 281–286 (2010)

    Google Scholar 

  5. Kempa, W.M.: GI/G/1/ ∞ batch arrival queueing system with a single exponential vacation. Math. Methods Oper. Res. 69(1), 91–97 (2009)

    MathSciNet  Google Scholar 

  6. Kempa, W.M.: Some new results for departure process in the M X/G/1 queueing system with a single vacation and exhaustive service. Stoch. Anal. Appl. 28(1), 26–43 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  7. Kempa, W.M.: The transient analysis of the queue-length distribution in the batch arrival system with N-policy, multiple vacations and setup times. In: AIP Conf. Proc., vol. 1293, pp. 235–242 (2010)

    Google Scholar 

  8. Kempa, W.M.: Analysis of departure process in batch arrival queue with multiple vacations and exhaustive service. Commun. Stat. - Theor. M. 40, 1–10 (2011)

    Article  MathSciNet  Google Scholar 

  9. Kempa, W.M.: Departure process in finite-buffer queue with batch arrivals. In: Al-Begain, K., Balsamo, S., Fiems, D., Marin, A. (eds.) ASMTA 2011. LNCS, vol. 6751, pp. 1–13. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  10. Kempa, W.M.: Transient analysis of the output process in the GI/M/1-type queue with finite buffer. In: AIP Conf. Proc., vol. 1487, pp. 193–200 (2012)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  12. Lee, H.W., Lee, S.S., Chae, K.C.: Operating characteristics of M X/G/1 queue with N-policy. Queueing Syst. 15(1-4), 387–399 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  13. Mancuso, V., Alouf, S.: Analysis of power saving with continuous connectivity. Comput. Netw. 56, 2481–2493 (2012)

    Article  Google Scholar 

  14. Takagi, H.: Queueing analysis: A foundation of performance evaluation. Vacation and priority systems, vol. 1, Part 1. Elsevier, Amsterdam (1991)

    Google Scholar 

  15. Tang, Y.: The departure process of the M/G/1 queueing model with server vacation and exhaustive service descipline. J. Appl. Probab. 31(4), 1070–1082 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  16. Tang, Y.: The departure process for the M x/G/1 queueing system with server vacations. Math. Appl. 20(3), 478–484 (2007)

    MathSciNet  MATH  Google Scholar 

  17. Tian, N., Zhang, Z.G.: Vacation queueing models: theory and applications. Springer, New York (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kempa, W.M. (2013). Output Process in Batch-Arrival Queue with N-Policy and Multiple Vacations. In: Dudin, A., De Turck, K. (eds) Analytical and Stochastic Modeling Techniques and Applications. ASMTA 2013. Lecture Notes in Computer Science, vol 7984. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39408-9_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39408-9_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39407-2

  • Online ISBN: 978-3-642-39408-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics