Simple bounds for queueing systems with breakdowns

DOI10.1016/0166-5316(88)90017-XzbMath0698.90034OpenAlexW2112628771MaRDI QIDQ3476574

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

zbMATH Keywords

Markov chaininsensitivityrandom breakdownssimple boundsjob-local-balancecall congestionfinite service systemsproduct-form modifications

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (10)

A formal proof for the insensitivity of simple bounds for finite multi- server non-exponential tandem queues based on monotonicity results ⋮ PERFORMANCE MEASURES FOR THE TWO-NODE QUEUE WITH FINITE BUFFERS ⋮ Simple bounds and monotonicity results for finite multi-server exponential tandem queues ⋮ Approximate uniformization for continuous-time Markov chains with an application to performability analysis ⋮ On product form approximations for communication networks with losses: Error bounds ⋮ Queueing systems with different types of server interruptions ⋮ A Simple Performability Estimate for Jackson Networks with an Unreliable Output Channel ⋮ Unnamed Item ⋮ Simple performance estimates and error bounds for slotted ALOHA loss systems ⋮ The M/M/c with critical jobs

This page was built for publication: Simple bounds for queueing systems with breakdowns