Journal ArticleDOI
Queues served in cyclic order: Waiting times
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
A queueing network with a single cyclically roving server
TL;DR: This paper derives the generating function and the expected number of customers present in the network queues at arbitrary epochs, and compute the expected values of the delays observed by the customers, and introduces pseudo-conservation laws for this network of queues.
Journal ArticleDOI
Computing distributions and moments in polling models by numerical transform inversion
TL;DR: It is shown that probability distributions and moments of performance measures in many polling models can be effectively computed by numerically inverting transforms (generating functions and Laplace transforms) and new efficient iterative algorithms for computing the transform values are developed and used.
Journal ArticleDOI
Mean value analysis for polling systems
TL;DR: In this paper, the problem of calculating mean delays in polling systems with either exhaustive or gated service is addressed, and a mean value analysis (MVA) is developed to compute these delay figures.
Journal ArticleDOI
Techniques: Survey of computer communications loop networks: Part 1
Bk Penney,Aa Baghdadi +1 more
TL;DR: It is shown that loops can have performance advantages over other configurations, and configuration and topology and loop-capacity sharing are discussed and different loops are compared with each other and with other topologies.
References
More filters
Journal ArticleDOI
Queues served in cyclic order
Robert B. Cooper,G. Murray +1 more
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
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.