Algorithmic analysis of the BMAP/D/k system in discrete time

Advances in Applied Probability

Volumn 35, Issue 4, 2003, Pages 1131-1152

  Alfa, Attahiru Sule ^a  

^a UNIVERSITY OF MANITOBA   (Canada)

Author keywords

Batch Markovian arrival process; Busy period; Deterministic service; Discrete time; Marginal queue length; Matrix analytic method; Multiserver; Waiting time

Indexed keywords

DATA REDUCTION; ITERATIVE METHODS; MARKOV PROCESSES; MATRIX ALGEBRA; SERVERS;

DISCRETE TIME; MULTISERVERS; WAITING TIME;

PROBABILITY;

EID: 0344082895     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1239/aap/1067436338     Document Type: Article

References (23)

1. ALFA, A. S. (2001). Discrete time queues and matrix-geometric method: some special features. In Lecture Notes First Seoul Internat. Workshop Queueing Theory (Seoul 16-18 July 2001), SRCCS.
2. ALFA, A. S. (2003). Waiting time distribution of the MAP/D/A system in discrete time - a more efficient algorithm. Operat. Res. Lett. 31, 263-267.
3. ALFA, A. S. AND FITZPATRICK, G. J. (1999). Waiting time distribution of a FIFO/LIFO Geo/D/1 queue. INFOR 37, 149-159.
4. ALFA, A. S., DOLHUN, L. K. AND CHAKRAVARTHY, S. (1995). A discrete single server queue with Markovian arrivals and phase type group services. J. Appl. Math. Stoch. Anal. 8, 151-176.
5. BINI, D. AND MEINI, B. (1995). On cyclic reduction applied to a class of Toeplitz-like matrices arising in queueing problems. In Computations with Markov Chains, ed. W. J. Stewart, Kluwer, Boston, MA, pp. 21-38.
6. BINI, D. AND MEINI, B. (1998). Using displacement structure for solving non-skip-free M/G/1 type Markov chains. In Advances in Matrix-Analytic Methods for Stochastic Models, eds A. S. Alfa and S. Chakravarthy, Notable Publications, Neshanic Station, NJ, pp. 17-37.
7. BLONDIA, C. (1993). A discrete-time batch Markovian arrival process as B-ISDN traffic model. Belg. J. Operat. Res. Statist, Comput. Sci. 32, 3-23.
8. BRUNEEL, H. AND KIM, B. G. (1993). Discrete-Time Models for Communications Systems Including ATM. Kluwer, Boston, MA.
9. BRUNEEL, H. AND WUYTS, I. (1994). Analysis of discrete-time multiserver queueing models with constant service time. Operat. Res. Lett. 15, 231-236.
10. CHAKRAVARTHY, S. AND ALFA, A. S. (1993). A multiserver queue with Markovian arrivals and group services with thresholds. Naval Res. Logistics 40, 811-827.
11. CHAUDHRY, M. L., YOON, B. K. AND CHAE, K. C. (2002). Waiting-time distribution of a discrete multiserver queue with correlated arrivals and deterministic service times: D-MAP/D/k system. Operat. Res. Lett. 30, 174-180.
12. CROMMELIN, C. D. (1932). Delay probability formulae when the holding times are constant. Post Office Electrical Eng. J. 25, 41-50.
13. FRANX, G. J. (2001). A simple solution for the M/D/c waiting time distribution. Operat. Res. Lett. 29, 221-229.
14. FRIGUI, I., ALFA, A. S. AND Xu, X. (1997). Algorithms for computing waiting-time distributions under different disciplines for the D-BMAP/PH/1. Naval Res. Logistics 44, 559-576.
15. GAIL, H. R., HANTLER, S. L. AND TAYLOR, B. A. (1997). Non-skip-free M/G/ 1 and GI/M/1 type Markov chains. Adv. Appl. Prob. 29, 733-758.
16. k/D/r queues with FIFO. Operat. Res. Lett. 2, 20-21.
17. LATOUCHE, G. AND RAMASWAMI, V. (1999). Introduction to Matrix Analytic Methods in Stochastic Modeling. SIAM, Philadelphia, PA.
18. NEUTS, M. F. (1981). Matrix-Geometric Solutions in Stochastic Models. Johns Hopkins University Press, Baltimore, MD.
19. NEUTS, M. F. (1989). Structured Stochastic Matrices of the M/G/1 Type and Their Applications. Marcel Dekker, New York.
20. NISHIMURA, S. (2000). A spectral analysis for a MAP/D/N queue. In Advances in Algorithmic Methods for Stochastic Models, eds G. Latouche and P. Taylor, Notable Publications, Neshanic Station, NJ, pp. 279-294.
21. RAMASWAMI, V. (1988). A stable recursion for the steady state vector in Markov chains of M/G/1 type. Stoch. Models 4, 183-188.
22. TAKINE, T. (2000). A simple approach to the MAP/D/s queue. Stoch. Models 16, 543-556.
23. TIJMS, H. C. (1994). Stochastic Models, an Algorithmic Approach. John Wiley, New York.