Formal Proof for the Insensibility of Simple Bounds for Finite Multiserver Nonexponential Tandem Queues

摘要

It is proved that for multiserver disciplines, bounds for finite tandem queues in the exponential case are insensitive, that is, remain valid for the nonexponential case. The technique applied extends standard monotonicity techniques and seems promising for further application.