A formal proof for the insensitivity of simple bounds for finite multi- server non-exponential tandem queues based on monotonicity results

DOI10.1016/0304-4149(87)90041-XzbMath0641.60105MaRDI QIDQ1100815

B. George

Publication date: 1988

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

zbMATH Keywords

insensitivity; loss probabilities; lower and an upper bound for the steady-state probability

Mathematics Subject Classification ID

60K25: Queueing theory (aspects of probability theory)

90B22: Queues and service in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

A note on monotonicity results in multicasting, On product form approximations for communication networks with losses: Error bounds