Izvestiya of Saratov University. Mathematics. Mechanics. 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



Izv. Saratov Univ. Math. Mech. Inform.:
Year:
Volume:
Issue:
Page:
Find






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


Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, 2020, Volume 20, Issue 2, Pages 266–276
DOI: https://doi.org/10.18500/1816-9791-2020-20-2-266-276
(Mi isu844)
 

Scientific Part
Computer Sciences

An analysis method of open queueing networks with a degradable structure and instantaneous repair times of systems

I. E. Tananko, N. P. Fokina

Saratov State University, 83 Astrakhanskaya St., Saratov 410012, Russia
References:
Abstract: An unreliable open queueing network with Poisson arrivals is considered. For each queueing system the service and failures times are exponentially distributed random variables. The failures of systems lead to changes in the structure of the network and corresponding changes in the performance measures of the queueing network. It is assumed that the times between changes in the network structure are sufficient for the steady-state regime. The main measure of the quality for the network at each structure constancy interval is the average response time. Repairs of all queueing systems occur immediately when the average response time becomes greater than the threshold value. This article presents a method of the network analysis using continuous time Markov chains. It is shown that the steady-state probability distribution of the unreliable queueing network has a product form solution. Expressions for the stationary performance measures of queueing systems and the network including the average of system repair time intervals are obtained. A numerical example to investigate the dependence of the performance measures on some network parameters is demonstrated.
Key words: queueing networks, Markov chains, unreliable queueing systems, degradable structure of queueing network.
Received: 23.11.2018
Accepted: 05.04.2019
Bibliographic databases:
Document Type: Article
UDC: 519.872
Language: Russian
Citation: I. E. Tananko, N. P. Fokina, “An analysis method of open queueing networks with a degradable structure and instantaneous repair times of systems”, Izv. Saratov Univ. Math. Mech. Inform., 20:2 (2020), 266–276
Citation in format AMSBIB
\Bibitem{TanFok20}
\by I.~E.~Tananko, N.~P.~Fokina
\paper An analysis method of open queueing networks with a degradable structure and instantaneous repair times of systems
\jour Izv. Saratov Univ. Math. Mech. Inform.
\yr 2020
\vol 20
\issue 2
\pages 266--276
\mathnet{http://mi.mathnet.ru/isu844}
\crossref{https://doi.org/10.18500/1816-9791-2020-20-2-266-276}
\elib{https://elibrary.ru/item.asp?id=43021447}
Linking options:
  • https://www.mathnet.ru/eng/isu844
  • https://www.mathnet.ru/eng/isu/v20/i2/p266
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Известия Саратовского университета. Новая серия. Серия Математика. Механика. Информатика
    Statistics & downloads:
    Abstract page:128
    Full-text PDF :58
    References:11
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024