A Combinatorial Lemma and Its Application to Concentrating Trees of Discrete-Time Queues

Abstract

Concentrating rooted tree networks of discrete-time single server queues, all with unit service time, are considered. Such networks occur as subnetworks connecting remote access terminals to a node in a data communications network. It is shown that the network of queues may be replaced by a single queue, with prescribed input, which has the same output as the queue at the root of the tree. The result is applied, in particular, to the case of several queues in tandem, and it is shown how this problem may be reduced to that of just two queues in tandem. The latter problem was analyzed earlier by the author.

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.