Program Committee

Abstract

We propose a family of finite approximations for the departure process of a MAP/MAP/1 queue. The departure process approximations are derived via an exact aggregate solution technique (called ETAQA) applied to quasi-birth-death processes (QBDs) and require only the computation of the frequently sparse fundamental-period matrix G. The approximations are indexed by a parameter n, which determines the size of the output model as n-1 QBD levels. The marginal distribution of the true departure process and the lag correlations of the interdeparture times up to lag n+1 are preserved exactly. Via experimentation we show the applicability of the proposed approximation in traffic-based decomposition of queueing networks and investigate how correlation propagates through tandem queues.

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 — 20 citations exist upstream.

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