This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
December 1984 (vol. 33 no. 12)
pp. 1130-1159
M. Fine, Computer Systems Laboratory, Department of Electrical Engineering, Stanford University
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.
Index Terms:
token passing, Broadcast bus networks, carrier sensing, local area networks, multiaccess protocols, packet switching, performance, random access
Citation:
M. Fine, F.A. Tobagi, "Demand Assignment Multiple Access Schemes in Broadcast Bus Local Area Networks," IEEE Transactions on Computers, vol. 33, no. 12, pp. 1130-1159, Dec. 1984, doi:10.1109/TC.1984.1676391
Usage of this product signifies your acceptance of the Terms of Use.