Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/104113
Title: Simple bounds for closed queueing networks
Authors: Harel, A. 
Namn, S.
Sturm, J.
Keywords: Balanced job bounds
Closed queueing networks
Complete symmetric function
Lower bound
Majorization
Mean performance measures
Normalization constant
Throughput
Upper bound
Issue Date: Mar-1999
Citation: Harel, A.,Namn, S.,Sturm, J. (1999-03). Simple bounds for closed queueing networks. Queueing Systems 31 (1-2) : 125-135. ScholarBank@NUS Repository.
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.
Source Title: Queueing Systems
URI: http://scholarbank.nus.edu.sg/handle/10635/104113
ISSN: 02570130
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

44
checked on Nov 24, 2022

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.