A formal proof for the insensitivity of simple bounds for finite multi- server non-exponential tandem queues based on monotonicity results
From MaRDI portal
Publication:1100815
DOI10.1016/0304-4149(87)90041-XzbMath0641.60105MaRDI QIDQ1100815
Publication date: 1988
Published in: Stochastic Processes and their Applications (Search for Journal in Brave)
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)
Related Items (7)
PERFORMANCE MEASURES FOR THE TWO-NODE QUEUE WITH FINITE BUFFERS ⋮ Simple bounds and monotonicity results for finite multi-server exponential tandem queues ⋮ A note on monotonicity results in multicasting ⋮ On product form approximations for communication networks with losses: Error bounds ⋮ Erlang loss bounds for OT-ICU systems ⋮ Unnamed Item ⋮ The M/M/c with critical jobs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Monotonicity of the throughput of a closed exponential queueing network in the number of jobs
- Weak convergence for generalized semi-Markov processes
- Simple Bounds and Monotnicity the Call Congestion of Finite Multiserver Delay Systems
- Monotonicity of the Throughput of a Closed Queueing Network in the Number of Jobs
- Simple bounds for queueing systems with breakdowns
- A Concept of Monotonicity and Its Characterization for Closed Queueing Networks
- The effect of increasing service rates in a closed queueing network
- Stochastic Comparisons for Non-Markov Processes
- Simple Bounds for Finite Single-Server Exponential Tandem Queues
- Stochastic Monotonicity of the Queue Lengths in Closed Queueing Networks
- Comparing counting processes and queues
This page was built for publication: A formal proof for the insensitivity of simple bounds for finite multi- server non-exponential tandem queues based on monotonicity results
