Sistemy i Sredstva Informatiki [Systems and Means of Informatics]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Sistemy i Sredstva Inform.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Sistemy i Sredstva Informatiki [Systems and Means of Informatics], 2020, Volume 30, Issue 3, Pages 32–38
DOI: https://doi.org/10.14357/08696527200303
(Mi ssi716)
 

Ergodicity of single server queues with preemptive priority

A. V. Mistryukov

Department of Mathematical Statistics, Faculty of Computational Mathematics and Cybernetics, M. V. Lomonosov Moscow State University, 1-52 Leninskiye Gory, GSP-1, Moscow 119991, Russian Federation
References:
Abstract: Well known results on ergodicity of queues with preemptive priority were obtained under the assumption that jobs arrive according to Poisson process. However, this assumption does not always hold true in practice. In this paper, the author finds sufficient ergodicity conditions for queues with two priority classes with single server, where interarrival times of high priority jobs have either Erlang or hyperexponential distribution and interarrival times of low priority jobs and service times of jobs of both classes have arbitrary continuous distributions. To formulate desired conditions, the authors use Lindley's recursion for waiting times of each priority class queue. Using Lyapunov–Foster criteria, the authors obtain sufficient conditions for a given recursion to be Harris-ergodic Markov chain.
Keywords: preemptive priority, ergodicity, Lyapunov–Foster criteria, hyperexponential arrivals, Erlang arrivals.
Funding agency Grant number
Moscow Center of Fundamental and Applied Mathematics
The research was performed in accordance with the Program of the Moscow Center for Fundamental and Applied Mathematics.
Received: 28.04.2020
Document Type: Article
Language: Russian
Citation: A. V. Mistryukov, “Ergodicity of single server queues with preemptive priority”, Sistemy i Sredstva Inform., 30:3 (2020), 32–38
Citation in format AMSBIB
\Bibitem{Mis20}
\by A.~V.~Mistryukov
\paper Ergodicity of~single server queues with~preemptive priority
\jour Sistemy i Sredstva Inform.
\yr 2020
\vol 30
\issue 3
\pages 32--38
\mathnet{http://mi.mathnet.ru/ssi716}
\crossref{https://doi.org/10.14357/08696527200303}
Linking options:
  • https://www.mathnet.ru/eng/ssi716
  • https://www.mathnet.ru/eng/ssi/v30/i3/p32
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Системы и средства информатики
    Statistics & downloads:
    Abstract page:106
    Full-text PDF :39
    References:20
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024