scispace - formally typeset
Journal ArticleDOI

Queues served in cyclic order: Waiting times

Robert B. Cooper
- 01 Mar 1970 - 
- Vol. 49, Iss: 3, pp 399-413
Reads0
Chats0
TLDR
The Laplace-Stieltjes transforms of the order-of-arrival waiting time distribution functions and, for the exhaustive service model, the mean waiting time for a unit arriving at a queue, are obtained.
Abstract
This paper extends the results of a previous paper in which two models of a system of queues served in cyclic order were studied. One model is an exhaustive service model, in which the server waits on all customers in a queue before proceeding to the next queue in cyclic order. The other is a gating model, in which a gate closes behind the waiting units when the server arrives, and the server waits on only those customers in front of the gate, deferring service of later arrivals until the next cycle. In the present paper, the Laplace-Stieltjes transforms of the order-of-arrival waiting time distribution functions and, for the exhaustive service model, the mean waiting time for a unit arriving at a queue, are obtained.

read more

Citations
More filters
Journal ArticleDOI

Regenerative processes in the theory of queues, with applications to the alternating-priority queue

TL;DR: In this article, the equivalence of the limiting distributions of a stochastic process at an arbitrary point in time and at the time of an event from an associated Poisson process is shown.
Journal ArticleDOI

Discrete Time Geo/G/1 Queue with Multiple Adaptive Vacations

TL;DR: The stochastic decomposition property of steady-state queue length and waiting time has been proven and the busy period, vacation mode period, and service mode period distributions are derived.
Journal ArticleDOI

Cyclic reservation schemes for efficient operation of multiple-queue single-server systems

TL;DR: Two new cyclic reservation schemes for the efficient operation of systems consisting of a single server and multiple queues are studied, for which a thorough delay analysis is provided and simple rules for optimal operation are derived.
Journal ArticleDOI

On the M/G/1 Queue with Rest Periods and Certain Service-Independent Queueing Disciplines

TL;DR: The relationship found between the second moments of the waiting time in an M/G/1 queue with rest periods under the FCFS, ROS and LCFS disciplines is precisely that found by Takacs for the M/g/1 queues without rest periods.
Journal ArticleDOI

Message Delay Analysis for Polling and Token Multiple-Access Schemes for Local Communication Networks

TL;DR: Two efficient polling (token) schemes, which provide multiaccess coordination for local area networks, are described, analyzed, and compared.
References
More filters
Journal ArticleDOI

Queues served in cyclic order

TL;DR: In this paper, the authors study two models of a system of queues served in cyclic order by a single server, and find expressions for the mean number of units in a queue at the instant it starts service, the mean cycle time, and the Laplace-Stieltjes transform of the cycle time distribution function.
Journal ArticleDOI

Two queues attended by a single server

Lajos Takács
- 01 Jun 1968 - 
TL;DR: It is supposed that customers of type 1 and type 2 arrive at a service system in accordance with a Poisson process and the service times have a general distribution.
Journal ArticleDOI

Queuing with Alternating Priorities

TL;DR: The alternating priority rule is compared to the "head-of-the-line" and the "first-come, first-served" rules with respect to expected queuing times and queue sizes and the results are related to the case where switching from one type of customers to another is not penalized by setup time.