Skip to main content

Analysis of the Polling System with Two Markovian Arrival Flows, Finite Buffers, Gated Service and Phase-Type Distribution of Service and Switching Times

  • Conference paper
  • First Online:
Book cover Information Technologies and Mathematical Modelling. Queueing Theory and Applications (ITMM 2021)

Abstract

The polling system with two Markovian Arrival Flows, finite buffers, gated service discipline and Phase-Type (PH) distribution of service and switching times is considered. Stationary distribution of the continuous-time multi-dimensional Markov chain defining the current state of the server, number of customers in the buffers, the number of customers that should obtain service during the residual time of service of customers from various buffers and underlying processes of service or switching time and of arrival process is computed. Expressions for Laplace-Stieltjes transforms of distribution of waiting times of customers in both buffers are obtained. Numerical results giving some insight into performance of the system 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 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.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

References

  1. Vishnevsky, V., Semenova, O.: Polling systems and their application to telecommunication networks. Mathematics 9(117) (2021). https://doi.org/10.3390/math9020117

  2. Takagi, H.: Queuing analysis of polling models: progress in 1990–1994. In: Dshalalow, J.H. (ed.) Frontiers in Queueing: Models, Methods and Problems, pp. 119–146. CRC Press, Boca Raton (1997)

    MATH  Google Scholar 

  3. Perel, E., Yechiali, U.: Two-queue polling systems with switching policy based on the queue that is not being served. Stoch. Model. 33(3), 430–450 (2017)

    Article  MathSciNet  Google Scholar 

  4. Vishnevsky, V.M., Dudin, A.N., Semenova, O.V., Klimenok, V.I.: Performance analysis of the \(BMAP/G/1\) queue with gated servicing and adaptive vacations. Perform. Eval. 68, 446–462 (2011)

    Article  Google Scholar 

  5. Vishnevsky, V., Dudin, A.N., Klimenok, V.I., Semenova, O.: Approximate method to study \(M/G/1\)-type polling system with adaptive polling mechanism. Qual. Technol. Quant. Manag. 9(2), 211–228 (2012)

    Article  Google Scholar 

  6. 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. North-Holland, Amsterdam (1989)

    Google Scholar 

  7. Altman, E., Konstantopoulos, P., Liu, Z.: Stability, monotonicity and invariant quantities in general polling systems. Queueing Syst. 11, 35–57 (1992)

    Article  MathSciNet  Google Scholar 

  8. Altman, E.: Gated polling with stationary ergodic walking times, Markovian routing and random feedback. Ann. Oper. Res. 198, 145–164 (2012)

    Article  MathSciNet  Google Scholar 

  9. Weiss, T., Hillenbrand, J., Krohn, A., Jondral, F.K.: Mutual interference in OFDM-based spectrum pooling systems. IEEE (2004)

    Google Scholar 

  10. Ohanissian, A.: Systems and methods for dynamic currency pooling interfaces. IEEE (2018)

    Google Scholar 

  11. Albrecht, F.: Resource pooling and sharing using distributed ledger systems. IEEE (2017)

    Google Scholar 

  12. Chakravarthy, S.R.: Analysis of a priority polling system with group services. Stoch. Model. 14, 25–49 (1998)

    MathSciNet  MATH  Google Scholar 

  13. Almasi, B., Sztrik, J.: A queueing model for a nonreliable multiterminal system with polling scheduling. J. Math. Sci. 92, 3974–3981 (1998)

    Article  MathSciNet  Google Scholar 

  14. Lucantoni, D.M.: New results on the single server queue with a batch Markovian arrival process. Commun. Stat. Stoch. Models 7(1), 1–46 (1991)

    Article  MathSciNet  Google Scholar 

  15. Chakravarthy, S.: The batch Markovian arrival process: a review and future work. Adv. Probab. Theory Stoch. Process. 1, 21–39 (2001)

    Google Scholar 

  16. Dudin, A.N., Klimenok, V.I., Vishnevsky, V.M.: The Theory of Queuing Systems with Correlated Flows. Springer, Heidelberg (2020). ISBN 978-3-030-32072-0

    Google Scholar 

  17. Neuts, M.F.: Matrix-Geometric Solutions in Stochastic Models. The Johns Hopkins University Press, Baltimore (1981)

    MATH  Google Scholar 

  18. Graham, A.: Kronecker Products and Matrix Calculus with Applications. Ellis Horwood, Cichester (1981)

    MATH  Google Scholar 

  19. Dudin, S.A., Dudina, O.S.: Call center operation model as a \(MAP/PH/N/R-N\) system with impatient customers. Probl. Inf. Transm. 47(4), 364–377 (2011)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgment

This paper has been supported by the RUDN University Strategic Academic Leadership Program.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alexander Dudin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Dudin, A., Sinyugina, Y. (2022). Analysis of the Polling System with Two Markovian Arrival Flows, Finite Buffers, Gated Service and Phase-Type Distribution of Service and Switching Times. In: Dudin, A., Nazarov, A., Moiseev, A. (eds) Information Technologies and Mathematical Modelling. Queueing Theory and Applications. ITMM 2021. Communications in Computer and Information Science, vol 1605. Springer, Cham. https://doi.org/10.1007/978-3-031-09331-9_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-09331-9_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-09330-2

  • Online ISBN: 978-3-031-09331-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics