We use simulation to both develop and test approximation for mulas for the operating charactertistics of a queue that occurs in queuing network models. In this context, the main simula tion issues are design of simulation experiments and evaluation of the difference between approximations and simulation esti mates. The simulation experiments described here have specific goals, use analytic results to reduce the number of factors, and are performed sequentially with initial experiments generating questions to address in later experiments. The difference between simulation estimates and approximations are evaluated by two summary measures: average absolute percentage error and a measure of simulation variability. In addition, another measure is examined: percent of cases where the approximation falls out side a 95% confidence interval computed from simulation esti mates. While this measure is commonly used by others, especially in graphs, work here suggests it is inappropriate.
Albin, S.L. 'Approximating Queues with Superposition Arrival Processes." Doctoral dissertation, Department of Operations Research, Columbia University, New York, New York ( 1981).
2.
Albin, S.L. "On Poisson Approximations for Superposition Arrival Processes in Queues :' Management Science28 (1982), 126-137.
3.
Albin, S.L.'Approximating a Point Process by a Renewal Process, II: Superposition Arrival Processes to Queues." Operations Research (to be published in 1984).
4.
Albin, S.L. "Delays for Customers from Different Arrival Streams to a Queue." Working Paper 84-107, Department of Industrial Engineering, Rutgers University, New Jersey (1984).
5.
Allen, A. "Computer PerformancePrediction by Analytical Queueing Models: Cost Effective Techniques." IEEE Computer Magazine13 (1980), 13-24.
6.
Baskett, F.; Chandy, K.M.; Muntz, R.R.; and Palacios, F. "Open, Closed and Mixed Networks of Queues with Various Classes of Customers." Journal of the ACM22 (1975), 248-260.
7.
Biles, W. "Experimental Design in Computer Simulation." Proceedings of the 1979 Winter Simulation Conference. Institute of Electrical and Electronics Engineers, New York ( 1979), 2-9.
8.
Boelhouwer, L.J. "Deriving Empirical Equations from Simulation Results." Proceedings of the 1980 Winter Simulation Conference, Part I. Institute of Electrical and Electronics Engineers , New York (1980), 293-297.
9.
Buzen, J. and Denning, P. "Measuring and Calculating Queue Length Distributions." IEEE Computer Magazine13 (1980 ), 33-46.
10.
Chandy, K.M. : Herzog, U.; and Woo, L. "Parametric Analysis of Queuing Networks." IBM journal of Research and Development19 (1975), 36-42.
11.
Chandy, K.M. ; Howard, J.H.; and Towsley, D.F. "Product Form and Local Balance in Queuing Networks." Journal ofthe ACM24 (1977), 250-263.
12.
Chandy, K.M. and Sauer, C.H. 'Approximate Methods for Analyzing Queuing Network Models of Computer Systems." Computing Surveys10 (1978), 281-317.
13.
Çinlar, E. "Superposition of Point Processes." Stochastic Point Processes: Statistical Analysis, Theory, and Applications (P. A. W. Lewis, ed.), John Wiley and Sons , New York, New York (1972), 549-606.
14.
Disney, R.L.Queueing Networks and Applications. The Johns Hopkins University Lectures (to be published by the Johns Hopkins University Press), Baltimore, Maryland.
15.
Gelenbe, E. and Mitrani, I.Analysis and Synthesis of Computer Systems. Academic Press , New York (1980).
16.
Gordon, W.J. and Newell, G.F. "Closed Queueing Systems with Exponential Servers." Operations Research15 (1967), 254-265.
17.
Hunter, J.S. and Naylor, T.H. "Experimental Designs for Computer Simulation Experiments." Management Science16 (1970), 422-435.
18.
Ignall, E. "On Experimental Designs for Computer Simulation Models." Management Science18 (1972), 384-388.
19.
Ignall, E.J. ; Kolesar, P.; and Walker, W.W. "Using Simulation To Develop and Validate Analytic Models: Some Case Studies." Operations Research26 (1978), 237-253.
20.
Jackson, J.R. "Networks of Waiting Lines." Operations Research5 (1957), 518-521.
21.
Kelly, F.P.Reversibility and Stochastic Networks. John Wiley and Sons , New York (1979).
22.
Kleinrock, L.Queueing Systems, Vol. 1: Theory. John Wiley and Sons, New York (1975).
23.
Kleinrock, L.Queueing Systems, Vol. 2: Computer Applications. John Wiley and Sons, New York (1976 ).
24.
Kraemer, W. and Langenbach-Belz, M. 'Approximate Formulae for the Delay in the Queueing System GI/G/1." Congress Book, the 8th International Teletraffic Congress 235. Melbourne (1976), 1-7.
25.
Kuehn, P.J. 'Approximate Analysis of General Queueing Networks by Decomposition." IEEE Transactions on Communications27 (1979), 113-126.
26.
Sauer, C.H. and Chandy, K.M. 'Approximate Analysis of Central Server Models." IBM journal of Research and Development19 (1975), 301-313.
27.
Sauer, C. and Chandy, K. 'Approximate Solution of Queueing Models." IEEE Computer Magazine13 (1980), 25-32.
28.
Sauer, C.H. and Chandy, K.M.Computer Systems Performance Modeling. Prentice-Hall , Englewood Cliffs, New Jersey ( 1981).
29.
Schwartz, M.Computer-Communications Network Design and Analysis. Prentice-Hall , Englewood Cliffs, New Jersey ( 1977).
30.
Sevcik, K.C. ; Levy, A.I.; Tripathi, S.K.; and Zahorjan , J.L. "Improving Approximations of Aggregated Queueing Network Subsystems ." Computer Performance (K. M. Chandy and M. Reiser, eds.). North-Holland, Amsterdam (1977), 1-22.
31.
Shanthikumar, J.G. and Buzacott, J.A. "Open Queueing Network Models of Dynamic Job Shops." International journal of Production Research19 (1981), 255-266.
32.
Shannon, R. "Design and Analysis of Simulation Experiments." Proceedings of the 1978 Winter Simulation Conference (1978), 55-61.
33.
Shruben, L.W. and Margolin, B.H. "Pseudorandom Number Assignment in Statistically Designed Simulation and Distribution Sampling Experiments ." journal of the American Statistical Association73 (1978), 504-525.
34.
Smith, D.E. and Mauro, C.A. "Factor Screening in Computer Simulation ." Simulation38:2 (1982), 49-54.
35.
Suri, R. "Why Simple Queueing Network Models Give Good Predictions for Practical Systems." Proceedings of the IEEE International Conference on Cybernetics and Society (1980), 184-190.
36.
Taaffe, M.R. and Schmeiser, B.Simulation of Nonstationary Queueing Models Using Approximations as Control Variates. Department of Industrial Engineering, Purdue University, West Lafayette, Indiana ( 1984).
37.
Walker, W. E.; Chaiken, J. M.: and Ignall, E. J. (eds.) Fire Department Deployment Analysis. A Public Policy Analysis Case Study. North-Holland, New York (1979).
38.
Whitt, W. "Approximating a Point Process by a Renewal Process: Two Basic Methods ." Operations Research30 (1982), 125-147.
39.
Whitt, W. "The Queueing Network Analyzer." Bell System Technicaljournal62 (1983), 2779-2815.
40.
Whitt, W. "Performance of the Queueing Network Analyzer." Bell System. Technical Journal62 (1983 ), 2817-2843.
