A simulation study of the predictive p-persistent CSMA protocol

Chen Xiaoming, Hong Geok-Soon
{"title":"A simulation study of the predictive p-persistent CSMA protocol","authors":"Chen Xiaoming, Hong Geok-Soon","doi":"10.1109/SIMSYM.2002.1000172","DOIUrl":null,"url":null,"abstract":"Carrier Sense Media Access (CSMA) protocol is a widely used algorithm to control the access of a computer to the shared media (channel). There are several variants derived from this Media Access Control (MAC) method, such as non-persistent CSMA, 1-persistent CSMA, p-persistent CSMA, and CSMA/CD etc. These algorithms are successful in time-insensitive network, such as Ethernet. But for the fieldbus-based real-time control system that is time-sensitive, they are no longer adequate. To meet the real-time requirements, Echelon Corporation proposed a novel CSMA algorithm, the predictive p-persistent CSMA protocol. In this paper, we evaluate the performance of this protocol by a discrete-event simulation. A node-centric simulation model based on event-driven simulation language - SMPL - is designed using what we call \"FSM-to-EVENT\" method. Also, some techniques are presented to achieve this purpose. Finally, the experiments and results, including the comparison with other protocols, are described.","PeriodicalId":198576,"journal":{"name":"Proceedings 35th Annual Simulation Symposium. SS 2002","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 35th Annual Simulation Symposium. SS 2002","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIMSYM.2002.1000172","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19

Abstract

Carrier Sense Media Access (CSMA) protocol is a widely used algorithm to control the access of a computer to the shared media (channel). There are several variants derived from this Media Access Control (MAC) method, such as non-persistent CSMA, 1-persistent CSMA, p-persistent CSMA, and CSMA/CD etc. These algorithms are successful in time-insensitive network, such as Ethernet. But for the fieldbus-based real-time control system that is time-sensitive, they are no longer adequate. To meet the real-time requirements, Echelon Corporation proposed a novel CSMA algorithm, the predictive p-persistent CSMA protocol. In this paper, we evaluate the performance of this protocol by a discrete-event simulation. A node-centric simulation model based on event-driven simulation language - SMPL - is designed using what we call "FSM-to-EVENT" method. Also, some techniques are presented to achieve this purpose. Finally, the experiments and results, including the comparison with other protocols, are described.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
预测p-persistent CSMA协议的仿真研究
载波感知媒体访问(CSMA)协议是一种广泛使用的算法,用于控制计算机对共享媒体(信道)的访问。这种媒体访问控制(MAC)方法有几种变体,如非持久性CSMA、1-持久性CSMA、p-持久性CSMA和CSMA/CD等。这些算法在时间不敏感网络(如以太网)中是成功的。但对于基于现场总线的时效性较强的实时控制系统来说,这些方法已经不够用了。为了满足实时需求,Echelon公司提出了一种新的CSMA算法——预测性p-persistent CSMA协议。在本文中,我们通过离散事件仿真来评估该协议的性能。采用“FSM-to-EVENT”方法,设计了基于事件驱动仿真语言SMPL的节点中心仿真模型。并提出了实现这一目的的一些技术。最后,对实验结果进行了描述,并与其他协议进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Approximate simulation of distributed-memory multithreaded multiprocessors Scheduling a job mix in a partitionable parallel system Animating 3D facial models with MPEG-4 FaceDefTables Ranking a list of discrete-event models Controlling buffer usage in critical channel traversing
×
引用
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