An Analysis Method of Queueing Networks with a Degradable Structure and Non-zero Repair Times of Systems

An open exponential network with a single class of demands and unreliable queueing systems is considered. System faults occur sequentially with exponential times per fault. When a fault occurs at a system, all the demands there are destroyed immediately. A key performance measure (quality of service measure) of the network is its response time, which is a stochastic process. When a value of the response time exceeds the preset threshold value activation of renewal mechanism of the failed systems takes place. Recovery time has an exponential distribution which does not depend on the number of failed systems. A method, which allows to obtain performance characteristics, was developed. Finally, some numerical examples and a section of conclusions commenting the main research contributions of this paper are presented.

[1]  Sungsoo Kim,et al.  A capacity planning model of unreliable multimedia service systems , 2002, J. Syst. Softw..

[2]  Christian Scheideler,et al.  On local algorithms for topology control and routing in ad hoc networks , 2003, SPAA '03.

[3]  Ian F. Akyildiz,et al.  Performance optimization of distributed-system models with unreliable servers , 1990 .

[4]  Jacob Sharony,et al.  An architecture for mobile radio networks with dynamically changing topology using virtual subnets , 1996, Mob. Networks Appl..

[5]  Xiuli Chao,et al.  A queueing network model with catastrophes and product form solution , 1995, Oper. Res. Lett..

[6]  Anurag Kumar,et al.  Performance analysis of wireless ad hoc networks , 2003 .

[7]  Kishor S. Trivedi,et al.  Sensitivity analysis of reliability and performability measures for multiprocessor systems , 1988, SIGMETRICS 1988.

[8]  Hans Daduna,et al.  Analysis of Jackson networks with infinite supply and unreliable nodes , 2017, Queueing Syst. Theory Appl..

[9]  Zhen Liu,et al.  Optimal Load Balancing on Distributed Homogeneous Unreliable Processors , 1998, Oper. Res..

[10]  Nicholas Bambos,et al.  Queueing Networks of Random Link Topology: Stationary Dynamics of Maximal Throughput Schedules , 2005, Queueing Syst. Theory Appl..

[11]  A.A. Economides,et al.  Optimal routing in a network with unreliable links , 1988, [1988] Proceedings. Computer Networking Symposium.

[12]  Robert L. Moose.  Modeling Networks with Dynamic Topologies , 1989, INFORMS J. Comput..

[13]  Eylem Ekici,et al.  A distributed routing algorithm for datagram traffic in LEO satelitte networks , 2001, TNET.

[14]  Aiguo Wu,et al.  Analytical analysis of production lines with parallel machines , 2011, Proceedings of the 30th Chinese Control Conference.

[15]  Kevin D. Glazebrook,et al.  Dynamic routing to heterogeneous collections of unreliable servers , 2007, Queueing Syst. Theory Appl..

[16]  B. Vinod,et al.  Approximating Unreliable Queueing Networks Under the Assumption of Exponentiality , 1986 .

[17]  Andrea Matta,et al.  Performance evaluation of continuous production lines with machines having different processing times and multiple failure modes , 2003, Perform. Evaluation.

[18]  Qi-Ming He,et al.  Fundamentals of Matrix-Analytic Methods , 2013, Springer New York.

[19]  Stanley B. Gershwin,et al.  A decomposition method for analyzing inhomogeneous assembly/disassembly systems , 2000, Ann. Oper. Res..

[20]  Vassilis S. Kouikoglou.  Optimal rate allocation in unreliable, assembly/disassembly production networks with blocking , 2000, IEEE Trans. Robotics Autom..

[21]  M. A. Osipova,et al.  Limiting distributions in queueing networks with unreliable elements , 2008, Probl. Inf. Transm..

[22]  I. E. Tananko,et al.  A Method of Routing Control in Queueing Networks with Changing Topology , 2013 .