Fault-tolerant Transmission of  Messages of Differing Criticalities Across a Shared Communication Media

Kunal  Agrawa; Sanjoy Baruah; Alan Burns

Fault-tolerant Transmission of Messages of Differing Criticalities Across a Shared Communication Media

Kunal Agrawa, Sanjoy Baruah, Alan Burns

Computer Science

Research output: Contribution to conference › Paper › peer-review

Abstract

We discuss the motivation behind, and the design and analysis of, an algorithm for synthesizing communication schedules for shared media networks in some safety-critical hard-real-time applications such as autonomous navigation and factory automation. Communication media may be inherently noisy in many such environments, and occasional transmission errors hence inevitable. Therefore it is essential that some degree of fault-tolerance be built into the communication protocol that is used - in some safety-critical application domains, fault-tolerance requirements may be mandated by statutory certification requirements. Since the severity of the consequences of failing to successfully transmit different messages may be different, we consider a mixed-criticality setting in which the fault-tolerance requirement specification for messages are dependent on their criticality: more critical messages are required to be able to tolerate a larger number of faults.
We advocate that communication schedules be as static as possible in safety-critical applications in order to facilitate verification and validation, and discuss the synthesis of semi-static schedules - schedules that are driven by precomputed lookup tables - with the desired fault-tolerance properties for such applications.

Original language	English
Publication status	Published - 1 Aug 2019
Event	Real-Time Networks and Systems - Toulouse, France Duration: 6 Nov 2019 → 8 Nov 2019

Conference

Conference	Real-Time Networks and Systems
Abbreviated title	RTNS
Country/Territory	France
City	Toulouse
Period	6/11/19 → 8/11/19

Bibliographical note

This is an author-produced version of the published paper. Uploaded in accordance with the publisher’s self-archiving policy. Further copying may not be permitted; contact the publisher for details.

Access to Document

00main
This is an author-produced version of the published paper. Uploaded in accordance with the publisher’s self-archiving policy. Further copying may not be permitted; contact the publisher for details.
Accepted author manuscript, 792 KBLicence: Unspecified

Cite this

@conference{460204a187034ae1a7e3e6c3b97ea86c,

title = "Fault-tolerant Transmission of Messages of Differing Criticalities Across a Shared Communication Media",

abstract = "We discuss the motivation behind, and the design and analysis of, an algorithm for synthesizing communication schedules for shared media networks in some safety-critical hard-real-time applications such as autonomous navigation and factory automation. Communication media may be inherently noisy in many such environments, and occasional transmission errors hence inevitable. Therefore it is essential that some degree of fault-tolerance be built into the communication protocol that is used - in some safety-critical application domains, fault-tolerance requirements may be mandated by statutory certification requirements. Since the severity of the consequences of failing to successfully transmit different messages may be different, we consider a mixed-criticality setting in which the fault-tolerance requirement specification for messages are dependent on their criticality: more critical messages are required to be able to tolerate a larger number of faults.We advocate that communication schedules be as static as possible in safety-critical applications in order to facilitate verification and validation, and discuss the synthesis of semi-static schedules - schedules that are driven by precomputed lookup tables - with the desired fault-tolerance properties for such applications.",

author = "Kunal Agrawa and Sanjoy Baruah and Alan Burns",

note = "This is an author-produced version of the published paper. Uploaded in accordance with the publisher{\textquoteright}s self-archiving policy. Further copying may not be permitted; contact the publisher for details. ; Real-Time Networks and Systems, RTNS ; Conference date: 06-11-2019 Through 08-11-2019",

year = "2019",

month = aug,

day = "1",

language = "English",

}

TY - CONF

T1 - Fault-tolerant Transmission of Messages of Differing Criticalities Across a Shared Communication Media

AU - Agrawa, Kunal

AU - Baruah, Sanjoy

AU - Burns, Alan

N1 - This is an author-produced version of the published paper. Uploaded in accordance with the publisher’s self-archiving policy. Further copying may not be permitted; contact the publisher for details.

PY - 2019/8/1

Y1 - 2019/8/1

N2 - We discuss the motivation behind, and the design and analysis of, an algorithm for synthesizing communication schedules for shared media networks in some safety-critical hard-real-time applications such as autonomous navigation and factory automation. Communication media may be inherently noisy in many such environments, and occasional transmission errors hence inevitable. Therefore it is essential that some degree of fault-tolerance be built into the communication protocol that is used - in some safety-critical application domains, fault-tolerance requirements may be mandated by statutory certification requirements. Since the severity of the consequences of failing to successfully transmit different messages may be different, we consider a mixed-criticality setting in which the fault-tolerance requirement specification for messages are dependent on their criticality: more critical messages are required to be able to tolerate a larger number of faults.We advocate that communication schedules be as static as possible in safety-critical applications in order to facilitate verification and validation, and discuss the synthesis of semi-static schedules - schedules that are driven by precomputed lookup tables - with the desired fault-tolerance properties for such applications.

AB - We discuss the motivation behind, and the design and analysis of, an algorithm for synthesizing communication schedules for shared media networks in some safety-critical hard-real-time applications such as autonomous navigation and factory automation. Communication media may be inherently noisy in many such environments, and occasional transmission errors hence inevitable. Therefore it is essential that some degree of fault-tolerance be built into the communication protocol that is used - in some safety-critical application domains, fault-tolerance requirements may be mandated by statutory certification requirements. Since the severity of the consequences of failing to successfully transmit different messages may be different, we consider a mixed-criticality setting in which the fault-tolerance requirement specification for messages are dependent on their criticality: more critical messages are required to be able to tolerate a larger number of faults.We advocate that communication schedules be as static as possible in safety-critical applications in order to facilitate verification and validation, and discuss the synthesis of semi-static schedules - schedules that are driven by precomputed lookup tables - with the desired fault-tolerance properties for such applications.

M3 - Paper

T2 - Real-Time Networks and Systems

Y2 - 6 November 2019 through 8 November 2019

ER -