Work

Waiting-time approximations for cyclic-service systems with switch-over times

Year: 1986

Type: article

Abstract: Mean waiting-time approximations are derived for a single-server multi-queue system with nonexhaustive cyclic service. Non-zero switch-over times of the server between consecutive queues are assumed. The main tool used in the derivation is a pseudo-conservation law recently found by Watson. The approximation is simpler and, as extensive simulations show, more accurate than existing approximations. Moreover, it gives very good insight into the qualitative behavior of cyclic-service queueing systems.

Source: ACM SIGMETRICS Performance Evaluation Review

DOI: 10.1145/317531.317558

Authors: O. J. Boxma, B. Meister

Institutions: Centrum Wiskunde & Informatica, IBM Research - Zurich

Language: English

Topic: Advanced Queuing Theory Analysis

Subfield: Management Information Systems

Field: Business, Management and Accounting

Domain: Social Sciences

Open Access status: bronze

OpenAlex ID: W2593433385

FWCI: 9.355

Cites: 7

Cited by: 23

Related to: 10