Experimental evaluation of end-to-end delay in switched Ethernet application in the automotive domain

Similar documents
Multimedia CTI Services for Telecommunication Systems

Robust IP and UDP-lite header recovery for packetized multimedia transmission

A Practical Evaluation Method of Network Traffic Load for Capacity Planning

Setup of epiphytic assistance systems with SEPIA

Fault-Tolerant Storage Servers for the Databases of Redundant Web Servers in a Computing Grid

Service Reconfiguration in the DANAH Assistive System

Sliding HyperLogLog: Estimating cardinality in a data stream

NP versus PSPACE. Frank Vega. To cite this version: HAL Id: hal

Tacked Link List - An Improved Linked List for Advance Resource Reservation

Simulations of VANET Scenarios with OPNET and SUMO

Change Detection System for the Maintenance of Automated Testing

Experimental Evaluation of an IEC Station Bus Communication Reliability

Blind Browsing on Hand-Held Devices: Touching the Web... to Understand it Better

Real-Time and Resilient Intrusion Detection: A Flow-Based Approach

BoxPlot++ Zeina Azmeh, Fady Hamoui, Marianne Huchard. To cite this version: HAL Id: lirmm

lambda-min Decoding Algorithm of Regular and Irregular LDPC Codes

Very Tight Coupling between LTE and WiFi: a Practical Analysis

Study on Feebly Open Set with Respect to an Ideal Topological Spaces

Evaluation of Time-Critical Communications for IEC Substation Network Architecture

The Proportional Colouring Problem: Optimizing Buffers in Radio Mesh Networks

Every 3-connected, essentially 11-connected line graph is hamiltonian

Reliability Analysis of Consensus in Cooperative Transport Systems

Throughput prediction in wireless networks using statistical learning

A Resource Discovery Algorithm in Mobile Grid Computing based on IP-paging Scheme

An Experimental Assessment of the 2D Visibility Complex

Moveability and Collision Analysis for Fully-Parallel Manipulators

Branch-and-price algorithms for the Bi-Objective Vehicle Routing Problem with Time Windows

Hardware Acceleration for Measurements in 100 Gb/s Networks

Application of Network Calculus to the TSN Problem Space

Performance Evaluation of Energy Efficient Policies for Ethernet Switches

Relabeling nodes according to the structure of the graph

KeyGlasses : Semi-transparent keys to optimize text input on virtual keyboard

DSM GENERATION FROM STEREOSCOPIC IMAGERY FOR DAMAGE MAPPING, APPLICATION ON THE TOHOKU TSUNAMI

HySCaS: Hybrid Stereoscopic Calibration Software

Catalogue of architectural patterns characterized by constraint components, Version 1.0

Comparison of spatial indexes

Zigbee Wireless Sensor Network Nodes Deployment Strategy for Digital Agricultural Data Acquisition

Representation of Finite Games as Network Congestion Games

Traffic Grooming in Bidirectional WDM Ring Networks

Taking Benefit from the User Density in Large Cities for Delivering SMS

Quality of Service Enhancement by Using an Integer Bloom Filter Based Data Deduplication Mechanism in the Cloud Storage Environment

Structuring the First Steps of Requirements Elicitation

Formal modelling of ontologies within Event-B

YANG-Based Configuration Modeling - The SecSIP IPS Case Study

Comparator: A Tool for Quantifying Behavioural Compatibility

How to simulate a volume-controlled flooding with mathematical morphology operators?

High robustness PNP-based structure for the ESD protection of high voltage I/Os in an advanced smart power technology

The Connectivity Order of Links

Malware models for network and service management

Open Digital Forms. Hiep Le, Thomas Rebele, Fabian Suchanek. HAL Id: hal

Computing and maximizing the exact reliability of wireless backhaul networks

Cloud My Task - A Peer-to-Peer Distributed Python Script Execution Service

The New Territory of Lightweight Security in a Cloud Computing Environment

A million pixels, a million polygons: which is heavier?

Fuzzy sensor for the perception of colour

Real-Time Collision Detection for Dynamic Virtual Environments

An FCA Framework for Knowledge Discovery in SPARQL Query Answers

Implementing an Automatic Functional Test Pattern Generation for Mixed-Signal Boards in a Maintenance Context

DANCer: Dynamic Attributed Network with Community Structure Generator

SDLS: a Matlab package for solving conic least-squares problems

Natural Language Based User Interface for On-Demand Service Composition

Lossless and Lossy Minimal Redundancy Pyramidal Decomposition for Scalable Image Compression Technique

Reverse-engineering of UML 2.0 Sequence Diagrams from Execution Traces

The optimal routing of augmented cubes.

LaHC at CLEF 2015 SBS Lab

Comparison of radiosity and ray-tracing methods for coupled rooms

Generative Programming from a Domain-Specific Language Viewpoint

Linked data from your pocket: The Android RDFContentProvider

An application software download concept for safety-critical embedded platforms

An Efficient Numerical Inverse Scattering Algorithm for Generalized Zakharov-Shabat Equations with Two Potential Functions

Scalewelis: a Scalable Query-based Faceted Search System on Top of SPARQL Endpoints

Teaching Encapsulation and Modularity in Object-Oriented Languages with Access Graphs

SIM-Mee - Mobilizing your social network

Regularization parameter estimation for non-negative hyperspectral image deconvolution:supplementary material

Wireless Networked Control System using IEEE with GTS

Modularity for Java and How OSGi Can Help

ROBUST MOTION SEGMENTATION FOR HIGH DEFINITION VIDEO SEQUENCES USING A FAST MULTI-RESOLUTION MOTION ESTIMATION BASED ON SPATIO-TEMPORAL TUBES

Kernel perfect and critical kernel imperfect digraphs structure

A Measurement-Based Model of Energy Consumption for PLC Modems

A N-dimensional Stochastic Control Algorithm for Electricity Asset Management on PC cluster and Blue Gene Supercomputer

QuickRanking: Fast Algorithm For Sorting And Ranking Data

Linux: Understanding Process-Level Power Consumption

THE COVERING OF ANCHORED RECTANGLES UP TO FIVE POINTS

Primitive roots of bi-periodic infinite pictures

Assisted Policy Management for SPARQL Endpoints Access Control

A Methodology for Improving Software Design Lifecycle in Embedded Control Systems

YAM++ : A multi-strategy based approach for Ontology matching task

MUTE: A Peer-to-Peer Web-based Real-time Collaborative Editor

IntroClassJava: A Benchmark of 297 Small and Buggy Java Programs

Mokka, main guidelines and future

Application-Aware Protection in DWDM Optical Networks

UsiXML Extension for Awareness Support

QoS Mechanisms in NGN

Real-time FEM based control of soft surgical robots

Overlay of Multicast Service in WDM-PON Based on Dynamic Wavelength Reflection Scheme

Prototype Selection Methods for On-line HWR

ASAP.V2 and ASAP.V3: Sequential optimization of an Algorithm Selector and a Scheduler

Modelling and simulation of a SFN based PLC network

QAKiS: an Open Domain QA System based on Relational Patterns

Efficient Gradient Method for Locally Optimizing the Periodic/Aperiodic Ambiguity Function

Transcription:

Experimental evaluation of end-to-end delay in switched Ethernet application in the automotive domain Kostas Beretis, Ieroklis Symeonidis To cite this version: Kostas Beretis, Ieroklis Symeonidis. Experimental evaluation of end-to-end delay in switched Ethernet application in the automotive domain. Matthieu ROY. SAFECOMP 2013 - Workshop CARS (2nd Workshop on Critical Automotive applications : Robustness & Safety) of the 32nd International Conference on Computer Safety, Reliability and Security, Sep 2013, Toulouse, France. pp.na, 2013. <hal-00848359> HAL Id: hal-00848359 https://hal.archives-ouvertes.fr/hal-00848359 Submitted on 26 Jul 2013 HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

Experimental evaluation of end-to-end delay in switched Ethernet application in the automotive domain Kostas Beretis, Ieroklis Symeonidis Chalmers University of Technology, Gothenburg, Sweden {beretis,ieroklis}@student.chalmers.se Abstract. This article presents an approach for deriving upper bound for endto-end delay in a double star switched Ethernet network. Four traffic classes, following a strict priority queuing policy, were considered. The theoretical analysis was based on network calculus. An experimental setup, which accurately reflects an automotive communication network, was implemented in order to evaluate the theoretical model. The results obtained by the experiments provided valuable feedback that redefined the analytical model. Keywords: Switched Ethernet, Network calculus, Autosar, Real-time, Delay 1 Introduction Even though Ethernet was not originally designed for real-time communication, the increasing need for available bandwidth has led the automotive industry to consider it as a possible alternative. All standards of Ethernet are widespread and non-proprietary (reduction of cost) and have become successful in other industrial domains such as avionics and industrial automation [1]. A major challenge for using Ethernet is to guarantee the real-time constraints (i.e. end-to-end delay) to ensure predictability in the time domain. Determining an upper bound for end-to-end delay on switched Ethernet networks has been examined by Loeser and Haerting for the case of a FIFO queuing policy [2]. Georges et al. evaluated the performance of switched Ethernet in an industrial context, comparing different queuing policies [3]. Finally, Rahmani et al. applied a similar approach in the automotive domain using simulation [4]. The purpose of this paper is the experimental evaluation of bounded end-to-end delay for an in-vehicle switched Ethernet network. This is achieved through comparison of theoretically obtained bounds with actual experimental data. In order to demonstrate that switched Ethernet can be used as a backbone based on existing technology; commercial of-the-shelf switches were used. All development boards used, were running an AUTOSAR operating system [5], in accordance to the automotive standards. 2 System model and traffic In this section the system model and traffic types considered in this paper are presented. Traffic load and patterns, as well as timing constraints were provided by Volvo

2 Car Corporation. In the considered architecture, ECUs that serve similar functionality are grouped into the same domain. Communication among the domains is achieved through a double star switched Ethernet network (backbone), operating at 100 Mbps full duplex. In addition to the traffic generated by the five domains (as shown in fig.1), video and FTP traffic passes also through the backbone. The highest amount of data is generated from the video source and the FTP server. As a consequence the worst case delay is observed in the frames going from left to right and the end-to-end delay is defined as follows: End-to-end delay is the time it takes for a frame to traverse the backbone once it is received from an input port of switch A until it is fully transmitted from an output port of switch B. Fig.1. System model (Equations in this figure will be explained in section 3) Traffic types. Traffic generated from a domain is usually destined for a subset of the domains (multicast). VLANs, as defined in IEEE 802.1Q, were used to enable multicasting. Additionally, up to eight priority levels can be assigned through the Priority Code Point (PCP) field located on the VLAN tag, as defined in IEEE 802.1p. However, due to switch limitations the following four priority classes are considered: Hard real time messages: This class has the highest priority and consists of control messages regarding the powertrain, chassis and body electronic domains. No packet loss is tolerated in this priority class. Soft real time messages: This class has second priority and consists of diagnostic messages. However, they are not as highly critical as the previous class and an amount of missed deadlines can be tolerated. Video: This class is the third priority and consists of video streams. One or more cameras stream video of MJPEG format. Losses 0.1% can be tolerated [4]. Best effort data: Finally the last class consists of best effort messages, for example, web browsing or file transferring. This class consists of non-critical traffic that has no real-time constraints.

3 The first two classes generate periodic traffic; the third is bursty by nature while the fourth class is event-triggered. The first three classes use UDP while the fourth uses TCP. The end-to-end delay for the first three is guaranteed through modeling (see Section 3) while reliable transfer for the fourth class is guaranteed through TCP. Switch model. Collisions are completely avoided in full duplex switched Ethernet. Upper bounds of delays introduced by the switch can be calculated in a deterministic way. The total delay of a frame passing through a switch can be expressed as [6]: D switch =D proc +D queue +D trans where D proc is the processing delay of a frame by the switch (often referred to as switch fabric); D queue represents the queuing delay by the output port and has the greatest impact on the switch delay; and finally D trans is the transmission delay and can be calculated as D trans = L/C where L is the frame length and C is the link capacity. Figure 2 shows a conceptual model of the switch. A frame is received by Rx port and is then processed by the switch fabric and placed in the appropriate priority queue. The queue scheduler decides which frame will be transmitted based on the queuing policy and finally, transmitted through the Tx port. Fig.2. Switch Model (notice the four different queues for the four priority traffic flows) 3 End-to-End delay modeling Network calculus (originally introduced by Cruz [7] and extended by Le Boudec and Thiran [8]) allows the calculation of end-to-end delay using the notions of arrival and service curves. We applied this method to derive guaranteed upper bounds. Arrival Curves. The traffic generated on the vehicle s backbone network is known beforehand both in terms of size and period. The arrival curve for the first two flows can be expressed as ( ), where b is the maximum frame size of the given flow and r is its average data rate. Consequently, ( ) is a deterministic upper bound of the specific incoming traffic. Also, because this curve is an affine function [8], the arrival curves of different data flows can be merged by simply adding them to obtain the cumulative traffic load from different domains. The third priority class which consists of MJPEG video data can be modeled in a similar way. Each frame is a JPEG picture which is compressed individually and then transmitted. A typical configuration consists of a resolution of 640X480 and a rate of 30 frames per second. The arrival curve of this flow can be expressed as ( ) where b is the frame size of a JPEG picture and r the average data rate. The traffic of the fourth priority class is random by nature. Therefore, a simple token bucket traffic shaper, similar to [2], was applied at the source to ensure predictable behavior.

4 However, the data arrival on a physical network is limited by its link capacity C. As a consequence each arrival curve is expressed as: ( ) Service Curves. In our model, strict priority policy is considered to determine which class of traffic to service first: any frame of a given priority class is served only if there are no other frames of higher priority class present in the queues. Therefore, the service offered by the switch is not the same for all priority classes. As shown by Georges et al [4], the service curve offered to each flow can be expressed as: ( ) ( ) where is the rate at which data will be served expressed in bits/sec and is the total delay suffered by a flow before being actually served. The total delay parameter is computed based on two factors: (i) the interference from higher priority flows, and (ii) the blocking delay due to a non-preemptive transmission of lower priority flows. Traffic scenario. There are four different flows from left to right (fig. 1). The end-toend delay was calculated for each of them. Flow ( ) is the sum of all flows of first priority messages generated from the powertrain/chassis domain, body electronics domain and safety domain. Flow ( )is the sum of all flows of second priority messages generated from the powertrain/chassis domain, body electronics domain and safety domain. Flow ( ) is the flow of third priority video data destined for the video sink. Finally, flow ( ) is the flow of fourth priority best effort data sent from an FTP server to a client. System traffic is exchanged on both directions. Queuing delay. For a given arrival curve ( ) and service curve ( ), Le Boudec and Thiran [8] have shown that the maximum end-to-end delay D is the maximum horizontal distance between the two curves. The point where the arrival curve changes slope, denoted by, is the point where and is given in [2] as follows: As shown by Georges et al. (equation (7) in [3]), the expression for the calculation of the end-to-end delay of a given flow is the following: ( ) The theoretically calculated end-to-end delay values were compared with the values obtained experimentally, through the setup described in the following section. 4 Experimental Setup Five development boards, equipped with a Freescale MPC5567 processor, were used during the experiments. Two Netgear GS108Tv2 switches were also deployed. Video source and sink as well as FTP server and client were represented by four laptop

5 computers running Linux. Besides the traffic generated by the domains, an MJPEG video stream of 32 Mbps and a file transfer with a rate of 8Mbps were used. The system was loaded using the provided traffic patterns by Volvo Car Corporation. In order to experimentally measure the end-to-end delay of a frame, the frame has to be time-stamped while entering and exiting the network. For the measurement of the first priority message delay, one network tap was connected on the link between the powertrain/chassis domain and switch A while the other tap was connected to the link between switch B and the infotainment domain. This was done since the rate of the first priority data traversing that path is the highest for the system. Since all diagnostic messages are destined to the communication domain, the second priority message delays were measured between the powertrain/chassis domain and the communication domain. The two taps were then connected to an experimental computer through a Vector VN5610 network interface, which captured and time-stamped the frames for experimental measurement. The same approach was applied to the third priority flow between the video source and sink. The fourth priority flow is not considered since it is best effort. The development boards were running ArcCore s [9] implementation of AUTOSAR with an extended IP Stack supporting IEEE 802.1p and 802.1Q. AUTOSAR 4.1 also specifies such support for these two protocols. 5 Results and discussion The calculated theoretical bound was not exceeded by any experimentally measured delay value in all three cases. Due to space limitation only the results for the first two priorities are presented. The x-axis in each graph represents the captured frames and the y-axis represents their respective delay. The solid horizontal line is the theoretical delay. It can be easily observed that the vast majority of the end-to-end delay values for our experimental results are much smaller than the theoretical bound. However, the maximum (worst-case) measured delays were close to the theoretical bound. Fig.3. Delays for first priority traffic Fig.4. Delays for second priority traffic Although in theory a high priority frame can be blocked by one lower priority frame, during our experiments it was observed that the blocking point due to a nonpreemptive transmission consists of two frames due to the way the queue scheduler dispatches the traffic. This was used as feedback to the theoretical model resulting in

6 higher delay values than originally anticipated. The delay calculated was the end-toend network delay. The application-to-application delay, as well as the CPU utilization due to the IP stack, has to be further investigated and it is left as future work. 6 Conclusions In this paper, a theoretical model of a double star switched Ethernet network topology was presented. Network calculus was used to calculate the upper bound of end-to-end delays and experiments were performed to evaluate those bounds. The experimental results confirmed the validity of the theoretical analysis. This clearly demonstrates that for a priori known traffic, such as a vehicle s backbone traffic, network calculus can be applied to derive deterministic guarantees for end-to-end delay using switched Ethernet. Consequently, switched Ethernet can be considered an alternative for future vehicles backbone architecture. Taking into consideration that 1Gbps Ethernet will become available for automotive and the fact that AUTOSAR 4.1 and its future versions will support 802.1Q and 802.1p, great potential is being presented for the designers of future vehicular communication networks. Acknowledgements. We would like to thank Prof. Johan Karlsson and Postdoc researcher Risat Pathan from Chalmers University for their helpful guidance. We are also sincerely grateful to Samuel Sigfridsson and Jerker Fors from Volvo Car Corporation, as well as Michael Svenstam from ArcCore for their insightful advice. References 1. Kern, A., Hongyan, Z., Streichert, T., Teich, J.: Testing switched Ethernet networks in automotive embedded systems. In:6th IEEE International Symposium on Industrial Embedded Systems (SIES), 150-155 (2011) 2. Loeser, J., Haertig, H.: Low-latency hard real-time communication over switched Ethernet. In: 16th Euromicro Conference onreal-time Systems. ECRTS 2004. Proceedings., 13-22 (2004) 3. Georges, J.P., Divoux, T., Rondeau, E.: Strict Priority versus Weighted Fair Queueing in Switched Ethernet Networks for Time Critical Applications. In: 19th IEEE InternationalParallel and Distributed Processing Symposium. Proceedings., 141-141 (2005) 4. Rahmani, M., Steffen, R., Tappayuthpijarn, K., Steinbach, E., Giordano, G.: Performance analysis of different network topologies for in-vehicle audio and video communication. In: 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks. IT-NEWS 2008., 179-184 (2008) 5. AUTOSAR. http://www.autosar.org 6. Kurose, J.F., Ross, K.W.: Computer networking a top-down approach featuring the internet, 3d ed. Addison-Wesley, Boston, 53-56 (2004) 7. Cruz, R.L.: A calculus for network delay. I. Network elements in isolation. Information Theory, IEEE Transactions on 37(1), 114-131 (1991). doi:10.1109/18.61109 8. Le Boudec, J.-Y., Thiran, P.: Network calculus : a theory of deterministic queuing systems for the Internet. Lecture notes in computer science, vol. 2050. Springer, New York (2001) 9. ArcCore.http://www.arccore.com