Hard real-time scheduling protocol in Ethernet networks

被引:0
作者
Ouni, S [1 ]
Kamoun, F [1 ]
机构
[1] ENSI, INSAT, CRISTAL Lab, Tunis, Tunisia
来源
6TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL XI, PROCEEDINGS: COMPUTER SCIENCE II | 2002年
关键词
Ethernet; CSMA/CD; Hard Real-Time communications; EDF; deadline; Real-Time message guarantee;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
For a long time, Ethernet has been supposed to be not suitable for Hard Real-Time communications as industrial process controls. The Ethernet Multiple Access Control (CSMA/CD) nature makes impossible to guarantee a deterministic medium access time. Hence, message delivery deadlines can't be guaranteed. In this paper, we make a novel approach to establish predictable message transfer under Ethernet networks. We propose a new Ethernet Access protocol called : EDF-CSMA which is inspired from the optimal scheduling centralized algorithm EDF (Earliest Deadline First). This protocol compatible with CSMA, gives guarantee prediction to Real-Time messages and performs better guarantee results than protocols in previous works. In deed, we prove the efficiency of our protocol by simulations and comparisons to others Hard Real-Time communication protocols for Ethernet such as: CSMA-DCR, DOD-CSMA/CD, VTCSMA and RTCC.
引用
收藏
页码:349 / 355
页数:7
相关论文
共 15 条
[1]  
HAN CC, 1995, REAL TIM TECHN APPL, P86
[2]   A protocol and correctness proofs for real-time high-performance broadcast networks [J].
Hermant, JF ;
Le Lann, G .
18TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS, 1998, :360-369
[3]  
HERMANT JF, 1996, 9 IEEE ISCA INT C PA, P413
[4]  
KAISER J, 2000, 4 INT C ALG ARCH PAR
[5]  
LANN G, 1993, 1863 INRIA
[6]   THE TIMED-TOKEN PROTOCOL FOR REAL-TIME COMMUNICATIONS [J].
MALCOLM, N ;
ZHAO, W .
COMPUTER, 1994, 27 (01) :35-41
[7]  
MALCOLM N, 1995, REAL-TIME SYST, V9, P75
[8]  
OUNI S, 1999, INT C CAN 1999 IT 2
[9]  
SPURI M, 1996, 2873 INRIA
[10]  
SPURI M, 1995, THESIS PISA