Name
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. |
Year | DOI | Venue |
|---|---|---|
1983 | 10.1145/1015608.1015610 | ACM SIGCOMM Computer Communication Review |
Keywords | DocType | Volume |
paper random access algorithm,capetanakis type tree algorithm,satellite channel,collision resolution algorithm,maximum achievable trhoughput,random-access channel,extra information,preliminary result,central repeater,new class,packet broadcast channel,random access | Journal | 13 |
Issue | Citations | PageRank |
1 | 2 | 0.44 |
References | Authors | |
5 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| F. Borgonovo | 1 | 217 | 47.38 |
| L. Fratta | 2 | 559 | 218.26 |