LCR: a linear conflict resolution algorithm for local/metropolitan area networks

J. Waramahaputi, S. Thanawastien
{"title":"LCR: a linear conflict resolution algorithm for local/metropolitan area networks","authors":"J. Waramahaputi, S. Thanawastien","doi":"10.1109/CNS.1988.5014","DOIUrl":null,"url":null,"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.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"413 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1988] Proceedings. Computer Networking Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CNS.1988.5014","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

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.<>
LCR:一种用于本地/城域网的线性冲突解决算法
介绍了一种用于单向广播总线网络的线性冲突解决(LCR)协议。该协议既适用于局域网环境,也适用于城域网环境。结果表明,LCR协议不仅可以将最大吞吐量提高到100%,而且在所有运行条件下,网络的延迟都是有限的,并且与大多数现有协议相比,LCR协议的信道容量对总线特性的敏感性较低。数值结果表明,LCR在广泛的网络规模范围内表现出良好的性能,并且总体上其容量优于上述13种现有协议的容量。LCR协议特别适合于光纤局域网或城域网,这些网络相对较长,带宽非常高,用户数量多。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信