Efficiency of dynamic arbitration in TDMA protocols

Authors:
Jens Chr. Lisner
Affiliations:
University of Duisburg-Essen, Essen, Germany
Venue:
EDCC'05 Proceedings of the 5th European conference on Dependable Computing
Year:
2005

Citing 4
Cited 0

Reaching Agreement in the Presence of Faults

Journal of the ACM (JACM)
Real-Time Systems: Design Principles for Distributed Embedded Applications

Real-Time Systems: Design Principles for Distributed Embedded Applications
Time-Triggered Architecture for Safety-Related Distributed Real-Time Systems in Transportation Systems

FTCS '98 Proceedings of the The Twenty-Eighth Annual International Symposium on Fault-Tolerant Computing
Avoiding the Babbling-Idiot Failure in a Time-Triggered Communication System

FTCS '98 Proceedings of the The Twenty-Eighth Annual International Symposium on Fault-Tolerant Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several existing TDMA-based solutions, which allow dynamic allocation of slots, are using minislotting strategies. Because of this approach they tend to loose bandwidth under some circumstances. Moreover, they cannot guarantee fault tolerance together with dynamic allocation. In [13] the Teaprotocol was introduced, which achieves both flexibility and fault tolerance of a TDMA-based protocol using dynamic media access. This paper shows, that the extension method of Teais also an efficient solution compared to two other arbitration strategies which are implemented in real-world protocols. The agreement-based media allocation in Teaexhibits better utilization of the extra bandwidth which is reserved for dynamic arbitration. Moreover, this paper presents an extension of Teawhich allows for flexible message length which contributes further to efficiency.