On pseudo-conservation laws for the cyclic server system with compound Poisson arrivals

Authors:
Jhitti Chiarawongse;Mandyam M Srinivasan
Affiliations:
Center for Information Technology Integration, The University of Michigan, 2901 Hubbard, Ann Arbor, MI 48105, USA;Department of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, MI 48109-2117, USA
Venue:
Operations Research Letters
Year:
1991

Citing 7
Cited 0

Queueing systems with vacations—a survey

Queueing Systems: Theory and Applications
Queuing analysis of polling models

ACM Computing Surveys (CSUR)
Workloads and waiting times in single-server systems with multiple customer classes

Proceedings of the workshop held at the Mathematical Sciences Institute Cornell University on Mathematical theory of queueing systems
Waiting-time approximations for cyclic-service systems with switch-over times

SIGMETRICS '86/PERFORMANCE '86 Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation
Performance Evaluation of Cyclic Service Strategies - A Survey

Performance '84 Proceedings of the Tenth International Symposium on Computer Performance Modelling, Measurement and Evaluation
On the Mx/G /1 queue with vacation time

Operations Research Letters
On the relationship between work load and waiting time in single server queues with batch inputs

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Boxma and Groenendijk obtain the pseudo-conservation laws for cyclic server systems, for both the continuous-time system with simple Poisson arrivals, and for the discrete-time system. We extend these laws to the continuous-time cyclic server system with compound Poisson arrivals. In the process we identify an error in Boxma and Groenendijk's analysis of the semi-exhaustive service strategy in the discrete-time cyclic server system.