Skip to content
DraconiticResearch
Search Sources API
182,469 studies31 sourcesUpdated 43 min ago
Peer-reviewedCC BY-NCReliability: Theory & Applications

Redundancy and Renewal of Servers in Opened Queuing Networks

  • G. Sh. Tsitsiashvili1
  • M. A. Osipova1
  1. 1Institute of Applied Mathematics, Far Eastern Branch of RAS
Read full textPDFDOICite

Abstract

An opened queuing network with a redundancy and a renewal of servers is considered. To calculate a stationary regime in this network directly it is necessary to consider sufficiently complicated and large system of linear algebraic equations. A special control of the network route matrix allows to use product theorems and so to simplify these calculations significantly. At first the network with a variable set of servers is analyzed. Then we suppose that an each server of the network may fail and be restored independently. At last we consider different variants of servers redundancy in the opened network. Considered network models are on a joint of queuing and reliability theories.

Related

  1. Stability of Fork-Join Systems with Redundancy and Heterogeneous Servers
    Chutong Gao, Seyed Iravani, Ohad Perry
    arXivPreprintarXiv licenceFull textProbabilityarXiv
  2. On the Observability and Redundancy of Intelligent Transportation Networks
    Mohammadreza Doostmohammadian
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  3. Universal Exponent-Two Degree Laws in Range-Renewal Networks
    Jiansheng Xie, Yechi Zhou
    arXivPreprintarXiv licenceFull textProbabilityarXiv
  4. Forecasting of infectious disease epidemics in sexual networks using attenuated renewal processes
    William D Green, Christopher E Overton, Thomas Ward +2
    PLOS Computational BiologyPeer-reviewedCC BYFull textStatisticsEpidemiology & public healthPLOSEurope PMCDOAJ
  5. The optimal operation decisions of expert service enterprises based on queuing system
    Jing Zhang, Lei Cui, Chen Liu +1
    PLOS OnePeer-reviewedCC BYFull textNeuroscienceNumerical analysis & scientific computingPLOSEurope PMCPMC

Cite

BibTeXRIS
BibTeX
@article{tsitsiashvili2026redundancy,
  title = {{Redundancy and Renewal of Servers in Opened Queuing Networks}},
  author = {G. Sh. Tsitsiashvili and M. A. Osipova},
  journal = {Reliability: Theory \& Applications},
  year = {2026},
  month = oct,
  doi = {10.66721/z1kr4z31},
  url = {https://doi.org/10.66721/z1kr4z31},
  note = {CC BY-NC},
}
RIS
TY  - JOUR
TI  - Redundancy and Renewal of Servers in Opened Queuing Networks
AU  - G. Sh. Tsitsiashvili
AU  - M. A. Osipova
PY  - 2026
DA  - 2026/10/23
JO  - Reliability: Theory & Applications
DO  - 10.66721/z1kr4z31
UR  - https://doi.org/10.66721/z1kr4z31
AB  - An opened queuing network with a redundancy and a renewal of servers is considered. To calculate a stationary regime in this network directly it is necessary to consider sufficiently complicated and large system of linear algebraic equations. A special control of the network route matrix allows to use product theorems and so to simplify these calculations significantly. At first the network with a variable set of servers is analyzed. Then we suppose that an each server of the network may fail and be restored independently. At last we consider different variants of servers redundancy in the opened network. Considered network models are on a joint of queuing and reliability theories.
SN  - 1932-2321
ER  -