Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-09T21:25:15.655Z Has data issue: false hasContentIssue false
  • English
  • Français

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

Part of: Special processes Computer system organization Operations research and management science

Published online by Cambridge University Press:  01 July 2016

Attahiru Sule Alfa
Attahiru Sule Alfa*
Affiliation:
University of Manitoba
*
∗ Postal address: Department of Electrical and Computer Engineering, 15 Gillson Street, Winnipeg, Manitoba R3T 5V6, Canada. Email address: alfa@ee.umanitoba.ca
Get access Rights & Permissions [Opens in a new window]

Abstract

We exploit the structural properties of the BMAP/D/k system to carry out its algorithmic analysis. Specifically, we use these properties to develop algorithms for studying the distributions of waiting times in discrete time and the busy period. One of the structural properties used results from considering the system as having customers assigned in a cyclic order—which does not change the waiting-time distribution—and then studying only one arbitrary server. The busy period is defined as the busy period of an arbitrary single server based on this cyclic assignment of customers to servers. Finally, we study the marginal distribution of the joint queue length and phase of customer arrival. The structural property used for studying the queue length is based on the observation of the system every interval that is the length of one customer service time.

Keywords

Discrete timedeterministic servicemultiserverwaiting timebusy periodmarginal queue lengthbatch Markovian arrival processmatrix-analytic method

MSC classification

Primary: 60K25: Queueing theory
Secondary: 68M20: Performance evaluation; queueing; scheduling 90B22: Queues and service

Information

Type
General Applied Probability
Information
Advances in Applied Probability , Volume 35 , Issue 4 , December 2003 , pp. 1131 - 1152
Copyright
Copyright © Applied Probability Trust 2003 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

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.Google Scholar
Alfa, A. S. (2003). Waiting time distribution of the MAP/D/k system in discrete time—a more efficient algorithm. Operat. Res. Lett. 31, 263–267.Google Scholar
Alfa, A. S. and Fitzpatrick, G. J. (1999). Waiting time distribution of a FIFO/LIFO Geo/D/1 queue. INFOR 37, 149–159.Google Scholar
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.CrossRefGoogle Scholar
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. Stewart, W. J., Kluwer, Boston, MA, pp. 21–38.CrossRefGoogle Scholar
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 Alfa, A. S. and Chakravarthy, S., Notable Publications, Neshanic Station, NJ, pp. 17–37.Google Scholar
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.Google Scholar
Bruneel, H. and Kim, B. G. (1993). Discrete-Time Models for Communications Systems Including ATM. Kluwer, Boston, MA.CrossRefGoogle Scholar
Bruneel, H. and Wuyts, I. (1994). Analysis of discrete-time multiserver queueing models with constant service time. Operat. Res. Lett. 15, 231–236.Google Scholar
Chakravarthy, S. and Alfa, A. S. (1993). A multiserver queue with Markovian arrivals and group services with thresholds. Naval Res. Logistics 40, 811–827.3.0.CO;2-R>CrossRefGoogle Scholar
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.Google Scholar
Crommelin, C. D. (1932). Delay probability formulae when the holding times are constant. Post Office Electrical Eng. J. 25, 41–50.Google Scholar
Franx, G. J. (2001). A simple solution for the M/D/c waiting time distribution. Operat. Res. Lett. 29, 221–229.CrossRefGoogle Scholar
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.Google Scholar
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.CrossRefGoogle Scholar
Iversen, V. B. (1983). Decomposition of an M/D/rk queue with FIFO into kE_k/D/r queues with FIFO. Operat. Res. Lett. 2, 20–21.CrossRefGoogle Scholar
Latouche, G. and Ramaswami, V. (1999). Introduction to Matrix Analytic Methods in Stochastic Modeling. SIAM, Philadelphia, PA.CrossRefGoogle Scholar
Neuts, M. F. (1981). Matrix-Geometric Solutions in Stochastic Models. Johns Hopkins University Press, Baltimore, MD.Google Scholar
Neuts, M. F. (1989). Structured Stochastic Matrices of the M/G/1 Type and Their Applications. Marcel Dekker, New York.Google Scholar
Nishimura, S. (2000). A spectral analysis for a MAP/D/N queue. In Advances in Algorithmic Methods for Stochastic Models, eds Latouche, G. and Taylor, P., Notable Publications, Neshanic Station, NJ, pp. 279–294.Google Scholar
Ramaswami, V. (1988). A stable recursion for the steady state vector in Markov chains of M/G/1 type. Stoch. Models 4, 183–188.CrossRefGoogle Scholar
Takine, T. (2000). A simple approach to the MAP/D/s queue. Stoch. Models 16, 543–556.CrossRefGoogle Scholar
Tijms, H. C. (1994). Stochastic Models, an Algorithmic Approach. John Wiley, New York.Google Scholar