Title :
LCR: a linear conflict resolution algorithm for local/metropolitan area networks
Author :
Waramahaputi, J. ; Thanawastien, S.
Author_Institution :
Univ. of Southhwestern Louisiana, Lafayette, LA, USA
Abstract :
A protocol for unidirectional broadcast bus networks, called linear conflict resolution (LCR), is introduced. This protocol is shown to be suitable for both local-area-network and metropolitan-area-network environments. It is shown that not only could the maximum throughput of LCR be increased toward 100%, but also the network is able in that the delay is finite for all the operating conditions, and 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, and, in general, its capacity is better than the capacities of the 13 existing protocols mentioned. The LCR protocol is particularly well suited for a fiber-optic local area network or metropolitan area network which is relatively long with a very high bandwidth and a large user population.<>
Keywords :
broadband networks; channel capacity; computer networks; data communication systems; delays; local area networks; optical links; performance evaluation; protocols; LAN; LCR protocol; MAN; bus characteristics; channel capacity; delay; fiber-optic local area network; large user population; linear conflict resolution algorithm; maximum throughput; metropolitan area networks; operating conditions; protocol; unidirectional broadcast bus networks; very high bandwidth; Access protocols; Broadcasting; Computer networks; Local area networks; Metropolitan area networks; Optical fiber LAN; Optical fibers; Propagation delay; Throughput; Topology;
Conference_Titel :
Computer Networking Symposium, 1988., Proceedings of the
Conference_Location :
Washington, DC, USA
Print_ISBN :
0-8186-0835-8
DOI :
10.1109/CNS.1988.5014