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

DOI10.1007/978-3-319-97595-5_15zbMath1452.60076OpenAlexW2886578096MaRDI QIDQ5126556

Nadezhda Petrovna Fokina, Igor Tananko

Publication date: 20 October 2020

Published in: Information Technologies and Mathematical Modelling. Queueing Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-97595-5_15

zbMATH Keywords

Markov chainsqueueing networksunreliable queueing systemsdegradable structure of queueing network

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Limiting distributions in queueing networks with unreliable elements
• Analysis of Jackson networks with infinite supply and unreliable nodes
• A queueing network model with catastrophes and product form solution
• A decomposition method for analyzing inhomogeneous assembly/disassembly systems
• Queueing networks of random link topology: stationary dynamics of maximal throughput schedules
• Dynamic routing to heterogeneous collections of unreliable servers
• Optimal Load Balancing on Distributed Homogeneous Unreliable Processors
• Fundamentals of Matrix-Analytic Methods
• Performance optimization of distributed-system models with unreliable servers
• Modeling Networks with Dynamic Topologies
• Performance Evaluation of Production Lines with Random Processing Times, Multiple Failure Modes and Finite Buffer Capacity — Part II: The Decomposition
• Sensitivity and convergence of uniformly ergodic Markov chains

This page was built for publication: An Analysis Method of Queueing Networks with a Degradable Structure and Non-zero Repair Times of Systems