STRUCTURED PRIORITY QUEUE WITH BATCH ARRIVALS

Abstract

This paper investigates a single-server priority queueing system with batch arrivals where an arriving batch is composed of multi-class customers. The main motivation for studying this type of priority queue is its potential applicability to communication switching systems. Preemptive resume and nonpreemp-tive (head-of-the-line) rules are considered. The queue length and waiting time distributions are obtained via the supplementary variable technique and delay cycle analysis. The conservation law approach is applied to find the mean delay formulas.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 11 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.