Simple bounds for queueing systems with breakdowns
DOI10.1016/0166-5316(88)90017-XzbMATH Open0698.90034OpenAlexW2112628771MaRDI QIDQ3476574FDOQ3476574
Authors: Nico M. van Dijk 
Publication date: 1988
Published in: Performance Evaluation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-5316(88)90017-x
Recommendations
Markov chaininsensitivityrandom breakdownssimple boundsjob-local-balancecall congestionfinite service systemsproduct-form modifications
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Cited In (13)
- A formal proof for the insensitivity of simple bounds for finite multi- server non-exponential tandem queues based on monotonicity results
- Queueing systems with different types of server interruptions
- Simple and insensitive bounds for a grading and an overflow model
- Title not available (Why is that?)
- Strong stochastic bounds for the stationary distribution of a class of multicomponent performability models
- A simple performability estimate for Jackson networks with an unreliable output channel
- Approximate uniformization for continuous-time Markov chains with an application to performability analysis
- On product form approximations for communication networks with losses: Error bounds
- Simple performance estimates and error bounds for slotted ALOHA loss systems
- Simple bounds and monotonicity results for finite multi-server exponential tandem queues
- PERFORMANCE MEASURES FOR THE TWO-NODE QUEUE WITH FINITE BUFFERS
- Title not available (Why is that?)
- 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)
