Exploiting the toeplitz structure in certain queueing problems

Calcolo

Volumn 33, Issue 3, 1996, Pages 289-305

  Bini, Dario Andrea ^b   Meini, Beatrice ^a  

^a UNIVERSITY OF PISA   (Italy)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIALS; QUEUEING THEORY;

ALGORITHM FOR SOLVING; ALGORITHMIC TOOLS; DISPLACEMENT RANKS; MATRIX ANALYSIS; MATRIX MODEL; QUEUEING PROBLEMS; SCHUR COMPLEMENT; TOEPLITZ; TOEPLITZ MATRICES; TOEPLITZ STRUCTURES;

MATRIX ALGEBRA;

EID: 52449144353     PISSN: 00080624     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (33)

1. A. S. ALFA, A discrete MAP/PH/1 queue with vacations and exhaustive time-limited service. Oper. Research Letters, 18, (1995) 31-40.
2. G. ANASTASI, L. LENZINI, AND B. MEINI, Performance evaluation of a worst case model of the Metaring MAC Protocol with global fairness. Performance Evaluation, 1997. To appear.
3. D. BINI, On a class of matrices related to Toeplitz matrices. Technical Report 83-5, SUNY University, Albany, New York, 1983.
4. D. BINI AND B. MEINI, On cyclic reduction applied to a class of Toeplitz-like matrices arising in queueing problems. In W. J. Stewart, editor, Computations with Markov Chains, pages 21-38. Kluwer Academic Publisher, 1996.
5. D. BINI AND B. MEINI, On the solution of a nonlinear matrix equation arising in queueing problems. SIAM J. Matrix Anal. Appl., 17, (1996) 906-926.
6. D. BINI AND B. MEINI, Improved cyclic reduction for solving queueing problems. Numerical Algorithms, 1997. To appear.
7. D. BINI AND B. MEINI, Inverting block Toeplitz matrices in block Hessenberg form by means of displacement operators: application to queueing problems. Submitted for publication, 1997.
8. D. BINI AND V. PAN, Improved parallel computations with Toeplitz-like and Hankel matrices. Linear Algebra Appl., 188-189, (1993) 3-29.
9. D. BINI AND V. PAN, Matrix and Polynomial Computations, Vol. 1: Fundamental Algorithms. Birkhäuser, Boston, 1994.
10. B. L. BUZBEE, G. H. GOLUB, AND C. W. NIELSON, On direct methods for solving Poisson's equation. SIAM J. Num. Anal., 7, (1970) 627-656.
11. J. N. DAIGLE AND D. M. LUCANTONI, Queueing systems having phase-dependent arrival and service rates. In W. J. Stewart, editor, Numerical solution of Markov Chains, pages 161-202. Marcel Dekker, New York, 1991.
12. R. E. FUNDERLIC AND R. J. PLEMMONS, LU decomposition of M-matrices by elimination without pivoting. Linear Algebra Appl., 41, (1981) 99-110.
13. R. E. FUNDERLIC AND R. J. PLEMMONS, A combined direct-iterative method for certain M-matrix linear systems. SIAM J. Alg. Discr. Meth., 5, (1984) 33-42.
14. H. R. GAIL, S. L. HANTLER, AND B. A. TAYLOR, Non-skip-free M/G/1 and G/M/1 type Markov chains. Adv. Appl. Prob., 1997. To appear.
15. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations. The Johns Hopkins University Press, Baltimore, 1989.
16. W. K. GRASSMAN, M. I. TAKSAR, AND D. P. HEYMAN, Regenerative analysis and steady state distribution for Markov chains. Oper. Res., 33, (1985) 1107-1116.
17. L. GUN, Experimental results on matrix-analytical solution techniques. extensions and comparisons. Commun. Statist. Stochastic Models, 5, (1989) 669-682.
18. T. KAILATH, S. KUNG, AND M. MORF, Displacement rank of a matrix. Bulletin of the American Mathematical Society, 1, (1979) 769-773. 1979.
19. T. KAILATH AND A.H. SAYED, Displacement structure: theory and applications. SIAM Review, 37, (1995) 297-386.
20. U. R. KRIEGER, On a two-level multigrid solution method for finite Markov chains. Linear Algebra Appl., 223-224, (1995) 415-438.
21. G. LATOUCHE, Algorithms for infinite Markov chains with repeating columns. In C.D. Meyer and R.J. Plemmons, editors, Linear Algebra, Queueing Models and Markov Chains, pages 231-265. Springer-Verlag, New York, 1993.
22. G. LATOUCHE, Newton's iteration for non-linear equations in Markov chains. IMA J. of Numerical Analysis, 14, (1994) 583-598.
23. G. LATOUCHE AND V. RAMASWAMI, A logarithmic reduction algorithm for Quasi-Birth-Death processes. J. Appl. Probability, 30, (1993) 650-674.
24. G. LATOUCHE AND G. W. STEWART, Numerical methods for M/G/1 type queues. In W. J. Stewart, editor, Computations with Markov Chains, pages 571-581. Kluwer Academic Publishers, 1996.
25. L. LENZINI, B. MEINI, AND E. MINGOZZI, An approximate PRMA++ performance and stability analysis. Submitted for publication.
26. D. M. LUCANTONI AND M. F. NEUTS, Some steady state distributions for the MAP/SM/1 queue. Commun. Statist. Stochastic Models, 10, (1994) 575-598.
27. B. MEINI, An improved FFT-based version of Ramaswami's formula. Commun. Statist. Stochastic Models, 13, (1997).
28. B. MEINI, New convergence results on functional iteration techniques for the numerical solution of M/G/1 type Markov chains. Numer. Math., 1997. To appear.
29. M. F. NEUTS, Matrix-Geometric Solutions in Stochastic Models. Johns Hopkins University Press, Baltimore, 1981.
30. M. F. NEUTS, Structured Stochastic Matrices of M/G/1 Type and Their Applications. Marcel Dekk., New York, 1989.
31. V. RAMASWAMI, Nonlinear matrix equations in applied probability - Solution techniques and open problems. SIAM Review, 30, (1988) 256-263.
32. V. RAMASWAMI, A stable recursion for the steady state vector in Markov chains of M/G/1 type. Commun. Statist. Stochastic Models, 4, (1988) 183-188.
33. G. W. STEWART, On the solution of block Hessenberg systems. Numer. Lin. Algebra with Appl., 2, (1995) 287-296.