Hostname: page-component-78c5997874-4rdpn Total loading time: 0 Render date: 2024-11-18T03:20:39.780Z Has data issue: false hasContentIssue false
  • English
  • Français

The mean waiting time in a G/G/m/∞ queue with the LCFS-P service discipline

Published online by Cambridge University Press:  01 July 2016

Gunter Ritter  and
Ulrich Wacker
Gunter Ritter
Affiliation:
Universität Passau
Ulrich Wacker*
Affiliation:
Universität Passau
*
∗Postal address: Fakultät für Mathematik und Informatik der Universität, D-W8390 Passau, Germany.
Get access Rights & Permissions [Opens in a new window]

Abstract

A single- or multiserver queue with work-conserving service discipline and a stationary and ergodic input stream with bounded service times and arbitrarily light traffic intensity may have infinite mean waiting time. We give an example of this paradox and we also give a mixing condition which, in the case of the preemptive-resume LCFS discipline, excludes this phenomenon. Furthermore, the same methods allow to estimate the durations of the first busy period and cycle and the number of customers served in the first busy cycle of a work-conserving queue.

Keywords

PREEMPTIVE-RESUME LCFSWORK CONSERVINGSTATIONARY AND ERGODIC INTERARRIVAL AND SERVICE TIMESMIXING CONDITIONBUSY CYCLEBUSY PERIOD
Type
Research Article
Information
Advances in Applied Probability , Volume 23 , Issue 2 , June 1991 , pp. 406 - 428
Copyright
Copyright © Applied Probability Trust 1991 

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.)

References

1. Asmussen, S. (1987) Applied Probability and Queues. Wiley, Chichester.Google Scholar
2. Billingsley, P. (1968) Convergence of Probability Measures. Wiley, New York.Google Scholar
3. Feller, W. (1971) An Introduction to Probability Theory and its Applications Vol. II, 2nd edn. Wiley, New York.Google Scholar
4. Flipo, D. (1981) Comparaison des disciplines de service des files d'attente G/G/1. Ann. Inst. H. Poincaré XVII, 191–212.Google Scholar
5. Franken, P., König, D., Arndt, U. and Schmidt, V. (1982) Queues and Point Processes . Wiley, Chichester.Google Scholar
6. Hall, P. and Heyde, C. C. (1980) Martingale Limit Theory and Its Application. Academic Press, New York.Google Scholar
7. Ibragimov, I. A. (1962) Some limit theorems for stationary processes. Theory Prob. Appl. 7, 349–382.Google Scholar
8. Ibragimov, I. A. (1975) A note on the central limit theorem for dependent random variables. Theory Prob. Appl. 20, 135–141.CrossRefGoogle Scholar
9. Ibragimov, I. A. and Linnik, Yu. V. (1971) Independent and Stationary Sequences of Random Variables. Wolters–Noordhoff, Groningen.Google Scholar
10. Kiefer, J. and Wolfowitz, J. (1956) On the characteristics of the general queueing process, with applications to random walk. Ann. Math. Statist. 27, 147–161.Google Scholar
11. Kingman, J. F. C. (1970) Inequalities in the theory of queues. J. R. Statist. Soc. B32, 102–110.Google Scholar
12. Krengel, U. (1985) Ergodic Theorems , de Gruyter, Berlin.Google Scholar
13. Krengel, U., Röttger, R. and Wacker, U. (1983) A renewal type mean ergodic theorem. Z. Wahrscheinlichkeitsth. 64, 269–274.Google Scholar
14. Loynes, R. M. (1962) The stability of a queue with non-independent interarrival and service times. Proc. Camb. Phil. Soc. 58, 497–520.Google Scholar
15. Rolski, T. (1981) Stationary Random Processes Associated with Point Processes. Lecture Notes in Statistics 5, Springer-Verlag, Berlin.Google Scholar
16. Shanthikumar, J. G. and Sumita, U. (1987) Convex ordering of sojourn times in single-server queues: extremal properties of FIFO an LIFO service disciplines. J. Appl Prob. 24, 737–748.CrossRefGoogle Scholar
17. Shedler, G. S. (1987) Regeneration and Networks of Queues. Springer, New York.Google Scholar
18. Vasicek, O. A. (1977) An inequality for the variance of waiting time under a general queueing discipline. Operat. Res. 25, 879–884.Google Scholar