Advertisement

Stationary Distribution of Waiting Time in MAP/G/1/N Queueing System with LIFO Service Discipline

  • Alexander DudinEmail author
  • Valentina Klimenok
  • Konstantin Samouylov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10372)

Abstract

In this paper, we consider single server queueing system with a finite buffer, MAP input and independent generally distributed service times. Customers are selected for the service in accordance with the LIFO (Last In – First Out) service discipline. It is well known that stationary distribution of the number of customers in such a system coincides with the corresponding distribution in the system with FIFO (First In – First Out) discipline which has been studied in the literature early. In the present research we focus on investigating the stationary distribution of waiting (sojourn) time in the system.

Keywords

Single-server queue Finite buffer Markovian arrival process LIFO service discipline Waiting time distribution Resource management and admission control 

Notes

Acknowledgments

This publication was financially supported by the Ministry of Education and Science of the Russian Federation (the Agreement number 02.a03.21.0008).

References

  1. 1.
    Buchholz, P., Kriege, J., Felko, I.: Input Modeling with Phase-Type Distributions and Markov Models: Theory and Applications. SpringerBriefs in Mathematics. Springer, Heidelberg (2014)CrossRefzbMATHGoogle Scholar
  2. 2.
    Dudin, A.N., Shaban, A.A., Klimenok, V.I.: Analysis of a \(BMAP/G/1/N\) queue. Int. J. Simul. Syst. Sci. Technol. 6, 13–23 (2005)Google Scholar
  3. 3.
    Dudin, A.N., Klimenok, V.I., Tsarenkov, G.V.: Characteristics calculation for a single server queue with the batch Markovian arrival process, semi-Markovian service and finite buffer. Autom. Remote Contr. 63, 1285–1297 (2002)CrossRefzbMATHGoogle Scholar
  4. 4.
    Dudin, A., Shaban, A.: Analysis of the \(BMAP/SM/1/N\) type system with randomized choice of customers admission discipline. Commun. Comput. Inf. Sci. 638, 44–56 (2016)Google Scholar
  5. 5.
    Graham, A.: Kronecker Products and Matrix Calculus with Applications. Ellis Horwood, Cichester (1981)zbMATHGoogle Scholar
  6. 6.
    Kim, C.S., Klimenok, V., Taramin, O.: A tandem retrial queueing system with two Markovian flows and reservation of channels. Comput. Oper. Res. 37, 1238–1246 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Li, R., Eryilmaz, A.: Scheduling for end-to-end deadline-constrained traffic with reliability requirements in multihop networks. IEEE/ACM Trans. Netw. 20, 1649–1662 (2012)CrossRefGoogle Scholar
  8. 8.
    Lucantoni, D.M.: New results on the single server queue with a batch Markovian arrival process. Commun. Statist. Stoch. Models 7, 1–46 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Matveev, V.F., Ushakov, V.G.: Queueing systems. The Moscow University Press, Moscow (1984). (in Russian)zbMATHGoogle Scholar
  10. 10.
    Neuts, M.F.: Matrix-Geometric Solutions in Stochastic Models. The Johns Hopkins University Press, Baltimore (1981)zbMATHGoogle Scholar
  11. 11.
    Nzouonta, J., Ott, T., Borcea, C.: Impact of queuing discipline on packet delivery latency in ad hoc networks. Perform. Eval. 66, 667–684 (2009)CrossRefGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2017

Authors and Affiliations

  • Alexander Dudin
    • 1
    • 2
    Email author
  • Valentina Klimenok
    • 1
    • 2
  • Konstantin Samouylov
    • 2
  1. 1.Department of Applied Mathematics and Computer ScienceBelarusian State UniversityMinskBelarus
  2. 2.Department of Applied Probability and InformaticsRUDN UniversityMoscowRussia

Personalised recommendations