Demand Assignment Multiple Access Schemes in Broadcast Bus Local Area Networks

Authors:
M. Fine;F. A. Tobagi
Affiliations:
Computer Systems Laboratory, Department of Electrical Engineering, Stanford University;-
Venue:
IEEE Transactions on Computers
Year:
1984

Citing 0
Cited 7

Performance Models of Asynchronous Multitrunk HYPERchannel Networks

IEEE Transactions on Computers
A bus network designed to support parallel processing

ACM '87 Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow
New Energy-Efficient Permutation Routing Protocol for Single-Hop Radio Networks

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
A novel cognitive networking scenario for IEEE 802.16 networks

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Acm sigcomm: Acknowledgement techniques of random access based media access protocols for a WDM photonic environment

Computer Communications
Protocols: Twin-bus-controller protocol for fibre optic networks

Computer Communications
Research: Probabilistic reservation protocol for high-speed unidirectional bus networks

Computer Communications

Quantified Score

Hi-index	14.98

Visualization

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.