Informatika i Ee Primeneniya [Informatics and its Applications]
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



Inform. Primen.:
Year:
Volume:
Issue:
Page:
Find






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


Informatika i Ee Primeneniya [Informatics and its Applications], 2021, Volume 15, Issue 2, Pages 20–25
DOI: https://doi.org/10.14357/19922264210203
(Mi ia723)
 

This article is cited in 2 scientific papers (total in 2 papers)

On one nonstationary service model with catastrophes and heavy tails

A. I. Zeifmanabc, Ya. A. Satina, I. A. Kovaleva

a Department of Applied Mathematics, Vologda State University, 15 Lenin Str., Vologda 160000, Russian Federation
b Institute of Informatics Problems, Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119133, Russian Federation
c Vologda Research Center of the Russian Academy of Sciences, 56A Gorky Str., Vologda 160014, Russian Federation
Full-text PDF (364 kB) Citations (2)
References:
Abstract: The paper considers the nonstationary queuing system with catastrophes, one server, and special group arrivals of requests. The intensities of increasing groups of requests can decrease rather slowly. The process $X(t)$, which describes the number of requirements in such system, is considered, the existence of a limiting regime of the probability distribution of states and a limiting average for $X(t)$ is proved, and estimates of the rate of convergence to the limiting regime and the limiting average are obtained. Approximation estimates are obtained using truncations by finite processes. As an example, the authors consider a simple model of a nonstationary system with a rather slow rate of decrease in the arrival rates of customer groups when the group size grows.
Keywords: nonstationary queuing system, countable Markov chains, limiting characteristics, rate of convergence, approximation.
Funding agency Grant number
Russian Science Foundation 19-11-00020
This work was financially supported by the Russian Science Foundation (grant No. 19-11-00020).
Received: 07.03.2021
Document Type: Article
Language: Russian
Citation: A. I. Zeifman, Ya. A. Satin, I. A. Kovalev, “On one nonstationary service model with catastrophes and heavy tails”, Inform. Primen., 15:2 (2021), 20–25
Citation in format AMSBIB
\Bibitem{ZeiSatKov21}
\by A.~I.~Zeifman, Ya.~A.~Satin, I.~A.~Kovalev
\paper On one nonstationary service model with~catastrophes and~heavy tails
\jour Inform. Primen.
\yr 2021
\vol 15
\issue 2
\pages 20--25
\mathnet{http://mi.mathnet.ru/ia723}
\crossref{https://doi.org/10.14357/19922264210203}
Linking options:
  • https://www.mathnet.ru/eng/ia723
  • https://www.mathnet.ru/eng/ia/v15/i2/p20
  • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Информатика и её применения
    Statistics & downloads:
    Abstract page:180
    Full-text PDF :55
    References:17
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024