scispace - formally typeset
Search or ask a question

Showing papers on "Retrial queue published in 1986"


Journal ArticleDOI
TL;DR: In this paper, the expected waiting times for the customers of two types who arrive in batches (in a compound Poisson fashion) at a single-server queueing station with no waiting room were derived.
Abstract: Expressions are derived for the expected waiting times for the customers of two types who arrive in batches (in a compound Poisson fashion) at a single-server queueing station with no waiting room. Those who cannot get served immediately keep returning to the system after random exponential amounts of time until they get served. The result is shown to agree with similar results for three special cases studied in the literature.

53 citations


Journal ArticleDOI
TL;DR: In this article, the M/M/1/1 retrial queue was studied and the authors derived expressions for the mean, variance and generating function of R. Limit theorems were stated for heavy-and light-traffic cases.
Abstract: Waiting time in a queueing system is usually measured by a period from the epoch when a subscriber enters the system until the service starting epoch. For repeated orders queueing systems it is natural to measure the waiting time by the number of repeated attempts, R, which have to be made by a blocked primary call customer before the call enters service. We study this problem for the M/M/1/1 retrial queue and derive expressions for mean, variance and generating function of R. Limit theorems are stated for heavy- and light-traffic cases.

28 citations


01 Jan 1986
TL;DR: In this article, the M/M/1/1 retrial queue was studied and the authors derived expressions for the mean, variance and generating function of R. Limit theorems were stated for heavy-and light-traffic cases.
Abstract: Waiting time in a queueing system is usually measured by a period from the epoch when a subscriber enters the system until the service starting epoch. For repeated orders queueing systems it is natural to measure the waiting time by the number of repeated attempts, R, which have to be made by a blocked primary call customer before the call enters service. We study this problem for the M/M/1/1 retrial queue and derive expressions for mean, variance and generating function of R. Limit theorems are stated for heavy- and light-traffic cases.