The linear conflict resolution algorithm for unidirectional broadcast bus networks

Author

Waramahaputi, J. ; Thanawastien, S.

Author_Institution

Center for Adv. Comput. Studies, Southwestern Louisiana Univ., Lafayette, LA, USA

fYear

1988

fDate

27-31 Mar 1988

Firstpage

254

Lastpage

263

Abstract

A protocol called linear conflict resolution (LCR) for unidirectional broadcast bus networks is introduced. This protocol is shown to be suitable for both LAN (local area network) and MAN (metropolitan area network) environments. LCR combines the benefits of the quick access of the Aloha protocol and the deterministic access of TDMA (time-division multiple access). Not only could the maximum throughput of LCR be increased to near 100% but also the network is stable in that the delay is finite for all the operating conditions. The channel capacity of the LCR protocol is less sensitive to the bus characteristics than most of the existing protocols. Numerical results indicate that LCR exhibits good performance over a wide range of network sizes

Keywords

channel capacity; computer networks; protocols; Aloha; LAN; MAN; TDMA; channel capacity; deterministic access; linear conflict resolution algorithm; metropolitan area network; protocol; unidirectional broadcast bus networks; Access protocols; Broadcasting; Channel capacity; Computer networks; Local area networks; Network topology; Optical fibers; Propagation delay; Throughput; Time division multiple access;

fLanguage

English

Publisher

ieee

Conference_Titel

INFOCOM '88. Networks: Evolution or Revolution, Proceedings. Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies, IEEE

Conference_Location

New Orleans, LA

Print_ISBN

0-8186-0833-1

Type

conf

DOI

10.1109/INFCOM.1988.12925

Filename

12925