Levantamiento de la información de campo

1] N. R. Adam and A. Dogramaci, eds., Current Issues in Computer Simulation, Academic Press, New York, 1979.

2] J. S. Annino and E. C. Russell, \The Ten Most Frequent Causes of Simulation Analysis Failure," CACI Report 7, 1979.

3] G. Birtwistle, O. Dahl, B. Myhrhaug, and K. Nygaard, SIMULA Begin, Auerbach, Philadelphia, 1973.

4] L. Blum, M. Blum, and M. Shub, \A Simple Pseudo-Random Number Generator," SIAM J. Comput. Vol. 15, No. 2, May 1986, pp. 364-383. 5] P. A. Bobillier, B. C. Kahan, and A. R. Probst, Simulation with GPSS and

GPSS V, Prentice-Hall, Englewood-Clis, NJ, 1976.

6] G. E. P. Box and M. E. Muller, \A Note on the Generation of Random Normal Deviates," Ann. Math. Stat., Vol. 29, 1958, pp. 610-611.

7] P. Bratley, B. L. Fox, and L. E. Schrage, A Guide to Simulation, Springer-Verlag, New York, 1986.

8] H. S. Bright and R. L. Enison, \Quasi-Random Number Sequences from a Long-Period TLP Generator with Remarks on Application to Cryptography," ACM Comput. Surveys, Vol. 11, 1979, pp. 357-370.

9] R. Brown, \Calendar Queues: A Fast O(1) Priority Queue Implementation for the Simulation Event Set Problem," Comm. of ACM, Vol. 31, No. 10, October 1988, pp. 1220-1227.

10] W. G. Bulgren, Discrete System Simulation, Prentice-Hall, Englewood Clis, NJ, 1982.

11] C.A.C.I., SIMSCRIPT II.5 Programming Language, C. A. C. I., Los Angeles, CA, 1983.

12] R. R. Conveyou and R. D. McPherson, \Fourier Analysis of Uniform Random Number Generators," Journal of ACM, Vol 14, 1967, pp. 100-119.

13] M. A. Crane and A. J. Lemoine, An Introduction to the Regenerative Method for Simulation Analysis, Springer-Verlag, New York, 1977.

14] O-J. Dahl, B. Myhrhaug, and K. Nygaard, Common Base Language, Norwegian Computing Center, Oslo, Norway, 1982.

15] R. L. Edgeman, \Random Number Generators and the Minimal Standard," Communications of ACM, Vol. 32, No. 8, August 1989, pp. 1020-21.

16] G. S. Fishman and L. R. Moore, \An Exhaustive Analysis of Multiplicative Congruential Random Number Generators with Modulus 231-1," SIAM J. on

Sci. Statist. Comput., Vol 7, 1986, pp. 24-45.

17] B. L. Fox, \Generation of Random Samples from the Beta and F distributions," Technometrics, Vol. 5, 1963, pp. 269-270.

18] W. R. Franta and K. Maly, \An Ecient Data Structure for the Simulation Event Set," Communications of ACM, Vol. 20, No. 8, August 1977, pp. 596-602. 19] W. R. Franta, The Process View of Simulation, North-Holland, New York, 1977. 20] A. M. Frieze, R. Kannan, and J. C. Lagarias, \Linear Congruential Generators

Do Not Produce Random Sequences," Proc. 25th Symp. on Foundations of Computer Sci., Boca Raton, FL, October 24-26, 1984, pp. 480-484.

21] M. Fushimi and S. Tezuka, \The k-Distribution of Generalized Feedback Shift

Register Pseudorandom Numbers," Communications of ACM, Vol. 26, No. 7, July 1983, pp. 516-523.

22] M. Fushimi, \Designing a Uniform Random Number Generator Whose

Subsequences are k-Distributed," SIAM J. Comput., Vol. 17, No. 1, February

1988, pp. 89-99.

23] S. W. Golomb, Shift Register Sequences, Aegean Park Press, Laguna Hills, CA, 1982.

24] M. Greenberger, \An A Priori Determination of Serial Correlation in Computer Generated Random Numbers," Math. Comp., Vol. 15, 1961, pp. 383-389.

25] C. Hastings, Jr. Approximations for Digital Computers, Princeton University Press, Princeton, NJ, 1955.

26] N. A. J. Hastings and J. B. Peacock, Statistical Distributions, Wiley, New York, 1975.

27] IBM, System/360 Scientic Subroutine Package, Version III, Programmer's Manual, IBM, White Plains, NY, 1968, p. 77.

28] IMSL Library, Vol. I, 8th Edn., Distributed by International Mathematical and Statistical Libraries, Inc., Houston, TX.

29] R. K. Jain, \A Timeout-Based Congestion Control Scheme for Window Flow-Controlled Networks," IEEE Journal on Selected Areas in

Communications, Vol. SAC-4, No. 7, Oct. 1986, pp. 1162-1167. 30] M. D. Johnk, \Erzeugung von Betaverteilten und Gammaverteilten

Zufallszahlen," Metrika, Vol. 8, 1964, pp. 5-15.

31] H. Katzan, Jr., APL User's Guide, Van Nostrand Reinhold, New York, 1971. 32] P. Klahr and W. S. Fought, \Knowledge-Based Simulation," Proc. First Conf.

AAAI, Stanford, CA, 1980, pp. 181-183.

33] D. E. Knuth, The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, Addison-Wesley, Reading, MA, 1981.

34] W. Kreutzer, System Simulation Programming Styles and Languages, Addison-Wesley, Reading, MA, 1986.

35] P. L'Ecuyer, \Ecient and Portable Combined Random Number Generators," Communications of ACM, Vol. 31, No. 6, June 1988, pp. 742-774.

36] E. L. Lamie, Pascal Programming, Wiley, New York, 1987, p. 150.

37] S. S. Lavenberg, ed., Computer Performance Modeling Handbook, Academic Press, New York, 1983.

38] A. M. Law and W. D. Kelton, Simulation Modeling and Analysis, McGraw-Hill, New York, 1982.

39] A. M. Law, \Statistical Analysis of Simulation Output," Operations Research Vol.19, No. 6, pp. 983-1029, Nov.-Dec., 1983.

40] D. H. Lehmer, \Mathematical Methods in Large-Scale Computing Units," Ann. Comput. Lab., Harvard Univ., Vol. 26, 1951, pp. 141-146.

41] P. A. Lewis, A. S. Goodman, and J. M. Miller, \A Pseudo-Random Number Generator for the System/360," IBM Systems Journal, Vol. 8, No. 2, 1969, pp. 136-146.

42] T. G. Lewis and W. H. Payne, \Generalized Feedback Shift Register

Pseudo-Random Number Algorithm," Journal of ACM, Vol. 20, No. 3, July 1973, pp. 456-468.

43] H. M. Markowitz, B. Hausner, and H. W. Karr, SIMSCRIPT: A Simulation Programming Language, Prentice-Hall, Englewood Clis, NJ, 1963.

44] G. Marsaglia and T. A. Bray, \A Conveniently Method for Generating Normal Variables," SIAM Rev., Vol. 6, 1964, pp. 260-264.

45] G. Marsaglia, \Random Numbers Fall Mainly in the Planes," Proc. Nat. Acad. Sci., Vol. 60, No. 5, September 1968, pp. 25-28.

46] G. Marsaglia, \Random Number Generation," in A. Ralston and E. D. Reilly, Jr., Eds, Encyclopedia of Computer Science and Engineering, Van Nostrand Reinhold, New York, 1983, pp. 1260-1264.

47] W. M. McCormack and R. G. Sargent, \Comparison of Future Event Set

Algorithms for Simulations of Closed Queueing Systems," in N. R. Adam and A. Dogramaci (Eds), Current Issues in Computer Simulation, Academic Press, New York, 1979, pp. 71-82.

48] J. Misra, \Distributed Discrete-Event Simulation," ACM Computing Surveys, Vol. 18, No. 1, March 1986, pp. 39-66.

49] I. Mitrani, Simulation Techniques for Discrete-Event Systems, Cambridge U. Press, London, 1982.

50] T. M. O'Donovan, GPSS Simulation Made Simple, Wiley, Chichester, U.K., 1980.

51] S. K. Park and K. W. Miller, \Random Number Generators: Good Ones Are Hard to Find," Communications of ACM, Vol. 31, No. 10, October 1988, pp. 1192-1201.

52] S. Pasupathy, \Glories of Gaussianity," IEEE Communications Magazine, Vol. 27, No. 8, August 1989, pp. 37-38.

53] Prime Computer, Subroutines Reference Guide, 3rd Ed, 1984, p. 12.45. 54] A. Pritsker and R. E. Young, Simulation with GASP - PL/I: A PL/I Based

Continuous/Discrete Simulation Language, Wiley-Interscience, New York, 1975. c 1994 Raj Jain 29.60

55] Y. V. Ramana Reddy, M. S. Fox, N. Husain, and M. McRoberts, \The

Knowledge-Based Simulation System," IEEE Software, March 1986, pp. 26-37. 56] C. M. Reeves, \Complexity Analyses of Event Set Algorithms," The Computer

Journal, Vol. 27, No. 1, 1984, pp. 72-79.

57] R. Y. Rubinstein Monte Carlo Optimization, Simulation and Sensitivity of Queueing Networks, Wiley, New York, 1986.

58] M. Santha and U. V. Vazirani, \Generating Quasi-Random Sequences from Slightly Random Sources," Proc. 25th Symp. on Foundations of Computer Sci., Boca Raton, FL, October 24-26, 1984, pp. 434-440.

59] L. Schrage, \A More Portable FORTRAN Random Number Generator," ACM Transactions on Mathematical Software, Vol. 5, No. 2, June 1979, pp. 132-138. 60] S. W. Sherman and J. C. Browne, \Trace-Driven Modeling: Review and

Overview," Proc. Symp. on the Simulation of Computer Systems, pp. 201-207, June, 1973.

61] R. C. Tausworthe, \Random Numbers Generated by Linear Recurrence Mod Two," Math. Comput. Vol. 19, 1965, pp. 201-209.

62] S. Tezuka, \Walsh-Spectral Test for GFSR Pseudorandom Numbers," Communications of ACM, Vol. 30, No. 8, August 1987, pp. 731-735.

63] J. P. R. Tootill, W. D. Robinson, and A. G. Adams, \The Runs Up and Down Performance of Tausworthe Pseudo-Random Number Generators," Journal of ACM, Vol. 18, 1971, pp. 381-399.

64] J. P. R. Tootill, W. D. Robinson, and D. J. Eagle, \An Asymptotically Random Tausworthe Sequence," Journal of ACM, Vol. 20, No. 3, July 1973, pp. 469-481. 65] B. Unger and R. Fujimoto, Eds., Distributed Simulation, 1989, The Society for

Computer Simulation, San Diego, CA, 1989, 204 pp.

66] J. G. Vaucher and P. Duval, \A Comparison of Simulation Event List

Algorithms," Communications of ACM, Vol. 18, No. 4, April 1975, pp. 223-230. 67] U. V. Vazirani and V. V. Vazirani, \Ecient and Secure Pseudo-Random

Number Generation," Proc. 25th Symp. on Foundations of Computer Sci., Boca Raton, FL, October 24-26, 1984, pp. 458-463.

68] D. B. Wagner and E. D. Lazowska, \Parallel Simulation of Queueing Networks: Limitations and Potentials," Proc. SIGMETRICS'89, May 23-26, 1989,

Berkeley, CA. (Also published as Performance Evaluation Review, Vol. 17, No. 1, May 1989), pp. 146-155.

69] W. Webster, Ed., Simulation and AI, 1989, Society for Computer Simulations, San Diego, CA, 1989, 139 pp.

70] F. P. Wyman, \Improved Event Scanning Mechanisms for Discrete-Event Simulation," Communications of ACM, Vol. 18, No. 6, June 1975, pp. 350-353.