DocumentCode
1149984
Title
Demand Assignment Multiple Access Schemes in Broadcast Bus Local Area Networks
Author
Fine, Michael ; Tobagi, Fouad A.
Author_Institution
Computer Systems Laboratory, Department of Electrical Engineering, Stanford University
Issue
12
fYear
1984
Firstpage
1130
Lastpage
1159
Abstract
Local area communications networks based on packet broadcasting techniques provide simple architectures and efficient and flexible operation. Various ring systems and CSMA contention bus systems have been in operation for several years. More recently, a number of distributed demand assignment multiple access (DAMA) schemes suitable for broadcast bus networks have emerged which provide conflict-free broadcast communications by means of various scheduling techniques. Among these schemes, the Token-Passing Bus Access method uses explicit tokens, i.e., control messages, to provide the required scheduling. Others use implicit tokens, whereby stations in the network rely on information deduced from the activity on the bus to schedule their transmissions. In this paper we present many implicit-token DAMA schemes in a unified manner grouped according to their basic access mechanisms, and compare them in terms of performance and other important attributes.
Keywords
Broadcast bus networks; carrier sensing; local area networks; multiaccess protocols; packet switching; performance; random access; token passing; Access protocols; Broadcasting; Communication networks; Communication system control; Degradation; Delay; Intelligent networks; Local area networks; Multiaccess communication; Robustness; Broadcast bus networks; carrier sensing; local area networks; multiaccess protocols; packet switching; performance; random access; token passing;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1984.1676391
Filename
1676391
Link To Document