Analysis of a Retrial Queue with Limited Processor Sharing Operating in the Random Environment

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10372)


Queueing system with limited processor sharing, which operates in the Markovian random environment, is considered. Parameters of the system (pattern of the arrival rate, capacity of the server, i.e., the number of customers than can share the server simultaneously, the service intensity, the impatience rate, etc.) depend on the state of the random environment. Customers arriving when the server capacity is exhausted join orbit and retry for service later. The stationary distribution of the system states (including the number of customers in orbit and in service) is computed and expressions for the key performance measures of the system are derived. Numerical example illustrates possibility of optimal adjustment of the server capacity to the state of the random environment.


Processor sharing Markovian arrival process Random environment 



The publication was financially supported by the Ministry of Education and Science of the Russian Federation (the Agreement number 02.a03.21.0008) and by the Belarusian Republican Foundation for Fundamental Research (grant F16MV-003).


  1. 1.
    Samouylov, K., Naumov, V., Sopin, E., Gudkova, I., Shorgin, S.: Sojourn time analysis for processor sharing loss system with unreliable server. In: Wittevrongel, S., Phung-Duc, T. (eds.) ASMTA 2016. LNCS, vol. 9845, pp. 284–297. Springer, Cham (2016). doi: 10.1007/978-3-319-43904-4_20 CrossRefGoogle Scholar
  2. 2.
    Samouylov, K., Sopin, E., Gudkova, I.: Sojourn time analysis for processor sharing loss queuing system with service interruptions and MAP arrivals. In: Vishnevskiy, V.M., Samouylov, K.E., Kozyrev, D.V. (eds.) DCCN 2016. CCIS, vol. 678, pp. 406–417. Springer, Cham (2016). doi: 10.1007/978-3-319-51917-3_36 CrossRefGoogle Scholar
  3. 3.
    Yashkov, S.: Processor-sharing queues: some progress in analysis. Queuing Syst. 2, 1–17 (1987)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Yashkov, S., Yashkova, A.: Processor sharing: a survey of the mathematical theory. Autom. Remote Contr. 68, 1662–1731 (2007)CrossRefzbMATHGoogle Scholar
  5. 5.
    Artalejo, J.R., Gomez-Corral, A.: Retrial Queueing Systems: A Computational Approach. Springer, Heidelberg (2008)CrossRefzbMATHGoogle Scholar
  6. 6.
    Nunez-Queija, R.: Sojourn times in a processor sharing queue with service interruptions. Queueing Syst. 34, 351–386 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Nunez-Queija, R.: Sojourn times in non-homogeneous QBD processes with processor sharing. Stoch. Models 17, 61–92 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Ghosh, A., Banik, A.D.: An algorithmic analysis of the \(BMAP/MSP/1\) generalized processor-sharing queue. Comput. Oper. Res. 79, 1–11 (2017)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Lucantoni, D.: New results on the single server queue with a batch Markovian arrival process. Commun. Statist. Stoch. Models 7, 1–46 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Klimenok, V., Dudin, A.: Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory. Queueing Syst. 54, 245–259 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Dudin, A., Kim, C., Dudin, S., Dudina, O.: Priority retrial queueing model operating in random environment with varying number and reservation of servers. Appl. Math. Comput. 269, 674–690 (2015)MathSciNetGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2017

Authors and Affiliations

  1. 1.Belarusian State UniversityMinskBelarus
  2. 2.RUDN UniversityMoscowRussia

Personalised recommendations