On the capacity of disjointly shared networks

DOI10.1016/0169-7552(85)90070-4zbMath0578.94001OpenAlexW2000901404MaRDI QIDQ3701318

Don Zagier, Jeffrey C. Lagarias, Andrew M. Odlyzko

Publication date: 1985

Published in: Computer Networks and ISDN Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0169-7552(85)90070-4

zbMATH Keywords

generating functionspermutation enumerationdisjointly shared channelETHERNETMulti-access broadcast channels

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Communication theory (94A05)

Related Items (5)

The Random Connection Model on the Torus ⋮ The permutation-path coloring problem on trees. ⋮ Exponential penalty function control of loss networks ⋮ Threshold phenomena in the transient behaviour of Markovian models of communication networks and databases ⋮ Computational complexity of loss networks

This page was built for publication: On the capacity of disjointly shared networks