TY - GEN
T1 - Simulation and Verification of an Improved Membership Fault-Tolerant Service in TTP/C
AU - Zhao, Yuchen
AU - Li, Qiao
AU - Shi, Qidong
AU - Wang, Tong
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - Time-Triggered Protocol (TTP) bus is a kind of multiple accessing bus with fault-tolerance mechanism for real-time communications, e.g. for distributed control systems. Fault-tolerance for the Group Membership service of TTP/C can be comprehensively verified by running a suite of simulation models, which designed and operated with the TTP's distributed clock synchronization mechanism, and implemented under MAT-LAB/Simulink/SimEvents environment. The original membership fault-tolerant service (MFS) algorithm can provide fault-tolerant service guarantees for nodes that access the bus in exclusive time slots regardless sharing slots. On the other side, an improved membership fault-tolerant service (IMFS) algorithm is presented to guarantee nodes with bus access in multiplexed time slots and is designed to be compatible with nodes with bus access in exclusive time slots. During bus accessing, the IMFS algorithm can rejoin any node that has a transient failure in the membership within a bounded time interval; the IMFS algorithm can also block any node that occurs a permanent failure while keeping the other nodes' normal bus accessing. Case studies and simulation results show that our IMFS algorithm is compatible with the MFS algorithm, either with multiplexed time slots or without it, and has lower amount of packet losses.
AB - Time-Triggered Protocol (TTP) bus is a kind of multiple accessing bus with fault-tolerance mechanism for real-time communications, e.g. for distributed control systems. Fault-tolerance for the Group Membership service of TTP/C can be comprehensively verified by running a suite of simulation models, which designed and operated with the TTP's distributed clock synchronization mechanism, and implemented under MAT-LAB/Simulink/SimEvents environment. The original membership fault-tolerant service (MFS) algorithm can provide fault-tolerant service guarantees for nodes that access the bus in exclusive time slots regardless sharing slots. On the other side, an improved membership fault-tolerant service (IMFS) algorithm is presented to guarantee nodes with bus access in multiplexed time slots and is designed to be compatible with nodes with bus access in exclusive time slots. During bus accessing, the IMFS algorithm can rejoin any node that has a transient failure in the membership within a bounded time interval; the IMFS algorithm can also block any node that occurs a permanent failure while keeping the other nodes' normal bus accessing. Case studies and simulation results show that our IMFS algorithm is compatible with the MFS algorithm, either with multiplexed time slots or without it, and has lower amount of packet losses.
KW - Bus communications
KW - Group membership Service
KW - TDMA
KW - Time Triggered Protocol
UR - https://www.scopus.com/pages/publications/85179504261
U2 - 10.1109/IECON51785.2023.10311671
DO - 10.1109/IECON51785.2023.10311671
M3 - 会议稿件
AN - SCOPUS:85179504261
T3 - IECON Proceedings (Industrial Electronics Conference)
BT - IECON 2023 - 49th Annual Conference of the IEEE Industrial Electronics Society
PB - IEEE Computer Society
T2 - 49th Annual Conference of the IEEE Industrial Electronics Society, IECON 2023
Y2 - 16 October 2023 through 19 October 2023
ER -