Throughput and delay analysis for a new efficient CSMA/CD based protocol

H. Barghi, J. Bredeson, W. Cronenwett
{"title":"Throughput and delay analysis for a new efficient CSMA/CD based protocol","authors":"H. Barghi, J. Bredeson, W. Cronenwett","doi":"10.1109/SSST.1990.138140","DOIUrl":null,"url":null,"abstract":"The authors describe a two-channel reservation network with priority access (TCRN/PA) that uses both channels and advance reservation to increase network throughput with shorter delay than carrier-sense multiple access with collision detection (CSMA-CD). A contention channel (C-channel) carriers the reservation broadcasts while a data channel (D-channel) delivers the transmitted data. Each D-channel transmission is restricted to a limited number of data packets so that no one station dominates the channel. Each station limits the number of unsuccessful attempts to transmit each C-channel request packet to 20. Data packets sent to each station for transmission are ranked according to their arrival time, with older data sent at higher priority. The performance of TCRN/PA is compared with that of CSMA-CD-based networks, such as SRMA and ring and polling networks, for identical system bandwidths and is found to give greater throughput, as well as shorter delay, particularly at high throughputs.<<ETX>>","PeriodicalId":201543,"journal":{"name":"[1990] Proceedings. The Twenty-Second Southeastern Symposium on System Theory","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1990] Proceedings. The Twenty-Second Southeastern Symposium on System Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSST.1990.138140","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

The authors describe a two-channel reservation network with priority access (TCRN/PA) that uses both channels and advance reservation to increase network throughput with shorter delay than carrier-sense multiple access with collision detection (CSMA-CD). A contention channel (C-channel) carriers the reservation broadcasts while a data channel (D-channel) delivers the transmitted data. Each D-channel transmission is restricted to a limited number of data packets so that no one station dominates the channel. Each station limits the number of unsuccessful attempts to transmit each C-channel request packet to 20. Data packets sent to each station for transmission are ranked according to their arrival time, with older data sent at higher priority. The performance of TCRN/PA is compared with that of CSMA-CD-based networks, such as SRMA and ring and polling networks, for identical system bandwidths and is found to give greater throughput, as well as shorter delay, particularly at high throughputs.<>
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种新的高效CSMA/CD协议的吞吐量和延迟分析
作者描述了一种具有优先访问的双通道预约网络(TCRN/PA),它同时使用通道和提前预约,以比具有冲突检测的载波感知多址(CSMA-CD)更短的延迟提高网络吞吐量。争用信道(c信道)传送保留广播,而数据信道(d信道)传送传输的数据。每个d通道传输被限制为有限数量的数据包,因此没有一个站控制该通道。每个站将传输每个c通道请求包的失败尝试次数限制为20次。发送到每个站点进行传输的数据包根据其到达时间进行排序,发送较老的数据的优先级较高。在相同的系统带宽下,将TCRN/PA的性能与基于csma - cd的网络(如SRMA和环轮询网络)的性能进行了比较,发现TCRN/PA具有更大的吞吐量和更短的延迟,特别是在高吞吐量时。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Using singular values for model reduction of flexible structures Synthesis of series/parallel RLC one-port networks Fault tolerant motor drives for powered wheelchairs A scheduling scheme for communicating tasks Computer simulation and experimental verification of a metal forming process
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1