Simple bounds for queueing systems with breakdowns
From MaRDI portal
Recommendations
Cited in
(13)- Approximate uniformization for continuous-time Markov chains with an application to performability analysis
- Simple and insensitive bounds for a grading and an overflow model
- On product form approximations for communication networks with losses: Error bounds
- scientific article; zbMATH DE number 5590582 (Why is no real title available?)
- scientific article; zbMATH DE number 958364 (Why is no real title available?)
- Strong stochastic bounds for the stationary distribution of a class of multicomponent performability models
- Simple performance estimates and error bounds for slotted ALOHA loss systems
- Queueing systems with different types of server interruptions
- A simple performability estimate for Jackson networks with an unreliable output channel
- A formal proof for the insensitivity of simple bounds for finite multi- server non-exponential tandem queues based on monotonicity results
- Simple bounds and monotonicity results for finite multi-server exponential tandem queues
- PERFORMANCE MEASURES FOR THE TWO-NODE QUEUE WITH FINITE BUFFERS
- The M/M/c with critical jobs
This page was built for publication: Simple bounds for queueing systems with breakdowns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3476574)