2001
DOI: 10.1016/s0167-6377(01)00108-0
|View full text |Cite
|
Sign up to set email alerts
|

A simple solution for the M/D/c waiting time distribution

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
37
0
1

Year Published

2003
2003
2018
2018

Publication Types

Select...
7
2
1

Relationship

0
10

Authors

Journals

citations
Cited by 56 publications
(39 citation statements)
references
References 2 publications
1
37
0
1
Order By: Relevance
“…The limiting result for P(M β = 0) has the appealing property that the time to compute it does not depend on the number of servers, which is the case for standard computational procedures for the M/D/s queue, see e.g. Tijms [32] and Franx [10] and references therein. The main aim of this paper is to obtain series expansions refining this asymptotic result.…”
Section: Goals Results and Insightsmentioning
confidence: 99%
“…The limiting result for P(M β = 0) has the appealing property that the time to compute it does not depend on the number of servers, which is the case for standard computational procedures for the M/D/s queue, see e.g. Tijms [32] and Franx [10] and references therein. The main aim of this paper is to obtain series expansions refining this asymptotic result.…”
Section: Goals Results and Insightsmentioning
confidence: 99%
“…To derive E[W (t)] we evaluate the cumulative distribution of the delay W (t) experienced by a user arriving at time t following the methods proposed in [21], [22]. We generalize the approach considering non-homogeneous arrival rates and an unknown initial state u(T sc ).…”
Section: Delay Analysismentioning
confidence: 99%
“…Franx [12] showed that the waiting time probability for M/D/n is: The equations can be solved using the fast Fourier transform and a geometric tail approach [13].…”
Section: Performance Of a Sip-based Grid Systemmentioning
confidence: 99%