MUST: a quasi-round robin access scheme for CAN networks

G. Cena, A. Valenzano
{"title":"MUST: a quasi-round robin access scheme for CAN networks","authors":"G. Cena, A. Valenzano","doi":"10.1109/WFCS.2000.882534","DOIUrl":null,"url":null,"abstract":"Because of their low implementation costs, optimum responsiveness and widespread availability, controller area networks (CANs) are being more and more used today for supporting communications in real-time systems. However, under heavy traffic conditions, the access protocol of a CAN may exhibit a quite unfair behaviour, in particular when the control applications require that the same quality of service be ensured to a number of different objects. In this paper, a new technique is proposed, called MUST (medium utilisation state tracking), which is based on CANs and introduces few changes to the original protocol. Such a solution is able to ensure a very fair behaviour $which resembles the one obtained in token-based networks - while maintaining, at the same time, the reduced access delays typical of CANs when operating in low traffic conditions.","PeriodicalId":112914,"journal":{"name":"2000 IEEE International Workshop on Factory Communication Systems. Proceedings (Cat. No.00TH8531)","volume":"202 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2000 IEEE International Workshop on Factory Communication Systems. Proceedings (Cat. No.00TH8531)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WFCS.2000.882534","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Because of their low implementation costs, optimum responsiveness and widespread availability, controller area networks (CANs) are being more and more used today for supporting communications in real-time systems. However, under heavy traffic conditions, the access protocol of a CAN may exhibit a quite unfair behaviour, in particular when the control applications require that the same quality of service be ensured to a number of different objects. In this paper, a new technique is proposed, called MUST (medium utilisation state tracking), which is based on CANs and introduces few changes to the original protocol. Such a solution is able to ensure a very fair behaviour $which resembles the one obtained in token-based networks - while maintaining, at the same time, the reduced access delays typical of CANs when operating in low traffic conditions.
MUST: CAN网络的准轮询访问方案
由于其低实施成本,最佳的响应能力和广泛的可用性,控制器局域网(can)越来越多地用于支持实时系统中的通信。然而,在大流量条件下,CAN的访问协议可能会表现出相当不公平的行为,特别是当控制应用程序要求对许多不同的对象保证相同的服务质量时。在本文中,提出了一种新的技术,称为MUST(介质利用率状态跟踪),它是基于can的,并且对原始协议进行了很少的更改。这样的解决方案能够确保非常公平的行为$,类似于在基于令牌的网络中获得的行为$,同时保持在低流量条件下运行时can典型的访问延迟减少。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信