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

DOI10.1002/j.1538-7305.1978.tb02116.xzbMath0374.94023OpenAlexW2133608928WikidataQ124849516 ScholiaQ124849516MaRDI QIDQ4152150

John A. Morrison

Publication date: 1978

Published in: Bell System Technical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/j.1538-7305.1978.tb02116.x

Mathematics Subject Classification ID

Operations research and management science (90B99) Communication theory (94A05)

Related Items (3)

Reduction of a polling network to a single node ⋮ Theory of queuing networks and its applications to the analysis of information-computing systems ⋮ Tandem queues with deterministic service times

This page was built for publication: A Combinatorial Lemma and Its Application to Concentrating Trees of Discrete-Time Queues