Availability Formulas and Performance Measures for Separable Degradable Networks
From MaRDI portal
blocking rulesGordon-Newell networksJackson networksperformabilitypoint availabilityproduct form solutionreliabilitythroughput
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Queueing theory (aspects of probability theory) (60K25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Reliability and life testing (62N05)
Recommendations
- Availability and performance analysis of stochastic networks with unreliable nodes
- Availability evaluation of flow networks with varying throughput-demand and deferred repair
- A decomposition algorithm for network reliability evaluation
- Bounds on expected performance of networks with links subject to failure
- Accurate and interval estimates of the probability of network service availability for communication networks
- scientific article; zbMATH DE number 1735793
Cites work
- A Many-Server Queue with Service Interruptions
- A Multivariate Exponential Distribution
- A queueing theoretical proof of increasing property of Polya frequency functions
- A two-node jackson's network subject to breakdowns
- An approximate product form for a class of degradable queueing networks
- Closed Queuing Systems with Exponential Servers
- DECOMPOSITIONS OF THE QUEUE LENGTH DISTRIBUTIONS IN THE MAP/G/1 QUEUE UNDER MULTIPLE AND SINGLE VACATIONS WITHN-POLICY
- scientific article; zbMATH DE number 732082 (Why is no real title available?)
- Product form stationary distributions for queueing networks with blocking and rerouting
- Queueing networks with dependent nodes and concurrent movements
- Queues Subject to Service Interruption
- Queuing with Breakdowns
- Sojourn Times in Queueing Networks
- Some Queuing Problems with the Service Station Subject to Breakdown
- The Markov-modulated Poisson process (MMPP) cookbook
- Two processes interacting only during breakdown: The case where the load is not lost
Cited in
(18)- Analysis of Jackson networks with infinite supply and unreliable nodes
- Robustness analysis of generalized Jackson network
- Loss systems in a random environment: steady state analysis
- Correlation formulas for Markovian network processes in a random environment
- Availability evaluation of flow networks with varying throughput-demand and deferred repair
- Analysis of unreliable open queueing network with dynamic routing
- Stochastic product form networks with unreliable nodes: analysis of performance and availability.
- Product Form Models for Queueing Networks with an Inventory
- Dependence in Lag for Markov Chains on Partially Ordered State Spaces with Applications to Degradable Networks
- An approximate product form for a class of degradable queueing networks
- Rate of convergence to stationary distribution for unreliable Jackson-type queueing network with dynamic routing
- An analysis method of queueing networks with a degradable structure and non-zero repair times of systems
- An analysis method of open queueing networks with a degradable structure and instantaneous repair times of systems
- Computable bounds on the spectral gap for unreliable Jackson networks
- G-networks of unreliable nodes
- Availability and performance analysis of stochastic networks with unreliable nodes
- Discrete time queueing networks with product form steady state. Availability and performance analysis in an integrated model
- On exponential convergence of dynamic queueing network and its applications
This page was built for publication: Availability Formulas and Performance Measures for Separable Degradable Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5454842)
