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
Proceedings ArticleDOI
A two-queue polling model with two priority levels in the first queue
Marko Boon,Ivo Adan,Onno Boxma +2 more
TL;DR: This paper considers a single-server cyclic polling system consisting of two queues where the server is delayed by a random switch-over time between visits to successive queues, and studies the cycle time distribution, the waiting times for each customer type, the joint queue length distribution at polling epochs, and the steady-state marginal queue length distributions.
Journal ArticleDOI
Analysis and Optimization of Sleeping Mode in WiMAX via Stochastic Decomposition Techniques
TL;DR: The paper establishes a general approach for analyzing queueing models with repeated inhomogeneous vacations by studying a simple M/G/1 queue and proposing parameters that provide the best performance under worst case conditions.
Journal ArticleDOI
The departure process of the M/G/1 queueing model with server vacation and exhaustive service discipline
TL;DR: This paper discusses the distribution of the interdeparture time and the expected number of departures occurring in the time interval (0, t) from the beginning of the state i, and provides a new method for analysis of the departure process of the single-server queue.
Journal ArticleDOI
Analysis of a Reservation Multiple Access Technique for Data Transmission Via Satellites
M. Balagangadhar,R. Pickholtz +1 more
TL;DR: A new reservation-based time-division multiple access scheme is proposed, analyzed as a cyclic-multiqueue attended by a single server, with attention being focused on an imbedded process obtained by examining the system at special epochs located at the beginnings of each cycle.
Proceedings ArticleDOI
A distributed scheduling algorithm for quality of service support in multiaccess networks
C. Barrack,Kai-Yeung Siu +1 more
TL;DR: While most reservation-based multiaccess protocols require a centralized scheduler and a separate channel for arbitration, this algorithm is truly distributed in the sense that network nodes coordinate their transmissions only via headers in the packets.
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.