Simple Bounds and Monotnicity the Call Congestion of Finite Multiserver Delay Systems

DOI10.1017/S026996480000067XzbMath1134.90344MaRDI QIDQ3415875

Jean Walrand, Nico M. van Dijk, Pantelis Tsoucas

Publication date: 19 January 2007

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

60K25: Queueing theory (aspects of probability theory)

90B22: Queues and service in operations research

Related Items

Monotonicity and error bounds for networks of Erlang loss queues, 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, On product form approximations for communication networks with losses: Error bounds, An approximate solution and error bound for a discrete time queue with simultaneous servicing, Erlang loss bounds for OT-ICU systems, Error bounds for state space truncation of finite Jackson networks, On truncations and perturbations of Markov decision problems with an application to queueing network overflow control

Cites Work

• Unnamed Item
• Tables for M/G/c queuing systems with phase-type service
• Refining diffusion approximations for queues
• Approximations for the steady-state probabilities in theM/G/cqueue