Name
Abstract | ||
|---|---|---|
We present a new class of finite queues in cyclic networks with production blocking. We show that with a threshold property related to the number of customers in the network, these queues are insensitive to the allocation of buffers and the order of the stations. In addition, some simple and practical, yet effective approximations are presented. Numerical examples have been carried out to demonstrate the efficacy of the approaches. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.peva.2005.05.004 | Perform. Eval. |
Keywords | Field | DocType |
cyclic queues,finite queue,new class,customer threshold property,closed queueing,threshold property,effective approximation,closed queueing networks,networks,closed finite queueing network,numerical example,cyclic network | Mean value analysis,Production blocking,Computer science,Queue,Real-time computing,Layered queueing network,Queueing theory,Gordon–Newell theorem,G-network,Distributed computing | Journal |
Volume | Issue | ISSN |
63 | 4 | Performance Evaluation |
Citations | PageRank | References |
1 | 0.34 | 17 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mustafa Yuzukirmizi | 1 | 11 | 1.17 |
| J. MacGregor Smith | 2 | 496 | 61.72 |