Issue No. 04 - April (1997 vol. 46)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.588061
<p><b>Abstract</b>—The multiple access problem as characterized by infinite user population and a slotted-time channel is examined, and an algorithm that utilizes a control mini-slot is proposed. The stability region of the proposed algorithm is determined and compared to the random access algorithm with the highest known throughput. A break-even point is also given.</p>
D. Kazakos, H. Deliç and L. F. Merakos, "Random Multiple Access Algorithms Using a Control Mini-Slot," in IEEE Transactions on Computers, vol. 46, no. , pp. 473-476, 1997.