Paper Info
Title
The linear conflict resolution algorithm for unidirectional broadcast bus networks
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
Year
DOI
Venue
1988
10.1109/INFCOM.1988.12925
New Orleans, LA
Keywords
DocType
Citations 
channel capacity,computer networks,protocols,aloha,lan,man,tdma,deterministic access,linear conflict resolution algorithm,metropolitan area network,protocol,unidirectional broadcast bus networks,network topology,optical fibers,conflict resolution,local area networks,operant conditioning,local area network,propagation delay,time division multiple access,broadcasting,throughput
Conference
1
PageRank 
References 
Authors
0.37
10
2
Name
Order
Citations
PageRank
Waramahaputi, J.110.37
Thanawastien, S.210.37