Average Delay Approximation of M/G/1 Cyclic Service Queues with Bernoulli Schedules

Authors:
L. Servi
Affiliations:
GTE Lab., Waltham, MA, USA
Venue:
IEEE Journal on Selected Areas in Communications
Year:
2006

Citing 0
Cited 5

Research: Fourier analysis for modelling some cyclic behaviour of networks

Computer Communications
Average waiting time of a symmetric polling system under Bernoulli scheduling

Operations Research Letters
Level-crossing approach to a time-limited service system with two types of vacations

Operations Research Letters
A distributional form of Little's Law

Operations Research Letters
Performance analysis of an M/G/1 queueing system under Bernoulli vacation schedules with server setup and close down periods

Computers and Industrial Engineering

Quantified Score

Hi-index	0.07

Visualization

Abstract

The Laplace Transform (and the first two moments) of the busy period of the recently introducedM/G/1vacation model with a Bernoulli schedule is completed exactly. This expression makes it possible to estimate the average waiting time of each queue for the Bernoulli schedule cyclic service queue. Consequently, the weighted average of the mean waiting time can be minimized over the class of Bernoulli schedules. The Bernoulli schedule has the advantage over exhaustive schedules (or classical priority schedules) in that the performance of one class of traffic is somewhat insulated from the adverse effects of high utilization in a different class of traffic. The analysis of cyclic service queues can be applied to processor schedules and token ring local area networks as well as components of other data communication systems.