Skip to main content
SpringerLink
Log in

A Retrial Queueing System with Processor Sharing

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

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

Abstract

We consider a retrial queueing system with limited processor sharing which can be used for modeling the operation of a cell of fixed capacity in a wireless cellular network with two types of customers (handover and new customers). Customers of two types arrive at the system according to the Marked Markovian Arrival Process (MMAP). Arriving customers of each type follow a bandwidth sharing policy. In period when the number of customers of definite type in the system exceeds a threshold (different between new and handover customers) newly arriving customers of one type (handover customers) are considered to be lost while the customers of another type (new customers) go to orbit of infinite size. From the orbit, they try their attempts to reach a server in exponentially distributed time.

We describe the system operation by multi-dimensional Markov chain, calculate the steady state distribution and main performance measures of the system. Illustrative numerical examples are presented.

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

Access this chapter

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

Institutional subscriptions

References

  1. Ghosh, A., Banik, A.D.: An algorithmic analysis of the \(BMAP/MSP/1\) generalized processor-sharing queue. Comput. Oper. Res. 79, 1–11 (2017)

    Article  MathSciNet  Google Scholar 

  2. Telek, M., van Houdt, B.: Response time distribution of a class of limited processor sharing queues. ACM SIGMETRICS Perform. Eval. Rev. 45, 143–155 (2018). https://doi.org/10.1145/3199524.3199548

    Article  Google Scholar 

  3. Yashkov, S., Yashkova, A.: Processor sharing: a survey of the mathematical theory. Autom. Remote. Control. 68, 662–731 (2007)

    Article  Google Scholar 

  4. Zhen, Q., Knessl, C.: On sojourn times in the finite capacity \(M/M/1\) queue with processor sharing. Oper. Res. Lett. 37, 447–450 (2009)

    Article  MathSciNet  Google Scholar 

  5. Masuyama, H., Takine, T.: Sojourn time distribution in a \(MAP/M/1\) processor-sharing queue. Oper. Res. Lett. 31, 406–412 (2003)

    Article  MathSciNet  Google Scholar 

  6. Dudin, S., Dudin, A., Dudina, O., Samouylov, K.: Analysis of a retrial queue with limited processor sharing operating in the random environment. In: Koucheryavy, Y., Mamatas, L., Matta, I., Ometov, A., Papadimitriou, P. (eds.) WWIC 2017. LNCS, vol. 10372, pp. 38–49. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-61382-6_4

    Chapter  Google Scholar 

  7. Dudin, A., Dudin, S., Dudina, O., Samouylov, K.: Analysis of queuing model with limited processor sharing discipline and customers impatience. Oper. Res. Perspect. 5, 245–255 (2018)

    MathSciNet  Google Scholar 

  8. He, Q.M.: Queues with marked customers. Adv. Appl. Probab. 28, 567–587 (1996)

    Article  MathSciNet  Google Scholar 

  9. 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

    Book  Google Scholar 

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

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  12. Ramaswami, V.: Independent Markov processes in parallel. Commun. Stat. Stoch. Models 1, 419–432 (1985)

    Article  MathSciNet  Google Scholar 

  13. Ramaswami, V., Lucantoni, D.M.: Algorithms for the multi-server queue with phase-type service. Commun. Stat. Stoch. Models 1, 393–417 (1985)

    Article  Google Scholar 

  14. Dudina, O., Kim, C.S., Dudin, S.: Retrial queueing system with Markovian arrival flow and phase type service time distribution. Comput. Ind. Eng. 66, 360–373 (2013)

    Article  Google Scholar 

  15. Klimenok, V.I., Dudin, A.N.: Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory. Queueing Syst. 54, 245–259 (2006)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics and Computer Science, Belarusian State University, 4 Nezavisimosti Avenue, 220030, Minsk, Belarus

    Valentina Klimenok & Alexander Dudin

Authors
  1. Valentina Klimenok
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexander Dudin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alexander Dudin .

Editor information

Editors and Affiliations

  1. Belarusian State University, Minsk, Belarus

    Alexander Dudin

  2. Tomsk State University, Tomsk, Russia

    Anatoly Nazarov

  3. Tomsk State University, Tomsk, Russia

    Alexander Moiseev

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Klimenok, V., Dudin, A. (2021). A Retrial Queueing System with Processor Sharing. In: Dudin, A., Nazarov, A., Moiseev, A. (eds) Information Technologies and Mathematical Modelling. Queueing Theory and Applications. ITMM 2020. Communications in Computer and Information Science, vol 1391. Springer, Cham. https://doi.org/10.1007/978-3-030-72247-0_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-72247-0_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-72246-3

  • Online ISBN: 978-3-030-72247-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation