An approximate solution for Ph/Ph/1 and Ph/Ph/1/N queues - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

An approximate solution for Ph/Ph/1 and Ph/Ph/1/N queues


We propose a simple approximation to assess the steady-state probabilities of the number of customers in Ph/Ph/1 and Ph/Ph/1/N queues, as well as probabilities found on arrival, including the probability of buffer overflow for the Ph/Ph/1/N queue. The phase-type distributions considered are assumed to be acyclic. Our method involves iteration between solutions of an M/Ph/1 queue with state-dependent arrival rate and a Ph/M/1 queue with state-dependent service rate. We solve these queues using simple and efficient recurrences. By iterating between these two simpler models our approximation divides the state space, and is thus able to easily handle phase-type distributions with large numbers of stages (which might cause problems for classical numerical solutions). The proposed method converges typically within a few tens of iterations, and is asymptotically exact for queues with unrestricted queueing room. Its overall accuracy is good: generally within a few percent of the exact values, except when both the inter-arrival and the service time distributions exhibit low variability. In the latter case, especially under moderate loads, the use of our method is not recommended.

Dates and versions

hal-00746838 , version 1 (29-10-2012)



Alexandre Brandwajn, Thomas Begin. An approximate solution for Ph/Ph/1 and Ph/Ph/1/N queues. IPEC 2012 - 3rd ACM/SPEC International Conference on Performance Engineering, Apr 2012, Boston, Massachusetts, United States. pp.57-62, ⟨10.1145/2188286.2188297⟩. ⟨hal-00746838⟩
67 View
0 Download



Gmail Facebook X LinkedIn More