Skip to main content

Departure Process in Finite-Buffer Queue with Batch Arrivals

  • Conference paper

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

Abstract

A finite-buffer queueing system with batch Poisson arrivals is considered. A system of integral equations for the distribution function of the number of customers h(t) served before t, conditioned by the initial state of the system, is built. A compact formula for probability generating function of the Laplace transform of distribution of h(t) is found using the potential technique. From this representation the mean of h(t) can be effectively calculated numerically using one of the inverse Laplace transform approximation algorithms. Moreover a limit behavior of departure process as the buffer size tends to infinity is investigated. Numerical examples are attached as well.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abate, J., Choudhury, G.L., Whitt, W.: An introduction to numerical transform inversion and its application to probability models. In: Grassmann, W. (ed.) Computational Probability, pp. 257–323. Kluwer, Boston (2000)

    Chapter  MATH  Google Scholar 

  2. Bratiichuk, M.S., Chydzinski, A.: On the loss process in a batch arrival queue. App. Math. Model. 33(9), 3565–3577 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  3. Chydzinski, A.: Queueing characteristics for Markovian traffic models in packet-oriented networks. Silesian University of Technology Press, Gliwice (2007)

    Google Scholar 

  4. Chydzinski, A.: On the distribution of consecutive losses in a finite capacity queue. WSEAS Transactions on Circuits and Systems 4(3), 117–124 (2005)

    MathSciNet  Google Scholar 

  5. Cohen, J.W.: The single server queue. North-Holand Publishing Company, Amsterdam (1982)

    MATH  Google Scholar 

  6. Ishikawa, A.: On the joint distribution of the departure intervals in an ”M/G/1/N” queue. J. Oper. Res. Soc. Jpn. 34(4), 422–435 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  7. Kadankov, V., Kadankova, T.: Busy period, virtual waiting time and number of the customers in G δ|M κ|1|B system. Queueing Syst 65(2), 175–209 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  8. Kempa, W.M., et al.: The departure process for queueing systems with batch arrival of customers. Stoch. Models 24(2), 246–263 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  9. Kempa, W.M.: On one approach to study of departure process in batch arrival queues with multiple vacations. In: Applied stochastic models and data analysis. ASMDA-2009. The XIIIth International Conference pp. 203–207. Vilnius Gediminas Technical University, Vilnius (2009)

    Google Scholar 

  10. 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  MATH  MathSciNet  Google Scholar 

  11. Korolyuk, V.S.: Boundary-value problems for complicated Poisson processes. Naukova Dumka, Kiev (1975) (in Russian)

    Google Scholar 

  12. Korolyuk, V.S., Bratiichuk, M.S., Pirdzhanov, B.: Boundary-value problems for random walks. Ylym, Ashkhabad, (1987) (in Russian)

    Google Scholar 

  13. Takagi, H.: Queueing Analysis, vol. 2. North-Holland, Amsterdam (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kempa, W.M. (2011). Departure Process in Finite-Buffer Queue with Batch Arrivals. In: Al-Begain, K., Balsamo, S., Fiems, D., Marin, A. (eds) Analytical and Stochastic Modeling Techniques and Applications. ASMTA 2011. Lecture Notes in Computer Science, vol 6751. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21713-5_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21713-5_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21712-8

  • Online ISBN: 978-3-642-21713-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics