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

DOI10.1017/S026996480000067XzbMath1134.90344OpenAlexW2160959619MaRDI 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)

Full work available at URL: https://doi.org/10.1017/s026996480000067x

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (8)

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

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

This page was built for publication: Simple Bounds and Monotnicity the Call Congestion of Finite Multiserver Delay Systems