Stationary Waiting Time Distribution in G|M|n|r with Random Renovation Policy

Author(s):  
Ivan Zaryadov ◽  
Rostislav Razumchik ◽  
Tatiana Milovanova
1979 ◽  
Vol 16 (2) ◽  
pp. 454-457 ◽  
Author(s):  
Harry H. Tan

A new upper bound on the stationary waiting-time distribution of a GI/G/1 queue is derived following Kingman's martingale approach. This bound is generally stronger than Kingman's upper bound and is sometimes stronger than an upper bound derived by Ross.


2005 ◽  
Vol 19 (1) ◽  
pp. 121-140 ◽  
Author(s):  
Mohan L. Chaudhry ◽  
Dae W. Choi ◽  
Kyung C. Chae

In this article, we obtain, in a unified way, a closed-form analytic expression, in terms of roots of the so-called characteristic equation of the stationary waiting-time distribution for the GIX/R/1 queue, where R denotes the class of distributions whose Laplace–Stieltjes transforms are rational functions (ratios of a polynomial of degree at most n to a polynomial of degree n). The analysis is not restricted to generalized distributions with phases such as Coxian-n (Cn) but also covers nonphase-type distributions such as deterministic (D). In the latter case, we get approximate results. Numerical results are presented only for (1) the first two moments of waiting time and (2) the probability that waiting time is zero. It is expected that the results obtained from the present study should prove to be useful not only for practitioners but also for queuing theorists who would like to test the accuracies of inequalities, bounds, or approximations.


1988 ◽  
Vol 25 (3) ◽  
pp. 636-641 ◽  
Author(s):  
V. Ramaswami ◽  
D. M. Lucantoni

Recursive relations for computing the higher moments of the stationary waiting time distribution in a stable GI/PH/1 queue are derived. These provide an accurate and stable technique to compute these moments.


1988 ◽  
Vol 25 (03) ◽  
pp. 636-641
Author(s):  
V. Ramaswami ◽  
D. M. Lucantoni

Recursive relations for computing the higher moments of the stationary waiting time distribution in a stable GI/PH/1 queue are derived. These provide an accurate and stable technique to compute these moments.


1976 ◽  
Vol 13 (2) ◽  
pp. 411-417 ◽  
Author(s):  
R. Bergmann ◽  
D. Stoyan

Exponential bounds for the stationary waiting-time distribution of the type ae–θt are considered. These bounds are obtained by the use of Kingman's method of ‘integral inequalities’. Approximations of Θ and a are given which are useful especially if the service and/or inter-arrival time distribution functions are NBUE or NWUE.


1962 ◽  
Vol 2 (3) ◽  
pp. 345-356 ◽  
Author(s):  
J. F. C. Kingmán

As an illustration of the use of his identity [10], Spitzer [11] obtained the Pollaczek-Khintchine formula for the waiting time distribution of the queue M/G/1. The present paper develops this approach, using a generalised form of Spitzer's identity applied to a three-demensional random walk. This yields a number of results for the general queue GI/G/1, including Smith' solution for the stationary waiting time, which is established under less restrictive conditions that hitherto (§ 5). A soultion is obtained for the busy period distribution in GI/G/1 (§ 7) which can be evaluated when either of the distributions concerned has a rational characteristic function. This solution contains some recent results of Conolly on the quene GI/En/1, as well as well-known results for M/G/1.


Sign in / Sign up

Export Citation Format

Share Document