A collision resolution algorithm for random-access channels with echo

Authors:
F. Borgonovo;L. Fratta
Affiliations:
CSTS-CNR Istituto di Elettronica - Politecnico di Milano, Piazza Leonardo da Vinci, 32-20133 Milano, Italy;CSTS-CNR Istituto di Elettronica - Politecnico di Milano, Piazza Leonardo da Vinci, 32-20133 Milano, Italy
Venue:
ACM SIGCOMM Computer Communication Review
Year:
1983

Citing 1
Cited 0

THE ALOHA SYSTEM: another alternative for computer communications

AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper random access algorithms for packet broadcast channels are considered. It is shown that utilizing channels with a central repeater as for instance a satellite channel more information is available to resolve conflicts than that utilized in Capetanakis type tree algorithms. Based on this extra information, a new class of collision resolution algorithms is presented. Only preliminary results on maximum achievable trhoughput are given and it is shown that this can approach. 673.