Cited By
View all- Wang WCasale GKattepur ANambiar M(2018)QMLEACM Transactions on Modeling and Performance Evaluation of Computing Systems10.1145/32331803:4(1-28)Online publication date: 22-Aug-2018
Derivation of Confidence Intervals for Work Rate Estimators in a Closed Queuing Network
Abstract
Closed queuing networks arise naturally as models of multiprogrammed computer systems and subsystems. Techniques for the efficient simulation of such models can be obtained from analytical results on the stochastic structure of the queuing networks. In this paper, confidence intervals are derived for a class of new work rate estimators in a closed queuing network. Numerical results are given which demonstrate that a substantial reduction in the length of confidence intervals is obtainable by use of the proposed estimators.
References
[1]
D. P.u Gaver, Probability models for multiprogramming computer systems, J. Assoc. Comput. Mach., 14 (1967), 423–438
[2]
G. S. Shedler, A cyclic-queue model of a paging machine, Res. Rep., RC-2814, IBM, Yorktown Heights, N.Y., 1970
[3]
P. A. W. Lewis, G. S. Shedler, A cyclic-queue model of system overhead in multiprogrammed computer systems, J. Assoc. Comput. Mach., 18 (1971), 199–220
[4]
J. P. Buzen, Ph.D. Thesis, Queueing network models of multiprogramming, Div. of Engineering and Applied Physics, Harvard University, Cambridge, Mass., 1971
[5]
Stephen S. Lavenberg, Queueing analysis of a multiprogrammed computer system having a multilevel storage hierarchy, SIAM J. Comput., 2 (1973), 232–252
[6]
P. A. W. Lewis, G. S. Shedler, Empirically derived micromodels of sequences of page exceptions, IBM J. Res. Develop., 17 (1973), 86–100
[7]
G. S. Shedler, S. C. Yang, Simulation of a model of paging system performance, IBM Systems J., 10 (1971), 113–128
[8]
D. P. Gaver, G. S. Shedler, Control variable methods in the simulation of a model of a multiprogrammed computer system, Naval Res. Logist. Quart., 18 (1971), 435–450
[9]
D. G. Polyak, Precision of statistical simulation of queueing systems, Engrg. Cybernetics, 1 (1970), 72–80
[10]
Walter L. Smith, Renewal theory and its ramifications, J. Roy. Statist. Soc. Ser. B, 20 (1958), 243–302
[11]
A. Chang, S. S. Lavenberg, Work rates in closed queuing networks with general independent servers, Operations Res., 22 (1974), 838–847
[12]
M. A. AND Iglehart, D. L. Crane, Statistical analysis of discrete even simulations, Proc. 1974 Winter Simulation Conf., Washington, D.C., 513–521
[13]
Richard E. Barlow, Frank Proschan, Mathematical theory of reliability, With contributions by Larry C. Hunter. The SIAM Series in Applied Mathematics, John Wiley & Sons Inc., New York, 1965xiii+256 pp. (1 insert)
[14]
N. L. Johnson, A proof of Wald's theorem on cumulative sums, Ann. Math. Statist., 30 (1959), 1245–1247
[15]
W. L. Smith, Regenerative stochastic processes, Proc. Roy. Soc. London. Ser. A., 232 (1955), 6–31
Index Terms
- Derivation of Confidence Intervals for Work Rate Estimators in a Closed Queuing Network
Index terms have been assigned to the content through auto-classification.
Recommendations
Analysis of Networks of the Resource Queuing Systems
Consideration was given to the model of a queuing network with resource queuing systems--the multi-server systems with losses where servicing of the accepted customer occupies random volumes of resources with the given distribution function depending on ...
Queue decomposition & finite closed queueing network models
Closed, finite queueing networks are applicable to many different manufacturing and service system settings. The incorporation of material handling and transportation networks in finite buffer closed queueing networks is studied. A novel queue ...
Approximate transient analysis of queuing networks by decomposition based on time-inhomogeneous Markov arrival processes
VALUETOOLS '14: Proceedings of the 8th International Conference on Performance Evaluation Methodologies and ToolsWe address the transient analysis of networks of queues with exponential service times. Such networks can easily have such a huge state space that their exact transient analysis is unfeasible.
In this paper we propose an approximate transient analysis ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 1975 Society for Industrial and Applied Mathematics.
Publisher
Society for Industrial and Applied Mathematics
United States
Publication History
Published: 01 June 1975
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 09 Feb 2025
Other Metrics
Citations
Cited By
View all- Wang WCasale GKattepur ANambiar M(2018)QMLEACM Transactions on Modeling and Performance Evaluation of Computing Systems10.1145/32331803:4(1-28)Online publication date: 22-Aug-2018