Advertisement

The Virtual Waiting Time in a Finite-Buffer Queue with a Single Vacation Policy

  • Wojciech M. Kempa
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7314)

Abstract

A finite-buffer queueing system with Poisson arrivals and generally distributed service times is considered. Every time when the system empties, a single vacation is initialized, during which the service process is blocked. A system of integral equations for the transient distributions of the virtual waiting time v(t) at a fixed moment t, conditioned by the numbers of packets present in the system at the opening, is derived. A compact formula for the 2-fold Laplace transform of the conditional distribution of v(t) is found and written down using a special-type sequence called a potential. From this representation the stationary distribution of v(t) as t → ∞ and its mean can be easily obtained. Theoretical results are illustrated by numerical examples as well.

Keywords

Finite-buffer queue Poisson arrivals Stationary state Transient state Virtual waiting time 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cohen, J.W.: The single server queue. North-Holland Publishing Company, Amsterdam (1982)zbMATHGoogle Scholar
  2. 2.
    Chydzinski, A.: Queueing characteristics for Markovian traffic models in packet-oriented networks. Silesian University of Technology Press, Gliwice (2007) (in Polish)Google Scholar
  3. 3.
    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. Journal of Applied Mathematics and Stochastic Analysis 3, 353–373 (2005)MathSciNetCrossRefGoogle Scholar
  4. 4.
    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)MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Kempa, W.M.: The virtual waiting time for the batch arrival queueing systems. Stoch. Anal. Appl. 22(5), 1235–1255 (2004)MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Kempa, W.M.: GI/G/1/ ∞ batch arrival queueing system with a single exponential vacation. Math. Method. Oper. Res. 69(1), 81–97 (2009)MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    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 (2009)MathSciNetGoogle Scholar
  8. 8.
    Kempa, W.M.: Characteristics of vacation cycle in the batch arrival queueing system with single vacations and exhaustive service. Int. J. Appl. Math. 23(4), 747–758 (2010)MathSciNetzbMATHGoogle Scholar
  9. 9.
    Kempa, W.M.: On departure process in the batch arrival queue with single vacation and setup time. Annales UMCS, Informatica 10(1), 93–102 (2010)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Kempa, W.M.: Some results for the actual waiting time in batch arrival queueing systems. Stoch. Models 26(3), 335–356 (2010)MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    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)CrossRefGoogle Scholar
  12. 12.
    Korolyuk, V.S.: Boundary-value problems for complicated Poisson processes. Naukova Dumka, Kiev (1975) (in Russian)Google Scholar
  13. 13.
    Korolyuk, V.S., Bratiichuk, M.S., Pirdzhanov, B.: Boundary-value problems for random walks. Ylym, Ashkhabad (1987) (in Russian)Google Scholar
  14. 14.
    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)MathSciNetzbMATHCrossRefGoogle Scholar
  15. 15.
    Niu, Z., Shu, T., Takahashi, Y.: A vacation queue with setup and close-down times and batch Markovian arrival processes. Perform. Evaluation 54(3), 225–248 (2003)CrossRefGoogle Scholar
  16. 16.
    Takagi, H.: Queueing Analysis, vol. 1: Vacation and Priority Systems, vol. 2. Finite Systems. North-Holland, Amsterdam (1993)Google Scholar
  17. 17.
    Takagi, H.: M/G/1/N queues with server vacations and exhaustive service. Oper. Res. 42(5), 926–939 (1994)MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Wojciech M. Kempa
    • 1
  1. 1.Institute of MathematicsSilesian University of TechnologyGliwicePoland

Personalised recommendations