A formal method to guarantee a deterministic behaviour of switched Ethernet networks for time-critical applications

2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508) Pub Date : 2004-09-02 DOI:10.1109/CACSD.2004.1393885

J. Georges, Thieny Divoux, É. Rondeau

{"title":"A formal method to guarantee a deterministic behaviour of switched Ethernet networks for time-critical applications","authors":"J. Georges, Thieny Divoux, É. Rondeau","doi":"10.1109/CACSD.2004.1393885","DOIUrl":null,"url":null,"abstract":"The objective of this work is to model a switched Ethernet architecture in order to be able to evaluate the maximum end to end delays. The major interest is to apply these results in an industrial or technical context, where some of the communications are strongly time-constrained. In this paper, we have chosen the network calculus theory, because it enables a good representation of the exchanges between the equipment which are connected to the network, and also to determine the maximum end to end delays. Previous models presented are improved in order to take into account the implementation of a classification of service (CoS) mechanism which enables to define priorities for the messages regarding the time constraints they have to respect This paper describes a new model of a IEEE 802.1p switch. It also presents the analytical formulas which upper bound the maximum time for crossing such a switch, and an algorithm to determine the maximum end to end delays of the time-critical messages over the whole network. A typical application shows the interest of this approach","PeriodicalId":111199,"journal":{"name":"2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CACSD.2004.1393885","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 11

Abstract

The objective of this work is to model a switched Ethernet architecture in order to be able to evaluate the maximum end to end delays. The major interest is to apply these results in an industrial or technical context, where some of the communications are strongly time-constrained. In this paper, we have chosen the network calculus theory, because it enables a good representation of the exchanges between the equipment which are connected to the network, and also to determine the maximum end to end delays. Previous models presented are improved in order to take into account the implementation of a classification of service (CoS) mechanism which enables to define priorities for the messages regarding the time constraints they have to respect This paper describes a new model of a IEEE 802.1p switch. It also presents the analytical formulas which upper bound the maximum time for crossing such a switch, and an algorithm to determine the maximum end to end delays of the time-critical messages over the whole network. A typical application shows the interest of this approach

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

一种保证时间关键应用中交换以太网的确定性行为的形式化方法

这项工作的目标是建立一个交换以太网架构模型，以便能够评估最大端到端延迟。主要的兴趣是将这些结果应用于工业或技术环境中，其中一些通信受到强烈的时间限制。在本文中，我们选择了网络演算理论，因为它可以很好地表示连接到网络的设备之间的交换，并且还可以确定最大的端到端延迟。为了考虑到服务分类(CoS)机制的实现，对先前提出的模型进行了改进，该机制能够根据消息必须遵守的时间限制来定义消息的优先级。本文描述了IEEE 802.1p交换机的新模型。给出了穿越该开关的最大时间上限的解析公式，以及确定整个网络中时间关键消息的最大端到端延迟的算法。一个典型的应用程序展示了这种方法的好处

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508)

自引率

0.00%

发文量