TTP and FlexRay. Time Triggered Protocols Global time by fault tolerant clock synchronisation Exact time point of a certain message is known (determinism)

Slides:



Advertisements
Similar presentations
Time-Triggered Protocol
Advertisements

Nilesh Agre Wedashree Jalukar Neelima Shahi Group Members.
Communication Networks Recitation 3 Bridges & Spanning trees.
Ethernet “dominant” LAN technology: cheap $20 for 100Mbs!
Bus Architectures for Satety- Critical Embedded Systems --by Harit Desai.
1 Version 3 Module 8 Ethernet Switching. 2 Version 3 Ethernet Switching Ethernet is a shared media –One node can transmit data at a time More nodes increases.
5/31/05CS118/Spring051 twisted pair hub 10BaseT, 100BaseT, hub r T= Twisted pair (copper wire) r Nodes connected to a hub, 100m max distance r Hub: physical.
CS 582 / CMPE 481 Distributed Systems Fault Tolerance.
1 Version 3 Module 8 Ethernet Switching. 2 Version 3 Ethernet Switching Ethernet is a shared media –One node can transmit data at a time More nodes increases.
2/23/2009CS50901 Implementing Fault-Tolerant Services Using the State Machine Approach: A Tutorial Fred B. Schneider Presenter: Aly Farahat.
Scheduling with Optimized Communication for Time-Triggered Embedded Systems Slide 1 Scheduling with Optimized Communication for Time-Triggered Embedded.
Dave Mills CANbus: A brief introduction Incorporating: The Fujitsu status Dave Mills Queen Mary, University of London.
1 Interconnecting LAN segments Repeaters Hubs Bridges Switches.
The Rare Glitch Project: Verifying Bus Protocols for Embedded Systems Edmund Clarke, Daniel Kroening Carnegie Mellon University.
DATE Optimizations of an Application- Level Protocol for Enhanced Dependability in FlexRay Wenchao Li 1, Marco Di Natale 2, Wei Zheng 1, Paolo Giusto.
Time-Triggered Architectures, Protocols and Applications. P.S. Thiagarajan.
DataLink Layer1 Ethernet Technologies: 10Base2 10: 10Mbps; 2: 200 meters (actual is 185m) max distance between any two nodes without repeaters thin coaxial.
Connecting LANs, Backbone Networks, and Virtual LANs
Network Topologies.
SERIAL BUS COMMUNICATION PROTOCOLS
Lecture 12 Today’s topics –CPU basics Registers ALU Control Unit –The bus –Clocks –Input/output subsystem 1.
Basic Concepts of Computer Networks
Network Design Essentials
ICOM 6115©Manuel Rodriguez-Martinez ICOM 6115 – Computer Networks and the WWW Manuel Rodriguez-Martinez, Ph.D. Lecture 17.
January 23 rd, 2003 The Time-Triggered Architecture Krishnakumar B Institute for Software Integrated Systems Vanderbilt University,
1 Albert Ferrer-Florit, Steve Parkes Space Technology Centre University of Dundee QoS for SpaceWire networks SpW-RT prototyping.
Presentation on Osi & TCP/IP MODEL
Lecture 17 Ethernet r Widely deployed because: m First LAN technology m Simpler and less expensive than token LANs and ATM m Kept up with the speed race:
Introduction1-1 Data Communications and Computer Networks Chapter 5 CS 3830 Lecture 27 Omar Meqdadi Department of Computer Science and Software Engineering.
1 Fault Tolerance in the Nonstop Cyclone System By Scott Chan Robert Jardine Presented by Phuc Nguyen.
Fault Tolerance via the State Machine Replication Approach Favian Contreras.
1 System Models. 2 Outline Introduction Architectural models Fundamental models Guideline.
QoS Support in High-Speed, Wormhole Routing Networks Mario Gerla, B. Kannan, Bruce Kwan, Prasasth Palanti,Simon Walton.
DEVICES AND COMMUNICATION BUSES FOR DEVICES NETWORK
© Oxford University Press 2011 DISTRIBUTED COMPUTING Sunita Mahajan Sunita Mahajan, Principal, Institute of Computer Science, MET League of Colleges, Mumbai.
CSCI 465 D ata Communications and Networks Lecture 19 Martin van Bommel CSCI 465 Data Communications & Networks 1.
1 The Internet and Networked Multimedia. 2 Layering  Internet protocols are designed to work in layers, with each layer building on the facilities provided.
Intro to Network Design
In-Vehicle Communication SAN Group RTS Regular Meeting Presentation December 2008.
Thomas Losert HRTC Meeting 12 September 2002, Vienna Introduction to the TTA.
Chapter 21 Topologies Chapter 2. 2 Chapter Objectives Explain the different topologies Explain the structure of various topologies Compare different topologies.
UNIT -1. DATA COMMUNICATIONS The term telecommunication means communication at a distance. The word data refers to information presented in whatever form.
Lecture 4: Sun: 23/4/1435 Distributed Operating Systems Lecturer/ Kawther Abas CS- 492 : Distributed system & Parallel Processing.
Time Triggered Networks: use in space 2015 CCSDS spring SOIS Plenary 23 March 2015 Glenn Rakow/NASA-GSFC.
1 ACTIVE FAULT TOLERANT SYSTEM for OPEN DISTRIBUTED COMPUTING (Autonomic and Trusted Computing 2006) Giray Kömürcü.
Central Engineering / ASG 74 Data Processing Advanced Studies Sev Gunes-Lasnet, Olivier Notebaert 2008, November 5th Prototype implementation of a routing.
The Principle of Electronic Data Serial and Parallel Data Communication Transmission Rate Bandwidth Bit Rate Parity bits.
Chapter 4 MARIE: An Introduction to a Simple Computer.
Membership and Clique Avoidance in TTP/C Gunther Bauer, Michael Paulitsch Presented by Michael Sirivianos 02/01/2005.
1 Data Link Layer Lecture 23 Imran Ahmed University of Management & Technology.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Connecting Devices CORPORATE INSTITUTE OF SCIENCE & TECHNOLOGY, BHOPAL Department of Electronics and.
Star Topology Star Networks are one of the most common network topologies. consists of one central switch, hub or computer, which acts as a conduit to.
Advantages of Time-Triggered Ethernet
The Network Architecture of the Connection Machine CM-5 Charles E. Leiserson et al (Thinking Machines Corporation) Presented by Eric Carty-Fickes 1/28/04.
1 Layer 2 Technologies Honolulu Community College Cisco Academy Training Center Semester 1 Version
Unit 1 Lecture 4.
Synthesis of Communication Schedules for TTEthernet-based Mixed-Criticality Systems Domițian Tămaș-Selicean 1, Paul Pop 1 and Wilfried Steiner 2 1 Technical.
5: DataLink Layer 5a-1 Bridges and spanning tree protocol Reference: Mainly Peterson-Davie.
EE 122: Lecture 6 Ion Stoica September 13, 2001 (* this talk is based in part on the on-line slides of J. Kurose & K. Rose)
An Introduction to CAN CAN Basics 2 Renesas Interactive
Mohamed Younis CMCS 411, Computer Architecture 1 CMCS Computer Architecture Lecture 26 Bus Interconnect May 7,
Undergraduate course on Real-time Systems Linköping TDDD07 Real-time Systems Lecture 5: Real-time Communication Simin Nadjm-Tehrani Real-time Systems Laboratory.
Network Models. 2.1 what is the Protocol? A protocol defines the rules that both the sender and receiver and all intermediate devices need to follow,
Hubs Hubs are essentially physical-layer repeaters:
Introduction to locality sensitive approach to distributed systems
Overview of Computer Architecture and Organization
CS4470 Computer Networking Protocols
Link Layer and LANs Not everyone is meant to make a difference. But for me, the choice to lead an ordinary life is no longer an option 5: DataLink Layer.
Time-Triggered Architecture
Introduction Communication Modes Transmission Modes
Presentation transcript:

TTP and FlexRay

Time Triggered Protocols Global time by fault tolerant clock synchronisation Exact time point of a certain message is known (determinism) Real time capable, for safety-critical systems Each node gets a time slot in the transmission loop where only it can send a message + No arbitration necessary + No address field – Less flexible

Requirements 1.General Higher bandwidth Fault tolerance Deterministic data transmission with guaranteed latency and minimal jitter. Support for distributed systems Unifications of bus systems within vehicles Composability 2.Automotive Configurable synchronous and asynchronous transmission Support of scaleable redundancy. Prompt error detection and error reporting. Fault-containment at the level of the physical layer. Media-access without arbitration. Support for a fiber-optics and electrical physical layer. Flexibility, expandability and easy configuration in automotive applications.

Requirements (Priorities) TTP/C 1.Security 2.Composability 3.Flexibility FlexRay 1.Flexibility 2.Composability 3.Security

System Structure The CNI (implemented as a Dual Ported RAM) is an interface between the application layer and protocol layer of a TTP node. The TTP/C protocol runs on the TTP/C communication controller Applications run on the host subsystem.

Topology TTP/C FlexRay Bus Star

Nodes TTP FlexRay

Message Transmission TTP Max data field length = 236B MEDL, TDMA round, Cluster cycle Event channel on top of TTP – specified no. of bytes in message reserved –Event triggered protocol can be implemented at a higher level –CNI continues to be defined in temporal domain –Error correction possible –Async traffic protected by BG FlexRay Max data field length = 12B Schedule determined at runtime Event channel in parallel – two recurring intervals (synchronous for high priority & asynchronous for low priority) Asynchronous messages controlled by Byteflight “minislotting” protocol use TDMA strategy protect communication channel with Bus Guardian

Frames TTP FlexRay

Fault Hypothesis (introduction) Fault mode + No. of faults + Fault arrival rate Level 1 and Level 2 faults. FCU ’s and the partitioning strategy Faults can affect – time,value and space Hybrid Fault Model – manifest,symmetric and asymmetric faults. Faults – active or passive Self – checking pairs Fail silence Slightly Off Specification (SOS) Faults Reconfiguration and Reconfiguration rate Never Give Up (NGU) Strategy

Fault Hypothesis (TTP/C) Fault modes: 1.Arbitrary active faults in controllers and the hub of TTA-star 2.Arbitrary passive faults in the guardians and buses of TTA-bus 3.Spatial proximity faults that take out nodes and a hub in TTA-star Maximum faults: TTA adopts a single-fault hypothesis. In more detail, the fault hypothesis of TTA assumes the following numbers of faults. 1.For TTA-bus: in each node either the controller or the bus guardian may fail (but not both). One of the buses may fail. To retain single fault tolerance, at least four controllers and their bus guardians must be nonfaulty, and both buses must be nonfaulty. Provided at least one bus is nonfaulty, the system may be able to continue operation with fewer nonfaulty components. 2.For TTA-star: to retain single fault tolerance, at least four controllers and both hubs must be nonfaulty. Provided at least one hub is nonfaulty, the system may be able to continue operation with fewer nonfaulty components. Fault arrival rate: At most one fault every two rounds

Fault Hypothesis (FlexRay) inferences A node consisting of a microcontroller host, a communication controller, and two bus guardians will be fabricated on a single chip. It appears that all four components will use separate clock oscillators Fault modes: 1.Asymmetric (and presumably, therefore, also arbitrary) faults in controllers for the purposes of clock synchronization 2.Fault modes for other services and components are not described 3.Spatial proximity faults may take out nodes and an entire hub Maximum faults: 1.It appears that a single-fault hypothesis is intended: in each node, at most one bus guardian, or the controller, may be faulty. At most one of the interconnects may be faulty. 2.For clock synchronization, fewer than a third of the nodes may be faulty. Fault arrival rate: The fault arrival rate hypothesis is not described.

Clock Synchronisation Throughput of the bus = tightness of bus schedule = quality of global clock synchronisation = quality of local oscillators + synchronisation algorithm Two classes of synchronisation algorithm –Average based (eg. Welch-Lynch)  “fault tolerant midpoint”  assume n clocks and the maximum number of simultaneous faults to be tolerated is t (3t < n); the fault-tolerant midpoint is the average of the t + 1’st and n – t ‘ th when arranged from smallest to largest –Event based (eg. Srikant-Touleg) Both averaging and event-based algorithms require at least 3a + 1 nodes to tolerate a arbitrary faults.

Clock Sychronisation (TTP/C) Welch-Lynch algorithm for t = 1 does not use dedicated wires, exploits the fact that communication is time triggered by a global schedule. TTP nodes that have accurate clocks are marked with SYF(synchronisation frame) flag in the MEDL and time of these nodes are used for synchronisation. Four registers per node used to maintain most recent accurate clock- difference readings When the current slot has the synchronization field (CS) set in the MEDL, each node runs the synchronization algorithm using the four clock readings stored in its queue.(The largest and smallest discarded) As the TTP algorithm is designed to tolerate one arbitrary (Byzantine) fault in every TDMA round, there must be at least four slots in every TDMA round with the SYF flag set. Group membership service is used to exclude nodes with very faulty clocks

Clock Sychronisation (FlexRay) Welch-Lynch algorithm No membership service No mechanism for detecting faulty nodes No reconfiguration to exclude them To tolerate two arbitrary faults at least –seven nodes (3t + 1) –five disjoint communication paths or three broadcast channels (2t + 1, and t + 1)

Bus Guardian TTP/C Share power supply and physical space with controller Synchronised by start of round signal from controller In TTA-Star BG is moved to hub FlexRay Two guardians per node hence greater cost is a separate FCU that has an independent copy of the schedule and knowledge of the global time mediates message transmission by an interface to an interconnect prevents ‘babbling idiot’ problem

Startup and Restart Failure of system must be detected by bus Restart must be automatic and fast Restart is initiated when an interface detects no activity on any bus line for some interval – interface will then send the ‘wake-up’ signal Components that detect faults in themselves or are notified of a fault perform local restart and self-test.

Startup and Restart TTP/C Use I-frames and C- State data in them If it does not receive one it transmits one itself on any one bus Problem of colliding restarts Problem of bad restarts. FlexRay Difficult to implement with incomplete schedule Difficult to initialise the Welch-Lynch algorithm if faults are present at startup and with no clique avoidance Self stabilising algorithms based on randomization??

Services Basic purpose of these architectures is to build reliable distributed application. Basic services –clock synchronization –time-triggered activation –reliable message delivery Fault tolerant replication –Approximate agreement –Exact agreement the problem of distributing data consistently in presence of fault is variously called interactive consistency –Agreement: all nonfaulty receivers obtain the same message. –Validity: if the transmitter is nonfaulty, then nonfaulty receivers obtain the message actually sent.

Services Implementing interactive consistency –State machine approach (Majority voting) –Master/shadow –Compensation Group membership service –Each node maintains a private membership list –Agreement: the membership lists of all nonfaulty nodes are the same. –Validity: the membership lists of all nonfaulty nodes contain all nonfaulty nodes and atmost one faulty node. –“Clique Avoidance” – maintain agreement, sacrifice validity

Services TTP/C Membership service = Clique Avoidance + Implicit Acknowledgement FlexRay Only clock sychronisation and reliable message delivery