Poisson multiple-access contention with binary feedback
From MaRDI portal
Publication:3216553
DOI10.1109/TIT.1984.1056956zbMath0553.94002MaRDI QIDQ3216553
Publication date: 1984
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
random multiple-accessconfusion resolution algorithmspacket-switched channelPoisson infinite-user model
Related Items (7)
Doubly randomized protocols for a random multiple access channel with ``success-nonsuccess feedback ⋮ On ergodic algorithms in random multiple access systems with ``success-failure feedback ⋮ Spatially decentralized protocols in random multiple access networks ⋮ Solution of a Linear Recurrence Equation Arising in the Analysis of Some Algorithms ⋮ A stack protocol of CTM type with quartet feedback ⋮ A characterization of digital search trees from the successful search viewpoint ⋮ On stability of multiple access systems with minimal feedback
This page was built for publication: Poisson multiple-access contention with binary feedback
