Response time guarantees for ATM-networked control systems

Hans Hansson, Mikael Sjödin
{"title":"Response time guarantees for ATM-networked control systems","authors":"Hans Hansson, Mikael Sjödin","doi":"10.1109/WFCS.1997.634301","DOIUrl":null,"url":null,"abstract":"We present the Response-Time Analysis (RTA) method for providing real time guarantees in asynchronous transfer mode (ATM) communication networks, and evaluates its suitability for use in hard real time factory type environments. RTA provides an analysis of the network traffic which can be used by an admission control mechanism to determine if the timing requirements of a new connection can be guaranteed without violating the requirements of already admitted connections. This type of admission control is required by several multimedia and almost all real time control applications. RTA is based on traditional fixed priority/rate monotonic real time CPU schedulability analysis. This makes it possible to combine communication analysis with CPU schedulability analysis, thus allowing system designers to use the same technique for assessing the timely behaviour of the entire system, including both CPU and network scheduling. The only assumption RTA makes about the ATM network is that the switches should be equipped with prioritised output queues, something which is true for many commercial switches. The main focus of the paper is on evaluating RTA. In the evaluation we compare RTA with Weighted Fair Queueing (WFQ) and the Calculus of Network Delays (CND). WFQ is the currently most popular method for providing performance guarantees, and CND provides an alternative analysis for prioritised queueing. The comparison shows that RTA outperforms both WFQ and CND for a set of realistic traffic scenarios.","PeriodicalId":433593,"journal":{"name":"Proceedings 1997 IEEE International Workshop on Factory Communication Systems. WFCS'97","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 1997 IEEE International Workshop on Factory Communication Systems. WFCS'97","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WFCS.1997.634301","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

Abstract

We present the Response-Time Analysis (RTA) method for providing real time guarantees in asynchronous transfer mode (ATM) communication networks, and evaluates its suitability for use in hard real time factory type environments. RTA provides an analysis of the network traffic which can be used by an admission control mechanism to determine if the timing requirements of a new connection can be guaranteed without violating the requirements of already admitted connections. This type of admission control is required by several multimedia and almost all real time control applications. RTA is based on traditional fixed priority/rate monotonic real time CPU schedulability analysis. This makes it possible to combine communication analysis with CPU schedulability analysis, thus allowing system designers to use the same technique for assessing the timely behaviour of the entire system, including both CPU and network scheduling. The only assumption RTA makes about the ATM network is that the switches should be equipped with prioritised output queues, something which is true for many commercial switches. The main focus of the paper is on evaluating RTA. In the evaluation we compare RTA with Weighted Fair Queueing (WFQ) and the Calculus of Network Delays (CND). WFQ is the currently most popular method for providing performance guarantees, and CND provides an alternative analysis for prioritised queueing. The comparison shows that RTA outperforms both WFQ and CND for a set of realistic traffic scenarios.
atm联网控制系统的响应时间保证
我们提出了在异步传输模式(ATM)通信网络中提供实时保证的响应时间分析(RTA)方法,并评估了其在硬实时工厂类型环境中使用的适用性。RTA提供了对网络流量的分析,允许控制机制可以使用它来确定是否可以保证新连接的定时要求,而不违反已经允许的连接的要求。这种类型的准入控制是一些多媒体和几乎所有的实时控制应用程序所需要的。RTA是基于传统的固定优先级/速率单调实时CPU可调度性分析。这使得将通信分析与CPU可调度性分析相结合成为可能,从而允许系统设计者使用相同的技术来评估整个系统的及时行为,包括CPU和网络调度。RTA对ATM网络的唯一假设是交换机应该配备优先输出队列,这对于许多商用交换机来说都是正确的。本文的主要重点是评估RTA。在评估中,我们将RTA与加权公平排队(WFQ)和网络延迟演算(CND)进行了比较。WFQ是目前最流行的提供性能保证的方法,而CND为优先排队提供了另一种分析方法。比较表明,RTA在一组实际的流量场景中优于WFQ和CND。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信