Simple bounds for closed queueing networks

Simple bounds for closed queueing networks

0.00 Avg rating0 Votes
Article ID: iaor20003180
Country: Netherlands
Volume: 31
Issue: 1/2
Start Page Number: 125
End Page Number: 135
Publication Date: Mar 1999
Journal: Queueing Systems
Authors: , ,
Keywords: queueing networks
Abstract:

Consider a closed Jackson type network in which each queue has a single exponential server. Assume that N customers are moving among k queues. We establish simple closed form bounds on the network throughput (both lower and upper), which are sharper than those that are currently available. Numerical evaluation indicates that the improvements are significant.

Reviews

Required fields are marked *. Your email address will not be published.