A BMAP |G| 1-analysis based on convolution calculus

Journal of Mathematical Sciences

Volumn 92, Issue 4, 1998, Pages 3990-4002

  Baum, D ^a,b  

^a University of Trier ^*

^b UNIVERSITY OF TRIER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 54749150263     PISSN: 10723374     EISSN: 15738795     Source Type: Journal    
DOI: 10.1007/BF02432332     Document Type: Article

References (21)

1. D. Baum, BMAP |G| 1-Queucs: Properties of the Fundamental-Period-Matrix G, Technical Report. No. 96-10 in Mathematics and Computer Science Series, University of Trier (1996).
2. D. Baum, Convolution Algorithms for BMAP |G| 1-Queues, Technical Report, No. 96-22 in Mathematics and Computer Science Series, University of Trier (1996).
3. D. Baum, Ein Faltungskalkül für Matnzenfolgen und verallgemeinerte Poisson-Gruppenprozesse, Technical Report No. 96-36 in Mathematics and Computer Science Series, University of Trier (1996).
4. R. Bellmann, Introduction to Matrix Analysis, SIAM, Philadelphia (1995).
5. D. Bini and B. Meini, "On cyclic reduction applied to a class of Toeplitz-like matrices arising in queueing problems," in: Computation with Markov Chains, Kluwer Academic Publishers (1996), pp. 21-38.
6. E. Çinlar, "Markov additive processes. I. II," Z. Wahrscheinlichkeitstheorie Verw. Geb., 24, 85-93, 95-121 (1972).
7. E. Çinlar. Introduction to Stochastic Processes, Prentice Hall, Englewood Cliffs. New Jersey (1975).
8. A. Graham, Kronecker Products and Matrix Calculus with Applications, Wiley, New York (1981).
9. G. Latouche and V. Ramaswami, "A logarithmic reduction algorithm for quasi-birth-death-processes," J. Appl. Probab., 30, 650-674 (1993).
10. D. M. Lucantoni, "New results on the single server queue with a batch markovian arrival process," Comm. Statist. Stoch. Models. 7, No. 1, 1-46 (1991).
11. D. M. Lucantoni, "The BMAP|G| 1 queue: a tutorial," in: Models and Techniques for Performance Evaluation of Computer and Communication Systems, Springer, Berlin (1993).
12. D. M. Lucantoni, K. S. Meier-Hellstern, and M. F. Neuts, "A single server queue with server vacations and a class of nonrenewal arrival processes," Adv. Appl. Probab. (1989).
13. D. M. Lucantoni and M. F. Neuts, Numerical Methods for a Class of Markov Chains Arising in Queueing Theory, Technical Report No. 78/10, University of Delaware, Newark (1978).
14. D. M. Lucantoni and V. Ramaswami, "Efficient algorithms for solving the nonlinear matrix equation arising in phase type queues." Stoch. Models, 1, 29-51 (1985).
15. M. F. Neuts, "A versatile markovian point process," J. Appl. Probab., 16, 764-779 (1979).
16. M. F. Neuts, Structured Stochastic Matrices of M |G| 1 Type and Their Applications. Marcel Dekker, New York-Basel (1987).
17. N. U. Prabhu, "Markov-renewal and Markov-additive processes. A review and some new results," in: Proceedings of KAIST Mathematical Workshop 6, Korea Adv. Inst. of Science and Tech., Taejon (1991), pp. 57-94.
18. A. Pacheco and N. U. Prabhu, "Markov-additive processes of arrivals," in: Advances in Queueing Theory, Methods. and Open Problems, CRC Press, Boca Raton-New York-London-Tokyo (1995).
19. A. Pacheco and N. U. Prabhu, Markov-Compound Poisson Arrival Processes, Technical Report (Oct. 1996) (received by personal communication).
20. V. Ramaswami, "The N |G| 1 queue and its detailed analysis," Adv. Appl. Probab., 12, 222-261 (1980).
21. V. Ramaswami, "From the matrix-geometric to the matrix-exponential," Queueing Systems, 6, 229-260 (1990).