On fault tolerance and worst-case response time analysis in CAN
Identifieur interne : 002416 ( Crin/Checkpoint ); précédent : 002415; suivant : 002417On fault tolerance and worst-case response time analysis in CAN
Auteurs : Nicolas Navet ; Ye-Qiong SongSource :
English descriptors
- KwdEn :
Abstract
In this paper we propose an error model following a generalized Poisson process and enabling us to consider both single and "bursty" transmission errors. We deal with the worst-case deadline failure probability (WCDFP) evaluation in CAN. Worst-case means that the message transmission takes the maximum possible time and each error introduces a retransmission with the maximum overhead. The motivation of this work is that, in practice, the number of errors occurring during a given time period can not always be bounded, especially in the applications we consider (CAN used as an in-vehicle network). A method for efficiently computing, for each message, the WCDFP is presented. This method is general in the sense that it enables us to consider all possible burst-size distributions. We applied our analysis to an industrial case-study to estimate its reliability.
Links toward previous steps (curation, corpus...)
Links to Exploration step
CRIN:navet98dLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="171">On fault tolerance and worst-case response time analysis in CAN</title>
</titleStmt>
<publicationStmt><idno type="RBID">CRIN:navet98d</idno>
<date when="1998" year="1998">1998</date>
<idno type="wicri:Area/Crin/Corpus">002285</idno>
<idno type="wicri:Area/Crin/Curation">002285</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">002285</idno>
<idno type="wicri:Area/Crin/Checkpoint">002416</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">002416</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">On fault tolerance and worst-case response time analysis in CAN</title>
<author><name sortKey="Navet, Nicolas" sort="Navet, Nicolas" uniqKey="Navet N" first="Nicolas" last="Navet">Nicolas Navet</name>
</author>
<author><name sortKey="Song, Ye Qiong" sort="Song, Ye Qiong" uniqKey="Song Y" first="Ye-Qiong" last="Song">Ye-Qiong Song</name>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>CAN</term>
<term>distributed systems</term>
<term>performance evaluation</term>
<term>real-time</term>
<term>reliability</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en" wicri:score="1840">In this paper we propose an error model following a generalized Poisson process and enabling us to consider both single and "bursty" transmission errors. We deal with the worst-case deadline failure probability (WCDFP) evaluation in CAN. Worst-case means that the message transmission takes the maximum possible time and each error introduces a retransmission with the maximum overhead. The motivation of this work is that, in practice, the number of errors occurring during a given time period can not always be bounded, especially in the applications we consider (CAN used as an in-vehicle network). A method for efficiently computing, for each message, the WCDFP is presented. This method is general in the sense that it enables us to consider all possible burst-size distributions. We applied our analysis to an industrial case-study to estimate its reliability.</div>
</front>
</TEI>
<BibTex type="inproceedings"><ref>navet98d</ref>
<crinnumber>98-R-120</crinnumber>
<category>3</category>
<equipe>TRIO</equipe>
<author><e>Navet, Nicolas</e>
<e>Song, Ye-Qiong</e>
</author>
<title>On fault tolerance and worst-case response time analysis in CAN</title>
<booktitle>{23nd IFAC/IFIP Workshop on Real-Time Programming, Shantou, China}</booktitle>
<year>1998</year>
<month>jun</month>
<keywords><e>distributed systems</e>
<e>real-time</e>
<e>CAN</e>
<e>performance evaluation</e>
<e>reliability</e>
</keywords>
<abstract>In this paper we propose an error model following a generalized Poisson process and enabling us to consider both single and "bursty" transmission errors. We deal with the worst-case deadline failure probability (WCDFP) evaluation in CAN. Worst-case means that the message transmission takes the maximum possible time and each error introduces a retransmission with the maximum overhead. The motivation of this work is that, in practice, the number of errors occurring during a given time period can not always be bounded, especially in the applications we consider (CAN used as an in-vehicle network). A method for efficiently computing, for each message, the WCDFP is presented. This method is general in the sense that it enables us to consider all possible burst-size distributions. We applied our analysis to an industrial case-study to estimate its reliability.</abstract>
</BibTex>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002416 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Checkpoint/biblio.hfd -nk 002416 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Crin |étape= Checkpoint |type= RBID |clé= CRIN:navet98d |texte= On fault tolerance and worst-case response time analysis in CAN }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |