A new upper bound of <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0.6126</tex> packets/slot is established for the through-put of a time-slotted multi-access broadcast channel subject to an infinite population of user stations (whose transmissions are modeled by a Poisson process) using (0)-, (1)-, (e)-feedback to denote a slot with none, one, or at least two packets, respectively.
No takes yet. Share an insight, caveat, or question.
Cruz et al. (1982) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: