Probability, Markov chains, queues, and simulation: The mathematical basis of performance modeling

Probability, Markov Chains, Queues, and Simulation: The Mathematical Basis of Performance Modeling

Volumn , Issue , 2009, Pages

  Stewart, William J ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84884087337     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Book

References (54)

1. A. Baker. Essentials of Padé Approximants. Academic Press, New York, 1975.
2. F. Baskett, K. M. Chandy, R. R. Muntz, and F. G. Palacios. Open, Closed, and Mixed Networks of Queues with Different Classes of Customers. Journal of the ACM, Vol. 22, No. 2, pp. 248-260, 1975.
3. D. Bini and B. Meini. On Cyclic Reduction Applied to a Class of Toeplitz Matrices Arising in Queueing Problems. Pages 21-38 in W. J. Stewart, editor, Computations with Markov Chains. Kluwer Academic, Boston, Mass. 1995.
4. G. Bolch, S. Greiner, H. de Meer, and K. S. Trivedi. Queueing Networks and Markov Chains. Wiley Interscience, New York, 1998.
5. G. E. P. Box and M. F. Muller. A Note of the Generation of Random Normal Deviates. Annals of Mathematical Statistics, Vol. 29, pp. 610-611, 1958.
6. P. J. Burke. The Output of a Queueing System. Operations Research, Vol. 4, No. 6, pp. 699-704, 1956.
7. J. P. Buzen. Computational Algorithms for Closed Queueing Networks with Exponential Servers. Comm. of the ACM, Vol. 16, No. 9, pp. 527-531, 1973.
8. K. M. Chandy. The Analysis and Solution of General Queueing Networks. Pages 224-228 in Proc. 6th Annual Princeton Conf. on Information Sciences and Systems, Princeton University Press, Princeton, N.J., 1972.
9. K. M. Chandy and C. H. Sauer. Computational Algorithms for Product Form Queueing Networks. Communication of the ACM, Vol. 23, No. 10, pp. 573-583, 1980.
10. J. W. Cohen. The Single Server Queue. Wiley, New York, 1969.
11. A. E. Conway and N. D. Georganas. A New Method for Computing the Normalization Constant for Multiple-Chains Queueing Networks. INFOR, Vol. 24, No. 3, pp. 184-196, 1986.
12. A. E. Conway and N. D. Georganas. Queueing Networks-Exact Computational Algorithms. MIT Press, Cambridge, Mass., 1989.
13. P-J. Courtois. Decomposablity: Queueing and Computer Systems Applications. Academic Press, New York, 1977.
14. T. Dayar. Permuting Markov Chains to Nearly Completely Decomposable Form. Technical Report BU-CEIS-9808, Department of Computer Engineering and Information Science, Bilkent University, Ankara, Turkey, August 1998.
15. W. Feller. An Introduction to Probability Theory and its Applications, Vol. I and II. JohnWiley and Sons, New York, 1968.
16. C. W. Gear. Numerical Initial Value Problems in Ordinary Differential Equations, Prentice-Hall, Englewood Cliffs, N.J., 1971.
17. W. J. Gordon and G. F. Newell. Closed Queueing Networks with Exponential Servers. Operations Research, Vol. 15, No. 2, pp. 254-265, 1967.
18. W. J. Gordon and G. F. Newell. Cyclic Queueing Systems with Restricted Length Queues. Operations Research, Vol. 15, No. 2, pp. 266-277, 1967.
19. D. Gross and C. M. Harris. Fundamentals of Queueing Theory, John Wiley and Sons, New York, 1974.
20. E. Hairer and G. Wanner. Solving Ordinary Differential Equations II: Stiff and Differential- Algebraic Problems, Series in Computational Mathematics. Springer-Verlag, Berlin, 1991.
21. B. R. Haverkort. Performance of Computer Communication Systems, John Wiley and Sons, Chichester, U.K., 1998.
22. J. R. Jackson. Networks of Waiting Lines. Operations Research, Vol. 5, No. 4, pp. 518-521, 1957.
23. J. R. Jackson. Jobshop Like Queueing Systems. Management Science, Vol. 10, No. 1, pp. 131-142, 1963.
24. L. Kleinrock. Queueing Systems, Vol. 1: Theory. John Wiley and Sons, New York, 1975.
25. D. E. Knuth. The Art of Computer Programming, Vol. 2: Seminumerical Algorithms. Third edition, Addison-Wesley, Reading, Mass., 1998.
26. S. S. Lam and Y. I. Lien. A Tree Convolution Algorithm for the Solution of Queueing Networks. Comm. of the ACM, Vol. 26, No. 3, pp. 203-215, 1983.
27. G. Latouche and Y. Ramaswami. A Logarithmic Reduction Algorithm for Quasi Birth and Death Processes. J. Appl. Probab., Vol. 30, pp. 650-674, 1994.
28. S. S. Lavenberg and M. Resier. Stationary State Probabilities at Arrival Instants for Closed Queueing Networks with Multiple Types of Customers. Journal of Applied Probability, Vol. 17, No. 4, pp. 1048-1061, 1980.
29. A. M. Law and W. D. Kelton. Simulation Modeling and Analysis. Third edition, McGraw-Hill, New York, 2000.
30. P. L'Ecuyer. Software for Uniform Random Number Generation: Distinguishing the Good and the Bad. Pages 95-105 in Proceedings of the 2001 Winter Simulation Conference, IEEE Press, 2001.
31. D. H. Lehmer. Mathematical Methods in Large Scale Computing Units, Pages 141-146 in Proceedings of the Second Symposium on Large-Scale Digital Computing Machinery, Harvard University Press, Cambridge, Mass., 1951.
32. R. Marie. Calculating Equilibrium Probabilities for λ(n)/Ck/1/N Queues. ACM Sigmetrics Performance Evaluation Review, Vol. 9, No. 2, pp. 117-125, 1980.
33. M. Matsumoto and T. Nishimura. Mersenne Twister: A 623-Dimensionally Equidistributed Uniform Pseudo-Random Number Generator. ACM Transactions on Modeling and Computer Simulation, Vol. 8, No. 1, pp 3-30, 1998.
34. F. Marsaglia and T. A. Bray. A Convenient Method for Generating Normal Variables. SIAM Review, Vol. 6, No. 3, pp. 260-264, 1964.
35. G. Marsaglia and W. W. Tsang, The Ziggurat Method for Generating Random Variables. Journal of Statistical Software, Vol. 5, No. 8, pp. 17, 2000.
36. B. Meini. New Convergence Results on Functional Techniques for the Numerical Solution of M/G/1 Type Markov Chains. Numer. Math., Vol. 78, pp. 39-58, 1997.
37. C. B. Moler and C. F. Van Loan. Nineteen DubiousWays to Compute the Exponential of a Matrix. SIAM Review, Vol. 20, No. 4, pp. 801-836, October 1978.
38. R. R. Muntz. Poisson Departure Process and Queueing Networks. Pages 435-440 in Proceedings of the 7th Annual Princeton Conference on Information Sciences and Systems, Princeton University Press, Princeton, N.J., 1973.
39. M. F. Neuts. Matrix Geometric Solutions in Stochastic Models-An Algorithmic Approach. Johns Hopkins University Press, Baltimore, MD, 1981.
40. M. F. Neuts. Structured Stochastic Matrices of M/G/1 Type and Their Applications. Marcel Dekker, New York, 1989.
41. T. Osogami and M. Harchol-Balter. Necessary and Sufficient Conditions for Representing General Distributions by Coxians. Carnegie Mellon University Technical Report, CMU-CS-02-178, 2002.
42. B. Philippe and B. Sidje. Transient Solution of Markov Processes by Krylov Subspaces, Technical Report, IRISA-Campus de Beaulieu, Rennes, France, 1993.
43. V. Ramaswami. A Stable Recursion for the Steady State Vector in Markov chains of M/G/1 type. Commun. Statist. Stochastic Models, Vol. 4, pp. 183-188, 1988.
44. V. Ramaswami and M. F. Neuts. Some explicit formulas and computational methods for infinite server queues with phase type arrivals. J. Appl. Probab., Vol. 17, pp. 498-514, 1980.
45. V. I. Romanovsky. Discrete Markov Chains, Wolters-Noordhoff, Groningen, The Netherlands, 1970.
46. S. M. Ross. Simulation. Second edition, Academic, Press, New York, 1997.
47. Y. Saad. Iterative Methods for Sparse Linear Systems. Second edition, SIAM Publications, Philadelphia, 2003.
48. E. B. Saff. On the Degree of the Best Rational Approximation to the Exponential Function. Journal of Approximation Theory, Vol. 9, pp. 97-101, 1973.
49. K. C. Sevcik and I. Mitrani. The Distribution of Queueing Network States at Input and Output Instants. Journal of the ACM, Vol. 28, No. 2, pp. 358-371, 1981.
50. W. J. Stewart. Introduction to the Numerical Solution of Markov Chains. Princeton University Press, Princeton, N.J., 1994.
51. R. J. Tarjan. Depth First Search and Linear Graph Algorithms. SIAM Journal of Computing, Vol. 1, No. 2, pp. 146-160, 1972.
52. J. W. Tukey. Bias and Confidence in not quite Large Samples. Annals of Mathematical Statistics, Vol. 29, page 614, 1958.
53. R. S. Varga. Matrix Iterative Analysis. Prentice-Hall, Englewood Cliffs, N.J., 1962.
54. R. C. Ward. Numerical Computation of the Matrix Exponential with Accuracy Estimate, SIAM Journal on Numerical Analysis, Vol. 14, No. 4, pp. 600-610, 1977.