Skip to main content

Efficiency of Dynamic Arbitration in TDMA Protocols

  • Conference paper
Dependable Computing - EDCC 5 (EDCC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 3463))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bauer, G., Frenning, T., Jonsson, A.-K., Kopetz, H.A.: Centralized Approach for Avoiding the Babbling-Idiot Failure in the Time-Triggered Architecture. In: ICDSN 2000, New York, NY, USA (2000)

    Google ScholarĀ 

  2. Bauer, G., Kopetz, H., Steiner, W.: Byzantine Fault Containment in TTP/C. In: Proceedings 2002 Intl. Workshop on Real-Time LANs in the Internet Age (RTLIA 2002), pp. 13ā€“16 (2002)

    Google ScholarĀ 

  3. Peller, M., Berwanger, J., Griebach, R.: Byteflight ā€“ A New High-Performance Data Bus System for Safety-Related Applications. BMW AG, EE-211 Development Safety Systems Electronics (2000)

    Google ScholarĀ 

  4. The FlexRay Consortium, FlexRay Communications System ā€“ Protocol Specification V2.0, http://www.flexray.com

  5. The FlexRay Consortium, Bus Guardian Specification V2.0, http://www.flexray.com

  6. FĆ¼hrer, T., et al.: Time-triggered Communication on CAN (Time-triggered CAN ā€“ TTCAN). In: Proceedings of ICC 2000, Amsterdam, The Netherlands (2000)

    Google ScholarĀ 

  7. Heiner, G., Thurner, T.: Time-Triggered Architecture for Safety-Related Distributed Real-Time Systems in Transportation Systems. In: Digest of Papers. In The 28th IEEE Intā€™l Symp. on Fault-Tolerant Computing Systems, Munich, Germany,

    Google ScholarĀ 

  8. Kopetz, H., Gruensteidl, G.: TTP - A time-triggered protocol for fault-tolerant real-time systems. In: Proceedings 23rd International Symposium on Fault-Tolerant Computing, pp. 524ā€“532 (1993)

    Google ScholarĀ 

  9. Kopetz, H.: The Time-Triggered Approach to Real-Time System Design. In: Randell, B., Laprie, J.-C., Kopetz, H., Littlewood, B. (eds.) Predictably Dependable Computing Systems, Basic Research Series, pp. 53ā€“66. Springer, Heidelberg (1995)

    Google ScholarĀ 

  10. Kopetz, H.: Real Time Systems - Design Principles for Distributed Embedded Applications. Kluwer Academic Publishers, Dordrecht (1997)

    MATHĀ  Google ScholarĀ 

  11. Kopetz, H.: A Comparison of TTP/C and FlexRay Research Report 10/2001 Institut fĆ¼r Technische Informatik, Technische UniversitƤt Wien, Austria

    Google ScholarĀ 

  12. Kopetz, H., Bauer, G., Poledna, S.: Tolerating Arbitrary Node Failures in the Time-Triggered Architecture. In: SAE 2001 World Congress, Detroit, MI, USA (March 2001)

    Google ScholarĀ 

  13. Lisner, J.C.: A Flexible Slotting Scheme for TDMA-Based Protocols. In: Workshop Proceedings, ARCS 2004, Augsburg, March 26, pp. 54ā€“65 (2004)

    Google ScholarĀ 

  14. MĆ¼ller, B., et al.: Proceedings 8th International CAN Conference, Las Vegas, Nv (2002)

    Google ScholarĀ 

  15. Peller, M., Berwanger, J., Griessbach, R.: The byteflight specification, V.0.5, 10/29/1999, BMW AG., http://www.byteflight.com

  16. Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. Journal of the ACMĀ 27(2), 228ā€“234 (1980)

    ArticleĀ  MATHĀ  MathSciNetĀ  Google ScholarĀ 

  17. Rushby, J.: Systematic Formal Verification for Fault-Tolerant Time-Triggered Algorithms. In: Proc. DCCA 6, Garmisch, Germany, pp. 191ā€“210. IEEE Press, Los Alamitos (Preprints)

    Google ScholarĀ 

  18. Rushby, J.: A Comparison of Bus Architectures for Safety-Critical Embedded Systems CSL Technical Report, SRI International (2001)

    Google ScholarĀ 

  19. Temple, C.: Avoiding the Babbling-Idiot Failure in a Time-Triggered Communication System. In: Fault Tolerant Computing Symposium 28, Munich, Germany, pp. 218ā€“227. IEEE Computer Society, Los Alamitos (June 1998)

    Google ScholarĀ 

  20. Temple, C.: Enforcing Error Containment in Distributed Time-Triggered Systems: The Bus Guardian Approach PhD Thesis, Inst. f. Techn. Informatik, Vienna University of Technology

    Google ScholarĀ 

  21. TTTech, Time-Triggered Protocol TTP/C ā€“ High Level Specification Document - Protocol Version 1.1, ed.1.4.3, November 19 (2003), http://www.tttech.com

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

Ā© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lisner, J.C. (2005). Efficiency of Dynamic Arbitration in TDMA Protocols. In: Dal Cin, M., KaĆ¢niche, M., Pataricza, A. (eds) Dependable Computing - EDCC 5. EDCC 2005. Lecture Notes in Computer Science, vol 3463. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11408901_7

Download citation

  • DOI: https://doi.org/10.1007/11408901_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25723-3

  • Online ISBN: 978-3-540-32019-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics