Www.tttech.com Copyright © 2009, TTTech Computertechnik AG. All rights reserved; may be published with permission by MAPLD 2009 Reliable Synchronization.

Slides:



Advertisements
Similar presentations
CSE 413: Computer Networks
Advertisements

Ethernet Switch Features Important to EtherNet/IP
Review of Topology and Access Techniques / Switching Concepts BSAD 141 Dave Novak Sources: Network+ Guide to Networks, Dean 2013.
Distributed Processing, Client/Server and Clusters
LTE-A Carrier Aggregation
Packet Switching COM1337/3501 Textbook: Computer Networks: A Systems Approach, L. Peterson, B. Davie, Morgan Kaufmann Chapter 3.
Advantages of Deterministic Ethernet for Space Applications
IEEE 802.1D: Spanning Tree Algorithm and the Filtering Database Ben Schultz Bridge Functions Consortium UNH InterOperability Lab July, 2000.
Review of Topology and Access Techniques / Switching Concepts BSAD 141 Dave Novak Sources: Network+ Guide to Networks, Dean 2013.
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.
Task Scheduling and Distribution System Saeed Mahameed, Hani Ayoub Electrical Engineering Department, Technion – Israel Institute of Technology
Data Stream Managing Unit Final Presentation Advisor : Vitaly Spector Students : Neomi Makleff Hadas Azulay Lab : High Speed Digital Systems.
Internetworking Fundamentals (Lecture #4) Andres Rengifo Copyright 2008.
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.
Architectural Design Principles. Outline  Architectural level of design The design of the system in terms of components and connectors and their arrangements.
Principles for Collaboration Systems Geoffrey Fox Community Grids Laboratory Indiana University Bloomington IN 47404
Connecting LANs, Backbone Networks, and Virtual LANs
Network Topologies.
Protocols and the TCP/IP Suite Chapter 4. Multilayer communication. A series of layers, each built upon the one below it. The purpose of each layer is.
Data Communications and Networks
Chapter 4.  Understand network connectivity.  Peer-to-Peer network & Client-Server network  Understand network topology  Star, Bus & Ring topology.
T. S. Eugene Ngeugeneng at cs.rice.edu Rice University1 COMP/ELEC 429 Introduction to Computer Networks Lecture 8: Bridging Slides used with permissions.
LXI Standard – Current and Future David Owen – Pickering Interfaces TC Chair LXI Consortium LXI – “It’s About Your Time”
Control Over WirelessHART Network S. Han, X. Zhu, Al Mok University of Texas at Austin M. Nixon, T. Blevins, D. Chen Emerson Process Management.
Chapter 2 Network Models
Tiziana Ferrari Quality of Service Support in Packet Networks1 Quality of Service Support in Packet Networks Tiziana Ferrari Italian.
Common Devices Used In Computer Networks
Version 4.0. Objectives Describe how networks impact our daily lives. Describe the role of data networking in the human network. Identify the key components.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 7 Spanning-Tree Protocol Cisco Networking Academy.
Basic LAN techniques IN common with all other computer based systems networks require both HARDWARE and SOFTWARE to function. Networks are often explained.
Connectivity Devices Hakim S. ADICHE, MSc
THE OSI REFERENCE MODEL Open Systems Interconnection (OSI) International Organization for Standardization( ISO)
QoS Support in High-Speed, Wormhole Routing Networks Mario Gerla, B. Kannan, Bruce Kwan, Prasasth Palanti,Simon Walton.
LAN technologies and network topology LANs and shared media Locality of reference Star, bus and ring topologies Medium access control protocols.
The OSI Model.
1 The Internet and Networked Multimedia. 2 Layering  Internet protocols are designed to work in layers, with each layer building on the facilities provided.
TCOM 509 – Internet Protocols (TCP/IP) Lecture 03_b Protocol Layering Instructor: Dr. Li-Chuan Chen Date: 09/15/2003 Based in part upon slides of Prof.
A High Performance Channel Sorting Scheduling Algorithm Based On Largest Packet P.G.Sarigiannidis, G.I.Papadimitriou, and A.S.Pomportsis Department of.
CCNA 3 Week 4 Switching Concepts. Copyright © 2005 University of Bolton Introduction Lan design has moved away from using shared media, hubs and repeaters.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 4 Switching Concepts.
Computer Security Workshops Networking 101. Reasons To Know Networking In Regard to Computer Security To understand the flow of information on the Internet.
Time Triggered Networks: use in space 2015 CCSDS spring SOIS Plenary 23 March 2015 Glenn Rakow/NASA-GSFC.
Sem1 - Module 8 Ethernet Switching. Shared media environments Shared media environment: –Occurs when multiple hosts have access to the same medium. –For.
1 Presented By: Eyal Enav and Tal Rath Eyal Enav and Tal Rath Supervisor: Mike Sumszyk Mike Sumszyk.
SECURING SELF-VIRTUALIZING ETHERNET DEVICES IGOR SMOLYAR, MULI BEN-YEHUDA, AND DAN TSAFRIR PRESENTED BY LUREN WANG.
Advantages of Time-Triggered Ethernet
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 7 Spanning Tree Protocol.
Department of Electronic Engineering City University of Hong Kong EE3900 Computer Networks Protocols and Architecture Slide 1 Use of Standard Protocols.
Data Communications and Networks Chapter 1 - Classification of network topologies Data Communications and Network.
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.
Efficient Gigabit Ethernet Switch Models for Large-Scale Simulation Dong (Kevin) Jin David Nicol Matthew Caesar University of Illinois.
Renesas Electronics America Inc. © 2010 Renesas Electronics America Inc. All rights reserved. Overview of Ethernet Networking A Rev /31/2011.
Ethernet Advanced Chapter 5. Release 16/7/2009 Chapter Objectives Explain 10Base-T network Explain 10Base-FL Explain the rule Identify different.
Timing Analysis of Rate Constrained Traffic for the TTEthernet Communication Protocol Domițian Tămaș-Selicean 1, Paul Pop 1 and Wilfried Steiner 2 1 Technical.
1 Switching and Forwarding Sections Connecting More Than Two Hosts Multi-access link: Ethernet, wireless –Single physical link, shared by multiple.
Cluster Computers. Introduction Cluster computing –Standard PCs or workstations connected by a fast network –Good price/performance ratio –Exploit existing.
Research Unit for Integrated Sensor Systems and Oregano Systems Cern Timing Workshop 2008 Patrick Loschmidt, Georg Gaderer, and Nikolaus Kerö.
FTOP: A library for fault tolerance in a cluster R. Badrinath Rakesh Gupta Nisheeth Shrivastava.
Data Link Protocols Relates to Lab 2.
COMPUTER NETWORKS Lecture-8 Husnain Sherazi. Review Lecture 7  Shared Communication Channel  Locality of Reference Principle  LAN Topologies – Star.
Ethernet Packet Filtering – Part 2 Øyvind Holmeide 10/28/2014 by.
Artificial Intelligence In Power System Author Doshi Pratik H.Darakh Bharat P.
Deterministic Communication with SpaceWire
Chapter 9 Optimizing Network Performance
Networking Devices.
November 18 July 2008 Project: IEEE P Working Group for Wireless Personal Area Networks (WPANs) Submission Title: Task Group 4e definitions Date.
Modeling and Simulation of TTEthernet
DETERMINISTIC ETHERNET FOR SCALABLE MODULAR AVIONICS
Chapter-5 Traffic Engineering.
Time-Triggered Architecture
Presentation transcript:

Copyright © 2009, TTTech Computertechnik AG. All rights reserved; may be published with permission by MAPLD 2009 Reliable Synchronization for Multi-Hop Networks and its Realization in FPGA Wilfried Steiner TTTech Computertechnik AG MAPLD 2009 – Session A CoMMiCS

Page 2 © 2009, TTTech Computertechnik AG. All rights reserved; may be published with permission by MAPLD 2009 Problem Statement 1.Reliable Synchronization 2.Multi-Hop Network Topology 3.TTEthernet - Realization in FPGA 4.Model-Based Development

Copyright © 2009, TTTech Computertechnik AG. All rights reserved; may be published with permission by MAPLD 2009 Reliable Synchronization for Multi-Hop Networks and its Realization in FPGA

Page 4 © 2009, TTTech Computertechnik AG. All rights reserved; may be published with permission by MAPLD 2009 Synchronization Strategy Clock Synchronization Service Startup/Restart Service Clock Synchronization Service is executed during normal operation mode to keep the local clocks synchronized to each other. Startup/Restart Service is executed to reach an initial synchronization of the local clocks in the system. Integration/Reintegration Service is used for components to join an already synchronized system. Clique Detection Services are used to detect loss of synchronization and establishment of disjoint sets of synchronized components.

Page 5 © 2009, TTTech Computertechnik AG. All rights reserved; may be published with permission by MAPLD 2009 Two-Step Clock Synchronization Service For now, let us assume that we operate in a single-hop network:  End Systems operate as Synchronization Masters/Clients.  Switches are configured as Compression Masters. Synchronization Strategy operates in two steps for clock synchronization during normal operation mode. Step1: Synchronization Masters send synchronization messages to Compression Masters. Step2: Compression Masters send synchronization messages back to the Synchronization Masters and Clients.

Page 6 © 2009, TTTech Computertechnik AG. All rights reserved; may be published with permission by MAPLD 2009 Four-Step Startup/Restart Service Step1: Synchronization Masters send out Coldstart Frames (CS) Step2: Compression Masters forward all CS frames to all ports Step3: Each Synchronization Master that receives a CS frame will answer with a Coldstart Acknowledgement Frame (CA) Step4a: Compression Masters will forward all CA frames to all ports (for multiple failure tolerant configurations). Step4b: Compression Masters will forward only one compressed CA frame (for single failure tolerant configurations).

Page 7 © 2009, TTTech Computertechnik AG. All rights reserved; may be published with permission by MAPLD 2009 Formal Verification Activities (Synchronization Strategy) TTEthernet Executable Formal Specification  Using symbolic and bounded model checkers sal-smc and sal-bmc  Focus on Interoperation of Synchronization Services (Startup, Restart, Clique Detection, Clique Resolution, abstract Clock Synchronization) Verification of Lower-Level Synchronization Functions  Permanence Function  verified with the infinite-bounded model checker sal-inf-bmc  using disjunctive invariant and k-induction  Compression Function  verified with the infinite-bounded model checker sal-inf-bmc  using abstraction and 1-induction Formal Methods have been applied as early as in the requirements capturing phase Finalization and Completion of the formal assessment within the CoMMiCS Project  Complexity Management for Mixed-Criticality Systems  European Communities FP7 project [FP7/ ] no ] CoMMiCS

Copyright © 2009, TTTech Computertechnik AG. All rights reserved; may be published with permission by MAPLD 2009 Reliable Synchronization for Multi-Hop Networks and its Realization in FPGA

Page 9 © 2009, TTTech Computertechnik AG. All rights reserved; may be published with permission by MAPLD 2009 TTEthernet in a Nutshell  … is all about smart ways to integrate data flows with different characteristics in a single communication infrastructure.  While various groups started with standard Ethernet and aim at enhancing it with real-time and fault tolerance properties, TTTech comes from the opposite direction:  Our know-how is in real-time and fault-tolerant data flows.  We are applying our know-how on top of Ethernet and optimize our concepts with respect to Ethernet features (switches, full-duplex, etc).  In principle we can enable any carrier protocol with time-triggered technology, … … but there are some good reasons for using Ethernet.

Page 10 © 2009, TTTech Computertechnik AG. All rights reserved; may be published with permission by MAPLD 2009 The Motivation for Ethernet  Ethernet hardware is low cost.  Ethernet is a well-established open-world standard and very scaleable.  The OSI reference model gives a well-structured classification of concepts that can be built on top of Ethernet.  Existing tools can be leveraged as cost-efficient diagnosis tools.  As all messages in TTEthernet are standard Ethernet compliant, existing tools can be leveraged for time-triggered messages as well.  Standard web servers can be leveraged for maintenance and configuration.  TTEthernet allows hosting of IEEE 1588 clock synchronization clients.  Engineers learn about Ethernet at school. Ethernet compatibility enables the usage of technology that is established, tested, and verified.

Page 11 © 2009, TTTech Computertechnik AG. All rights reserved; may be published with permission by MAPLD 2009 Different applications have different communication needs: fault, tolerance, real time, high speed, high bandwidth, low latency, low jitter, active redundancy, hot standby, … TTEthernet provides following traffic classes for applications:  Time-Triggered (TT): Bandwidth in TTEthernet networks can be highly utilized due to the possibility of strictly deterministic (vs. probabilistic) traffic scheduling of high-priority periodic traffic.  Rate-constrained (RC): Event-triggered traffic with priority levels (ARINC 664) and transmission guarantees.  Non-critical standard Ethernet (BE): Low priority traffic (e.g. data download) served during network idle times; can also be scheduled explicitly. Dataflow in TTEthernet TTEthernet allows applications with different communication requirements to share a single physical network.

Page 12 © 2009, TTTech Computertechnik AG. All rights reserved; may be published with permission by MAPLD 2009 TTEthernet Integrated Dataflow Dataflow – Integration - Time-Triggered (TT) - Rate-Constrained (RC) - Standard Ethernet (BE) Protocol Control Frames (PCFs) are transmitted on the same physical network as dataflow.

Page 13 © 2009, TTTech Computertechnik AG. All rights reserved; may be published with permission by MAPLD 2009 Integration Problem When two (or more) messages compete for relay to the same outgoing port, the switch (or ES) has to serialize these messages. If there are messages of same priority the messages will be serviced according First-Come First-Served. What happens if there is a Data message (Data) in relay, when a Protocol Control Frame (PCF) becomes ready for relay?  If a Data message is relayed by a switch when a PCF arrives, the PCF message is delayed until the relay process of the Data message is finished.  Hence, in the worst case the PCF is delayed for a maximum sized Data message (plus other queued PCFs).  Protocol Control Frames record their delay through the network.  All components in the network that impose a delay on a PCF will add this delay into a field in the PCFs.

Page 14 © 2009, TTTech Computertechnik AG. All rights reserved; may be published with permission by MAPLD 2009 Single-Hop Synchronization Flow The (Dispatch, Permanence) – Pair hides the network jitter for PCFs almost entirely. ~constant dynamic

Page 15 © 2009, TTTech Computertechnik AG. All rights reserved; may be published with permission by MAPLD 2009 Multi-Hop Synchronization Flow Multi-hop requires only a small add-on to the existing mechanism: an intermediate switch will not only consume the PCF, but also forward it.

Copyright © 2009, TTTech Computertechnik AG. All rights reserved; may be published with permission by MAPLD 2009 Reliable Synchronization for Multi-Hop Networks and its Realization in FPGA

Page 17 © 2009, TTTech Computertechnik AG. All rights reserved; may be published with permission by MAPLD 2009 Synchronization Master / Client i Protocol Control Frames (PCFs) from the Compression Master flow in from the left. PCFs produced by the Synchronization Master flow out on the right. Filter: removes PCFs that are semantically incorrect (e.g. wrong type, outdated, etc.). Frame Permanence: holds PCFs in buffers until their age equals the configured max. transparent clock value (respecting the transparent clock field as part of their age). Sync State Machine: this module will process all the PCFs that made it past the Frame Permanence module as specified by the synchronization services. In particular this module is in charge of maintaining the local copy of the synchronized cluster time.

Page 18 © 2009, TTTech Computertechnik AG. All rights reserved; may be published with permission by MAPLD 2009 Synchronization Master / Client ii The size of the Synchronization Unit depends upon others on the number of Synchronization Masters that have to be supported. For sixteen Synchronization Masters:  the complete block (incl. interfaces to MACs) takes ~5,000 flip-flops (including diagnostics) and ~7,000 ALUTs  this is 12% and 15%, respectively, of the total size of a 3 channels GBits/s End System controller in an Altera Stratix III FPGA. For four Synchronization Masters:  the block needs ~2,200 flip-flops and ~3,500 ALUTs.

Page 19 © 2009, TTTech Computertechnik AG. All rights reserved; may be published with permission by MAPLD 2009 TTE Evaluation System (2 channels, 1 Gbit/s)

Page 20 © 2009, TTTech Computertechnik AG. All rights reserved; may be published with permission by MAPLD 2009 TTE Evaluation System Takes you from first evaluation steps to full-blown prototypes  4 Linux-based PCs with triple channel TTEthernet capability  Optical Gigabit Ethernet (1000Base-X) compliant interfaces  One or more high-performance TTEthernet switches with 4 ports and configuration, monitoring and diagnostic interfaces  Optical cables supplied for easy connection to existing LAN infrastructure or directly to the user’s development PC (needs 1000Base-X interface)  TTEthernet end system software libraries offering an API (application programming interface) to the TTEthernet protocol hardware  TTEthernet tools for network planning, schedule inspection, and configuration  PC-based monitoring tool supports logging/recording for analysis of network traffic and network-based applications  Power supply VAC  Example application, documentation

Page 21 © 2009, TTTech Computertechnik AG. All rights reserved; may be published with permission by MAPLD 2009 TTEthernet Hardware Products - Summary  TTE Development Switches  TTE Development Switch 1Gbit/s  TTE Development Switch 100Mbit/s  TTE End Systems  TTE End System PCIe  TTE End System PMC  TTE End System XMC  TTE Evaluation Systems  TTE Evaluation System 1Gbit/s  TTE Evaluation System 100 Mbit/s  TTE Test Equipment  TTE Monitoring Switch 1Gbit/s  TTE Monitoring System

Copyright © 2009, TTTech Computertechnik AG. All rights reserved; may be published with permission by MAPLD 2009 Reliable Synchronization for Multi-Hop Networks and its Realization in FPGA Model-Based Development

Page 23 © 2009, TTTech Computertechnik AG. All rights reserved; may be published with permission by MAPLD 2009 TTEthernet Executable Formal Specification i

Copyright © 2009, TTTech Computertechnik AG. All rights reserved; may be published with permission by MAPLD 2009 Reliable Synchronization for Multi-Hop Networks and its Realization in FPGA Summary & Conclusion

Page 25 © 2009, TTTech Computertechnik AG. All rights reserved; may be published with permission by MAPLD 2009 Summary Reliable Synchronization  We showed the two-step clock synchronization service and the four-step startup/restart service and discussed their failure-tolerance capabilities. for Multi-Hop Networks  We discussed the problem of integrating Control-Flow and Dataflow on the same physical network.  We showed that the permanence function is a very simple mean to establish a strong interface with clean semantics for the synchronization services. and its Realization in FPGA  We introduced the conceptual design and discussed the implementation details in an Altera Stratix III FPGA. Model-Based Development  We introduced the Executable Formal Specification and sketched how the worst-case stabilization time of TTEthernet has been calculated.

Page 26 © 2009, TTTech Computertechnik AG. All rights reserved; may be published with permission by MAPLD 2009 QUESTIONS?