 Throughput estimation in cyclic queueing networks with blockingT. Tolio and S.B. Gershwin Annals of Operations Research, 1998, vol. 79, issue 0, 207-229 Abstract: The paper presents a new approach for estimating the throughput of a closed queueing network with exponential servers, finite buffer capacity and a blocking after service discipline. The problem is tackled by decomposing the network. The population constraint is enforced by requiring that the sum of the expected number of customers in the various subsystems is equal to the population size. Each subsystem is analyzed as an M/M/1/C i+1 queue with state-dependent arrival and service rates. The rationale behind this last assumption is that the behavior of the system at a given time is affected by the history of blockings and starvations. The results obtained by applying the proposed algorithm to a set of test problems show a good agreement with those obtained with simulation, the difference on the maximum throughput of the network being of the order of 3%. The obtained results also compare favorably with those described in the literature. Copyright Kluwer Academic Publishers 1998 Date: 1998 Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:79:y:1998:i:0:p:207-229:10.1023/a:1018970621392 Ordering information: This journal article can be ordered from Access Statistics for this article Annals of Operations Research is currently edited by Endre Boros More articles in Annals of Operations Research from Springer |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.