Skip to main content
SpringerLink
Log in
Book cover

International Conference on Computer Networks

CN 2018: Computer Networks pp 311–320Cite as

Transient Queueing Delay in a Finite-Buffer Batch-Arrival Model with Constant Repeated Vacations

  • Conference paper
  • First Online:

  • 873 Accesses

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

Abstract

A finite-buffer single-channel queueing model with batch Poisson arrivals and generally-distributed processing times is considered, in which a variant of a vacation policy is implemented. Namely, every time when the service station becomes idle, a number of constant vacation times are being initialized repeatedly, until at least one packet will income into the accumulating buffer. During the whole vacation period the processing of packets is suspended. Applying the analytical method based on the idea of embedded Markov chain and linear-algebraic approach, a compact-form representation for the Laplace transform of the queueing delay tail distribution is found. The considered queueing system can be utilized in performance evaluation of wireless network nodes with energy saving mechanism based on constant repeated vacations.

This is a preview of subscription content, 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

Learn about institutional subscriptions

References

  1. Alouf, S., Altman, E., Azad, A.: M/G/1 queue with repeated inhomogeneous vacations applied to IEEE 802.16e power saving. In: Proceedings of ACM SIGMETRICS 2008, Performance Evaluation Review, vol. 36, pp. 451–452 (2008)

    Article  Google Scholar 

  2. Boxma, O.J., Schlegel, S., Yechiali, Y.: A note on an M/G/1 queue with a waiting server, timer and vacations. Am. Math. Soc. Transl. Ser. 2(207), 25–35 (2002)

    MathSciNet  MATH  Google Scholar 

  3. Cohen, J.W.: The Single Server Queue. North-Holland Publishing Company, Amsterdam-New York-Oxford (1982)

    MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  5. Gupta, U.C., Banik, A.D., Pathak, S.S.: Complete analysis of \(MAP/G/1/N\) queue with single (multiple) vacation(s) under limited service discipline. J. Appl. Math. Stoch. Anal. 3, 353–373 (2005)

    Article  MathSciNet  Google Scholar 

  6. Gupta, U.C., Sikdar, K.: Computing queue length distributions in \(MAP/G/1/N\) queue under single and multiple vacation. Appl. Math. Comput. 174(2), 1498–1525 (2006)

    MathSciNet  MATH  Google Scholar 

  7. Kempa, W.M.: The virtual waiting time for the batch arrival queueing systems. Stoch. Anal. Appl. 22(5), 1235–1255 (2004)

    Article  MathSciNet  Google Scholar 

  8. Kempa, W.M.: Some results for the actual waiting time in batch arrival queueing systems. Stoch. Models 26(3), 335–356 (2010)

    Article  MathSciNet  Google Scholar 

  9. Kempa, W.M.: Transient workload distribution in the M/G/1 finite-buffer queue with single and multiple vacations. Ann. Oper. Res. 239(2), 381–400 (2016)

    Article  MathSciNet  Google Scholar 

  10. Kempa, W.M., Kurzyk, D.: Analysis of transient virtual delay in a finite-buffer queueing model with generally distributed setup times. In: Czachórski, T., Gelenbe, E., Grochla, K., Lent, R. (eds.) ISCIS 2016. CCIS, vol. 659, pp. 175–184. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-47217-1_19

    Chapter  Google Scholar 

  11. Kempa, W.M., Paprocka, I., Kalinowski, K., Grabowik, C., Krenczyk, D.: Study on transient queueing delay in a single-channel queueing model with setup and closedown times. In: Dregvaite, G., Damasevicius, R. (eds.) ICIST 2016. CCIS, vol. 639, pp. 464–475. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-46254-7_37

    Chapter  Google Scholar 

  12. Kempa, W.M.: Queueing delay in a finite-buffer model with failures and bernoulli feedback. In: Świątek, J., Borzemski, L., Wilimowska, Z. (eds.) ISAT 2017. AISC, vol. 656, pp. 229–238. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-67229-8_21

    Chapter  Google Scholar 

  13. Korolyuk, V.S.: Boundary-Value Problems for Complicated Poisson Processes. Naukova Dumka, Kiev (1975)

    Google Scholar 

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

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  16. Niu, Z., Shu, T., Takahashi, Y.: A vacation queue with setup and close-down times and batch Markovian arrival processes. Perform. Eval. 54(3), 225–248 (2003)

    Article  Google Scholar 

  17. Saffer, Z., Telek, M.: Analysis of BMAP/G/1 vacation model of non-M/G/1-type. In: Thomas, N., Juiz, C. (eds.) EPEW 2008. LNCS, vol. 5261, pp. 212–226. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-87412-6_16

    Chapter  Google Scholar 

  18. Seo, J., Lee, S., Park, N., Lee, H., Cho C.: Performance analysis of sleep mode operation in IEEE 802.16e. In: Proceedings of the 60th Vehicular Technology Conference, VTC2004-Fall (Los Angeles), vol. 2, pp. 1169–1173 (2004)

    Google Scholar 

  19. Takagi, H.: Queueing Analysis, vol. 1: Vacation and Priority Systems, vol. 2. Finite Systems. North-Holland, Amsterdam (1993)

    Google Scholar 

  20. Takagi, H.: M/G/1/N queues with server vacations and exhaustive service. Oper. Res. 42(5), 926–939 (1994)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Applied Mathematics, Silesian University of Technology, 23 Kaszubska Street, 44-100, Gliwice, Poland

    Wojciech M. Kempa & Rafał Marjasz

Authors
  1. Wojciech M. Kempa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rafał Marjasz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wojciech M. Kempa .

Editor information

Editors and Affiliations

  1. Institute of Informatics, Silesian University of Technology, Gliwice, Poland

    Piotr Gaj

  2. Silesian University of Technology, Gliwice, Poland

    Michał Sawicki

  3. University of Opole, Opole, Poland

    Grażyna Suchacka

  4. Silesian University of Technology, Gliwice, Poland

    Andrzej Kwiecień

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kempa, W.M., Marjasz, R. (2018). Transient Queueing Delay in a Finite-Buffer Batch-Arrival Model with Constant Repeated Vacations. In: Gaj, P., Sawicki, M., Suchacka, G., Kwiecień, A. (eds) Computer Networks. CN 2018. Communications in Computer and Information Science, vol 860. Springer, Cham. https://doi.org/10.1007/978-3-319-92459-5_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-92459-5_25

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-92458-8

  • Online ISBN: 978-3-319-92459-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation