|
 ABSTRACT
It is shown that mean queue sizes, mean waiting times, and throughputs in closed multiple-chain queuing networks which have product-form solution can be computed recursively without computing product terms and normalization constants. The resulting computational procedures have improved properties (avoidance of numerical problems and, in some cases, fewer operations) compared to previous algorithms. Furthermore, the new algorithms have a physically meaningful interpretation which provides the basis for heuristic extensions that allow the approximate solution of networks with a very large number of closed chains, and which is shown to be asymptotically valid for large chain populations.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
BARD, Y The modehng of some scheduling strategies for an mteractwe computer system In Computer Performance, K M. Chandy and M Relser, Eds., North Holland, Amsterdam, 1977, pp 113-137.
|
 |
2
|
Forest Baskett , K. Mani Chandy , Richard R. Muntz , Fernando G. Palacios, Open, Closed, and Mixed Networks of Queues with Different Classes of Customers, Journal of the ACM (JACM), v.22 n.2, p.248-260, April 1975
[doi> 10.1145/321879.321887]
|
| |
3
|
|
| |
4
|
|
| |
5
|
Cox, D.R. A use of complex probabilities in the theory of stochastic processes. Pro(:. Cambridge Phil. Soc. M (1955), 313-319.
|
| |
6
|
GORDON, W. T., AND NEWELL, G.F. Closed queuing systems with exponential servers. Operaoons Res 15 (Apr. 1967), 252-265.
|
| |
7
|
JACKSON, J.R. Jobshop-fike queuing systems. Management Sci. 10 (Oct 1963), 131-142.
|
| |
8
|
LAVENBERO, S. S, AND REISER, M. Stauonary state probabilities of arrival instants for closed queumg network with mulOple types of customers. Res. Pep RC 7592, IBM Thomas J. Watson Res. Ctr., Yorktown Heights, N.Y Apr. 1979. To appear in J. Appl. Prob, (Dec. 1980).
|
| |
9
|
NEtrrs, M. F Probabdity dtstributtons of phase type To appear m Liber Amicorum, Leuven, Belgium.
|
| |
10
|
PITTEL, B. Closed exponential networks of queues with blocking, the Jackson type stationary dtstnbuuon and its asymptotic analysts Res. Rep RC 6174, IBM Thomas J. Watson Res. Ctr, Yorktown Heights, N Y., 1976
|
| |
11
|
RelsvR,M Numerical methods m separable queuing networks. Stu&es m Management Sa 7 (1977), 113- 142
|
| |
12
|
Rtls~R, M. A queuing network analysis of computer ~ommumcation networks with window flow control IEEE Trans. Commun. 27 (Aug. 1979), 1199-1209.
|
| |
13
|
|
| |
14
|
REIS~R, M., AND KOBAYASHI, H Queuing networks with multiple closed chains, theory and computauonal algorithms IBM J Res and Develop 19 (May 1975), 283-294.
|
| |
15
|
SHUM, A.Queuing models for computer systems with general service tune dtstnbuuons Ph D Th, Harvard U, Cambridge, Mass, Dec. 1976
|
CITED BY 151
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Daniel A. Menascé , Daniel Barbará , Ronald Dodge, Preserving QoS of e-commerce sites through self-tuning: a performance model approach, Proceedings of the 3rd ACM conference on Electronic Commerce, p.224-234, October 14-17, 2001, Tampa, Florida, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Raymond M. Bryant , Anthony E. Krzesinski , Peter Teunissen, The MVA Pre-empt resume priority approximation, Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems, p.12-27, August 29-31, 1983, Minneapolis, Minnesota, United States
|
|
|
|
|
|
Charles E. Knadler, Jr. , Ralph M. May, Using simulation to evaluate analytic models of memory queueing, Proceedings of the 24th conference on Winter simulation, p.1242-1248, December 13-16, 1992, Arlington, Virginia, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Rusty O. Baldwin , Nathaniel J. Davis, IV , Scott F. Midkiff , John E. Kobza, Queueing network analysis: concepts, terminology, and methods, Journal of Systems and Software, v.66 n.2, p.99-117, 15 May 2003
|
|
|
|
|
|
|
|
|
|
|
|
Y. H. Lee , P. S. Yu , A. Leff, Robust transaction routing in distributed database systems, Proceedings of the first international symposium on Databases in parallel and distributed systems, p.210-219, December 05-07, 1988, Austin, Texas, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Charles H. Sauer , Edward A. Macnair , James F. Kurose, The research queueing package: past, present, and future, Proceedings of the June 7-10, 1982, national computer conference, June 07-10, 1982, Houston, Texas
|
|
|
Ágnes Bogárdi-Mészöly , Tihamér Levendovszky , András Rövid, A novel algorithm to model the queue limit, Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing, p.81-86, December 15-17, 2008, Tenerife, Canary Islands, Spain
|
|
|
Ágnes Bogárdi-Mészöly , Tihamér Levendovszky , Hassan Charaf , Ágnes Szeghegyi, Convergence and limit of mean-value analysis algorithms, Proceedings of the 12th WSEAS international conference on Computers, p.601-606, July 23-25, 2008, Heraklion, Greece
|
|
|
Ningfang Mi , Giuliano Casale , Ludmila Cherkasova , Evgenia Smirni, Burstiness in multi-tier applications: symptoms, causes, and new models, Proceedings of the 9th ACM/IFIP/USENIX International Conference on Middleware, December 01-05, 2008, Leuven, Belgium
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
G.3