Hostname: page-component-8448b6f56d-mp689 Total loading time: 0 Render date: 2024-04-19T20:12:40.090Z Has data issue: false hasContentIssue false
  • English
  • Français

On the waiting time distribution in a generalized GI/G/1 queueing system

Published online by Cambridge University Press:  14 July 2016

Jacqueline Loris-Teghem
Jacqueline Loris-Teghem*
Affiliation:
Université Libre de Bruxelles
*
* The author is Chargé de Recherches of the Fonds National Belge de la Recherche Scientifique.
Get access Rights & Permissions [Opens in a new window]

Abstract

The model considered in this paper describes a queueing system in which the station is dismantled at the end of a busy period and re-established on arrival of a new customer, in such a way that the closing-down process consists of N1 phases of random duration and that a customer 𝒞n who arrives while the station is being closed down must wait a random time idn(i = 1, ···, N1) if the ith phase is going on at the arrival instant. (For each fixed index i, the random variables idn are identically distributed.) A customer 𝒞n arriving when the closing-down of the station is already accomplished has to wait a random time (N1 + 1)dn corresponding to the set up time of the station. Besides, a customer 𝒞n who arrives when the station is busy has to wait an additional random time 0dn. We thus have (N1 + 2) types of “delay” (additional waiting time). Similarly, we consider (N2 + 2) types of service time and (N3 + 2) probabilities of joining the queue. This may be formulated as a model with (N + 2) types of triplets (delay, service time, probability of joining the queue). We consider the general case where the random variables defining the model all have an arbitrary distribution.

The process {wn}, where wn denotes the waiting time of customer 𝒞n if he joins the queue at all, is not necessarily Markovian, so that we first study (by algebraic considerations) the transient behaviour of a Markovian process {vn} related to {wn}, and then derive the distribution of the variables wn.

Type
Research Papers
Information
Journal of Applied Probability , Volume 8 , Issue 2 , June 1971 , pp. 241 - 251
Copyright
Copyright © Applied Probability Trust 1971 

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

Finch, P. D. (1959) A probability limit theorem with application to a generalization of queueing theory. Acta Math. Acad. Sci. Hung. 10, 317–325.CrossRefGoogle Scholar
Gaver, D. P. Jr. (1963) Competitive queueing: idleness probabilities under priority disciplines. J. R. Statist. Soc. B 25, 489–499.Google Scholar
Kingman, J. F. C. (1966) On the algebra of queues. J. Appl. Prob. 3, 285–326.Google Scholar
Loris-Teghem, J. (1968) Une application d'un théorème de G. Baxter à la détermination de la distribution des temps d'attente dans un modèle GI/G/1 généralisé. Cahiers Centre Rech. Opérat. 10, 79–83.Google Scholar
Pollaczek, F. (1957) Problèmes Stochastiques Posés par le Phénomène de Formation d'une Queue d'Attente à un Guichet et par des Phénomènes Apparentés. Mémor. Sci. Math. 136. Gauthiers–Villars, Paris.Google Scholar
Takács, L. (1961) The transient behavior of a single server queueing process with a Poisson input. Proc. Fourth Berkeley Symp. on Math. Statist. and Prob. II, 535–567.Google Scholar
Welch, P. D. (1964a) On pre-emptive resume priority queues. Ann. Math. Statist. 35, 600–612.Google Scholar
Welch, P. D. (1964b) On a generalized M/G/1 queueing process in which the first customer of each busy period receives exceptional service, Operat. Res. 12, 736–752.Google Scholar
Yadin, M. and Naor, P. (1963) Queueing systems with a removable service station. Operat. Res. Quart. 14, 393–406.CrossRefGoogle Scholar
Yeo, G. F. (1962) Single server queues with modified service mechanisms. J. Aust. Math. Soc. 2, 499–507.Google Scholar