The linear conflict resolution algorithm for unidirectional broadcast bus networks

J. Waramahaputi, S. Thanawastien
{"title":"The linear conflict resolution algorithm for unidirectional broadcast bus networks","authors":"J. Waramahaputi, S. Thanawastien","doi":"10.1109/INFCOM.1988.12925","DOIUrl":null,"url":null,"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.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.1988.12925","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

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.<>
单向广播总线网络的线性冲突解决算法
介绍了一种单向广播总线网络的线性冲突解决(LCR)协议。该协议被证明适用于局域网和城域网环境。LCR结合了Aloha协议的快速访问和TDMA(时分多址)的确定性访问的优点。不仅使LCR的最大吞吐量提高到接近100%,而且网络在所有运行条件下的延迟都是有限的,因此网络是稳定的。与大多数现有协议相比,LCR协议的信道容量对总线特性的敏感性较低。数值结果表明,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学术文献互助群
群 号:481959085
Book学术官方微信