A Combinatorial Lemma and Its Application to Concentrating Trees of Discrete-Time Queues
- 6 May 1978
- journal article
- website
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Bell System Technical Journal
- Vol. 57 (5) , 1645-1652
- https://doi.org/10.1002/j.1538-7305.1978.tb02116.x
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 t...Keywords
This publication has 2 references indexed in Scilit:
- Delay Decomposition at a Single Server queue with Constant Service Time and Multiple InputsIEEE Transactions on Communications, 1978
- The stochastic behavior of a buffer with non-identical input linesStochastic Processes and their Applications, 1975