Quick and Insensitive Performance Bounds for Non-Product-Form Queueing Systems

摘要

A bounding methodology for non-product-form queueing systems is outlined and its applications to computer systems is surveyed. The methodology is based on product-type modifications and secures computationally attractive as well as, in particular situations, insensitive bounds. Its application is illustrated for: delay systems, an overflow model, systems with breakdowns, and finite tandem queues. The bounds proposed are simple and intuitively obvious. Numerical support indicates a potential practical usefulness for quick engineering and performance evaluating purposes. An optimal design example is included.