×

Simple bounds for finite single-server exponential tandem queues. (English) Zbl 0646.60102

A new bounding methodology for nonproduct form systems is applied to finite single-server exponential tandem queues. The methodology is based on modifying the original system into product form systems that provide bounds for some performance measure of interest. The product form modifications given for this finite tandem queue propose a computationally attractive and intuitively obvious lower and upper bound for the call congestion and throughput. Numerical results indicate that the bounds are reasonable indicators of the order of magnitude.

MSC:

60K25 Queueing theory (aspects of probability theory)
90B22 Queues and service in operations research
PDFBibTeX XMLCite
Full Text: DOI