Zobrazeno 1 - 10
of 72
pro vyhledávání: '"Rostislav Razumchik"'
Publikováno v:
Mathematics, Vol 12, Iss 17, p 2763 (2024)
We revisit the problem of the computation of the limiting characteristics of (in)homogeneous continuous-time Markov chains with the finite state space. In general, it can be performed only numerically. The common rule of thumb is to interrupt calcula
Externí odkaz:
https://doaj.org/article/fb54c352b070493da6558b4fd6406972
Publikováno v:
Mathematics, Vol 11, Iss 20, p 4265 (2023)
In this paper it is shown, that if a possibly inhomogeneous Markov chain with continuous time and finite state space is weakly ergodic and all the entries of its intensity matrix are locally integrable, then, using available results from the perturba
Externí odkaz:
https://doaj.org/article/52746c71633f4e4598ead69c5c796892
Publikováno v:
Mathematics, Vol 11, Iss 9, p 1979 (2023)
We consider a non-standard class of Markovian time: varying infinite capacity queues with possibly heterogeneous servers and impatience. We assume that during service time, a customer may switch to the faster server (with no delay), when such a serve
Externí odkaz:
https://doaj.org/article/fad3bff70cc6497cb25601bef20bdb33
Publikováno v:
Mathematics, Vol 9, Iss 1, p 42 (2020)
The problem considered is the computation of the (limiting) time-dependent performance characteristics of one-dimensional continuous-time Markov chains with discrete state space and time varying intensities. Numerical solution techniques can benefit
Externí odkaz:
https://doaj.org/article/8953154d45544fb8923fb18ed69bb1b3
Publikováno v:
Journal of Telecommunications and Information Technology, Iss 1 (2016)
The paper is devoted to the analytic analysis of resequencing issue, which is common in packet networks, using queueing-theoretic approach. The authors propose the mathematical model, which describes the simplest setting of packet resequencing, but w
Externí odkaz:
https://doaj.org/article/c98eb54c528b4c539cb40216ccdf8fe9
Autor:
Mikhail Konovalov, Rostislav Razumchik
Publikováno v:
Journal of Telecommunications and Information Technology, Iss 3 (2015)
At present, solutions of many practical problems require significant computational resources and systems (grids, clouds, clusters etc.), which provide appropriate means are constantly evolving. The capability of the systems to fulfil quality of servi
Externí odkaz:
https://doaj.org/article/e62d4b99ad794370833c99c39e0c7c1a
Publikováno v:
Journal of Telecommunications and Information Technology, Iss 4 (2014)
Single hop delay of SIP message going through SIP proxy server operating in carriers backbone network is being analyzed. Results indicate that message sojourn times inside SIP server in most cases do not exceed order of tens of milliseconds (99% of a
Externí odkaz:
https://doaj.org/article/c3433a9026384317a64a7eab06cfa69e
Publikováno v:
Journal of Telecommunications and Information Technology, Iss 4 (2013)
The problem of overload control in Session Initiation Protocol (SIP) signaling networks gives rise to many questions which attract researchers from theoretical and practical point of view. Any mechanism that is claimed to settle this problem down dem
Externí odkaz:
https://doaj.org/article/3dee402dc9a245e8a3e98ee6c3462df3
Autor:
Mikhail Konovalov, Rostislav Razumchik
Publikováno v:
European Journal of Operational Research. 304:1075-1083
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::27ecbba2c6eb1c52674011419f88a556
https://doi.org/10.1016/j.ejor.2022.05.047
https://doi.org/10.1016/j.ejor.2022.05.047
Autor:
Rostislav Razumchik, Mikhail Konovalov
Publikováno v:
Journal of Communications Technology and Electronics. 65:677-689
—Consideration is given to the dispatching problem in an almost nonobservable distributed processing system with M, M ≥ 2, single-server queues operating in parallel, each under the processor-sharing discipline. Jobs having the same job size dist
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ace0267bbb91ec94785876e7aebe559f
https://doi.org/10.1134/s1064226920060182
https://doi.org/10.1134/s1064226920060182