Algorithms for computing waiting time distributions under different queue disciplines for the D-BMAP/PH/1

Frigui, Imed; Alfa, Attahiru Sule

doi:10.1002/(sici)1520-6750(199709)44:6<559::aid-nav3>3.0.co;2-2

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2000

2015

Publication Types

Select...

Article4

Other1

Book1

Relationship

Self Cite1

Independent5

Authors

Journals

Cited by 15 publications

(1 citation statement)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then the arrival rate is given as λ = π ∞ j =1 j D j 1. Discrete BMAP was described by Blondia (1993) and Frigui et al (1997).…”

Section: Introductionmentioning

confidence: 99%

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

Alfa

2003

Advances in Applied Probability

Self Cite

View full text Add to dashboard Cite

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.

show abstract

“…Then the arrival rate is given as λ = π ∞ j =1 j D j 1. Discrete BMAP was described by Blondia (1993) and Frigui et al (1997).…”

Section: Introductionmentioning

confidence: 99%