论文信息 - A new upper bound to the throughput of a multi-access broadcast channel

A new upper bound to the throughput of a multi-access broadcast channel

A new upper bound of 0.6126 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.

Bruce E. Hajek | Rene L. Cruz | B. Hajek | R. Cruz

[1] J. Massey. Collision-Resolution Algorithms and Random-Access Communications , 1981 .

[2] Bruce E. Hajek,et al. Information of partitions with applications to random access communications , 1982, IEEE Trans. Inf. Theory.

[3] Jeannine Mosely,et al. An efficient contention resolution algorithm for multiple access channels , 1979 .

[4] Pierre A. Humblet. Bounds on the Utilization of Aloha-Like Multiple-Access Broadcast Channels , 1980 .

[5] Toby Berger,et al. The Poisson Multiple-Access Conflict Resolution Problem , 1981 .

[6] Nicholas Pippenger,et al. Bounds on the performance of protocols for a multiple-access broadcast channel , 1981, IEEE Trans. Inf. Theory.

[7] John Capetanakis,et al. Tree algorithms for packet broadcast channels , 1979, IEEE Trans. Inf. Theory.

[8] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.

[9] Mart Molle,et al. On the capacity of infinite population multiple access protocols , 1982, IEEE Trans. Inf. Theory.