Skip to main content

BMAP/G/1 Cyclic Polling Model with Binomial Disciplines

  • Conference paper
Modern Probabilistic Methods for Analysis of Telecommunication Networks (BWWQT 2013)

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

Included in the following conference series:

  • 609 Accesses

Abstract

The paper deals with the analysis of BMAP/G/1 cyclic polling model with binomial-gated and binomial-exhaustive disciplines. The analysis relies on formerly applied methodology, in which the service discipline independent and service discipline dependent parts of the analysis are treated separately. In this work we complete the service discipline dependent part of the analysis for the binomial disciplines. This leads to a governing equation of the system in terms of the steady-state number of customers at the server arrival and departure epochs. A numerical procedure can be established based on the newly derived results together with formerly obtained service discipline independent results to determine the steady-state factorial moments of the number of customers in the system.

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. Boxma, O.J.: Workloads and waiting times in Single-server systems with multiple customer classes. Queueing Systems 5, 185–214 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  2. Levy, H.: Analysis of cyclic polling systems with binomial-gated service. In: Hasegawa, T., Takagi, H., Takahashi, Y. (eds.) Performance of Distributed and Parallel Systems, pp. 127–139. Elsevier Science Publishers, North-Holland (1989)

    Google Scholar 

  3. Lucantoni, D.L.: New results on the single server queue with a batch markovian arrival process. Stochastic Models 7, 1–46 (1991)

    MathSciNet  MATH  Google Scholar 

  4. Neuts, M.F.: Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach. The John Hopkins University Press, Baltimore (1981)

    Google Scholar 

  5. Saffer, Z.: Unified Analysis of Cyclic Polling Models with BMAP. Ph.D. thesis, Department of Telecommunications, Budapest University of Technology and Economics (2010)

    Google Scholar 

  6. Saffer, Z., Telek, M.: Unified analysis of BMAP/G/1 cyclic polling models. Queueing Systems 64(1), 69–102 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  7. Takagi, H.: Analysis of Polling Systems. MIT Press (1986)

    Google Scholar 

  8. Takagi, H.: Analysis and Application of Polling Models. In: Reiser, M., Haring, G., Lindemann, C. (eds.) Dagstuhl Seminar 1997. LNCS, vol. 1769, pp. 423–442. Springer, Heidelberg (2000)

    Chapter  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

Saffer, Z. (2013). BMAP/G/1 Cyclic Polling Model with Binomial Disciplines. In: Dudin, A., Klimenok, V., Tsarenkov, G., Dudin, S. (eds) Modern Probabilistic Methods for Analysis of Telecommunication Networks. BWWQT 2013. Communications in Computer and Information Science, vol 356. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35980-4_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35980-4_18

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-642-35980-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics