Symmetric queues served in cyclic order

Authors:
S.W Fuhrmann
Affiliations:
AT&T Bell Laboratories, Holmdel, NJ 07733, USA
Venue:
Operations Research Letters
Year:
1985

Citing 5
Cited 4

Waiting Lines and Times in a System with Polling

Journal of the ACM (JACM)
Polling in a Loop System

Journal of the ACM (JACM)
Performance Evaluation of Cyclic Service Strategies - A Survey

Performance '84 Proceedings of the Tenth International Symposium on Computer Performance Modelling, Measurement and Evaluation
An approximate method for treating a class of multiqueue problems

IBM Journal of Research and Development
Local distribution in computer communications

IEEE Communications Magazine

Application note: LAN-based medical visualization communication system

Computer Communications
Research: Message delay for a priority-based automatic meter reading network

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

Operations Research Letters
A simple approximation for mean waiting time in M/G/1 queue with vacations and limited service discipline

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Consider a symmetrical system of n queues served in cyclic order by a single server. It is shown that the stationary number of customers in the system is distributed as the sum of three independent random variables, one being the stationary number of customers in a standard M/G/1 queue. This fact is used to establish an upper bound for the mean waiting time for the case where at most k customers are served at each queue per visit by the server. This approach is also used to rederive the mean waiting times for the cases of exhaustive service, gated service, and serve at most one customer at each queue per visit by the server.