Zobrazeno 1 - 10
of 25
pro vyhledávání: '"IRINA PESHKOVA"'
Publikováno v:
Mathematics, Vol 12, Iss 14, p 2202 (2024)
A single-server queueing system with n classes of customers, stationary superposed input processes, and general class-dependent service times is considered. An exponential splitting is proposed to construct classical regeneration in this (originally
Externí odkaz:
https://doaj.org/article/e70fb0847f9040e288d0ed17e5a996a3
Publikováno v:
Mathematics, Vol 8, Iss 8, p 1277 (2020)
The motivation of mixing distributions in communication/queueing systems modeling is that some input data (e.g., service time in queueing models) may follow several distinct distributions in a single input flow. In this paper, we study the sensitivit
Externí odkaz:
https://doaj.org/article/6db7d99c8c77406ea8d41efdc79c63bc
Autor:
Alexander Rumyantsev, Irina Peshkova
Publikováno v:
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, Iss 7 (2018)
We present regeneration techniques for perfomance estimation of multiserver system characteristics. Providing a necessary background of classical and weak regeneration notions, we focus on less well-known and mainly new construction of artificial cla
Externí odkaz:
https://doaj.org/article/62d10b77f270442cb890b8a99f1d5b9b
Publikováno v:
Communications in Computer and Information Science ISBN: 9783031306471
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::36a26ec3eb62814ee616227a6ae5a8e7
https://doi.org/10.1007/978-3-031-30648-8_12
https://doi.org/10.1007/978-3-031-30648-8_12
Publikováno v:
Journal of Mathematical Sciences. 248:80-91
In this work, we consider an approximation of the so-called far-end-tail distribution of processes describing quality of service (QoS) performance of queueing systems. This approximation is based on the asymptotic equivalence between the excess distr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::de1db2182a13c9cff29e4ed8edbe18b7
https://doi.org/10.1007/s10958-020-04857-3
https://doi.org/10.1007/s10958-020-04857-3
Autor:
IRINA PESHKOVA
Publikováno v:
Informatics and Applications.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5e286823c9b2593aeb06659dd1d11016
https://doi.org/10.14357/19922264220109
https://doi.org/10.14357/19922264220109
Publikováno v:
Information Technologies and Mathematical Modelling. Queueing Theory and Applications ISBN: 9783031093302
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6a55bcf9e7afb8a191c661811d5a9447
https://doi.org/10.1007/978-3-031-09331-9_7
https://doi.org/10.1007/978-3-031-09331-9_7
Autor:
Alexander Rumyantsev, Irina Peshkova
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031232060
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::615762e0a3780f01709740cf9f43d22a
https://doi.org/10.1007/978-3-031-23207-7_30
https://doi.org/10.1007/978-3-031-23207-7_30
Publikováno v:
Mathematics
Volume 11
Issue 3
Pages: 564
Volume 11
Issue 3
Pages: 564
In this research, a single-server M-class retrial queueing system (orbit queue) with constant retrial rates and Poisson inputs is considered. The main purpose is to construct the upper and lower bounds of the stationary workload in this system expres
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::19fbacacf91dc489b992a4d745aa2c5e
https://doi.org/10.3390/math11030564
https://doi.org/10.3390/math11030564
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030925062
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::72230ec0c256219e5e2a1faa6474279b
https://doi.org/10.1007/978-3-030-92507-9_21
https://doi.org/10.1007/978-3-030-92507-9_21