A graph-theoretic approach to queueing analysis part I: Theory

Communications in Statistics. Part C: Stochastic Models

Volumn 15, Issue 5, 1999, Pages 791-824

  Tang, Chi Nang ^a   Yeung, Raymond W ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Fast algorithms; Finite state Markov chain; Gaussian elimination; Graph elimination

Indexed keywords

EID: 33749465356     PISSN: 08820287     EISSN: None     Source Type: Journal    
DOI: 10.1080/15326349908807564     Document Type: Article

References (25)

1. A. Agrawal, P. Klein and R. Ravi, "Cutting down on fill using nested dissection: provably good elimination orderings," Graph Theory and Sparse Matrix Computation, Springer-Verlag, 1993, pp. 31-56.
2. C. Berge, The Theory of Graphs and its Applications, John Wiley, New York, 1962.
3. R. Lal and U. N. Bhat, "Reduced systems in Markov chains and their applications in queueing theory," Queueing Syst., Vol. 2, pp. 147-172, 1987.
4. J. Walrand, An Introduction to Queueing Networks, Prentice-Hall, 1988.
5. J.G. Kemeny and J.L. Snell, Finite Markov chains, Springer Verlay, New York, 1976.
6. I. Duff and J. K. Reid, Direct Methods for Sparse Matrices, Oxford University Press, 1986.
7. A. George, "Nested dissection of a regular finite element mesh," SIAM J. Numer. Anal., Vol. 10, No. 2, Apr 1973, pp. 345-363.
8. A. George and J. W. Liu, Computer solution of large sparse positive definite systems, Prentice-Hall Inc., 1981.
9. A. George and J. W. Liu, "The evolution of the minimum degree ordering algorithm," SIAM Review, Vol. 31, No. 1, Mar 1989, pp. 1-19.
10. G.H. Golub and C.F. Van Loan, Matrix Computations, Academic Press, New York, 1978.
11. L. Haskins and D. J. Rose, "Toward characterization of perfect elimination digraphs," SIAM J. Comput., Vol. 2, No. 4, Dec 1973, pp. 217-224.
12. A. Jennings and J. J. Mckeown, Matrix Computation, John Wiley &: Sons, 1992.
13. U. R. Krieger, B. M. Clostermann and M. Sczittnick, "Modelling and Analysis of Communication systems Based on Computational Methods for Markov Chains," IEEE Selected Areas in Commu., Vol. 8, No. 9, Dec 1990, pp. 1630-1648.
14. R. J. Lipton, D. J. Rose and R. E. Tarjan, "Generalized nested dissection," SIAM J. Numer. Anal., Vol. 16, No. 2, Apr 1979, pp. 346-358.
15. J. W. Liu, "The multifrontal method for sparse matrix solution: Theory and Practice," SIAM Review, Vol. 34, No. 1, Mar 1992, pp. 82-109.
16. W. H. Liu and A. H. Sherman, "Comparative analysis of the Cuthill-Mckee and the reverse Cuthill-Mckee ordering algorithms for sparse matrices," SIAM J. Numer. Anal., Vol. 13, No. 2, Apr 1976, pp. 198-213.
17. S. Parter, "The use of linear graphs in Gaussian elimination," SIAM Review, Vol. 3, No. 2, Apr 1961, pp. 119-130.
18. D. J. Rose, "A graph-theoretical study of the numerical solution of sparse positive definite systems of linear equations," Graph Theory and Computing, R.C. Read, ed., Academic Press (1972), pp. 183-217.
19. D. J. Rose and R. E. Tarjan, "Algorithmic Aspects of Vertex Elimination on Directed Graphs," SIAM J. Appl. Math., 34, 1978, pp. 176-197.
20. D. J. Rose, R. E. Tarjan and G. S. Lueker, "Algorithmic Aspects of Vertex Elimination on Graphs," SIAM J. Comput., Vol. 5, No. 2, Jun 1976, pp. 266-283.
21. C. N. Tang, "Graph-Theoretic Approach in Gaussian Elimination and Queueing Analysis," Master Thesis, Department of Information Engineering, The Chinese University of Hong Kong, Jun 1995.
22. C. N. Tang and R. W. Yeung, "A Graph-Theoretic Approach to Queueing Analysis - Part II: Applications," same issue.
23. R. E. Tarjan, "Graph theory and Gaussian elimination," Sparse matrix computations, Academic Press, 1976, pp. 3-22.
24. M. Yannakakis, "Computing the minimum fill-in is NP-Complete," SIAM J. Alg. Disc. Meth., Vol. 2, No. 1, Mar 1981, pp. 77-79.
25. J. Ye and S. Q. Li, "Analysis of Multimedia Traffic Queues with Finite Buffer and Overload Control - Part I : Algorithm," Proc. of IEEE INFOCOM '91, Bal Harbor, Floria, 1991, pp. 1464-1474.