netcarbench V3.4 User Manual

Size: px
Start display at page:

Download "netcarbench V3.4 User Manual"

Transcription

1 netcarbench V3.4 User Manual Dominique Bertrand Nicolas Navet INRIA INRIA-RTaW B.P.239 B.P Villers-lès-Nancy Villers-lès-Nancy France France April 7, 2012 Contents 1 Introduction 1 2 Command line version - installation Linux (g++) Windows (Visual C++) Quick start Command line version - usage Print the help Generate message sets Graphical version - experimental in release Benchmark conguration Input format le Network specication Mandatory parameters Optional parameters Gateway Specication Simple gateway (compliant with 3.2 le format) Improved gateway (from 3.4 le format) Some examples Output format 12 7 Upcoming features 13 1 Introduction netcarbench is a GPL-licensed software that generates automotive message sets according to a set of user-dened parameters. netcarbench is available at Its purpose is to facilitate the assessment, the understanding and the comparability of techniques and tools used in the design of in-vehicle communication networks. Additional details about the design of the software can be found in [1]. In its current version netcarbench is able to generate CAN networks, possibly interconnected by gateways, and the sets of frames that are exchanged on these networks. Support for the generation of 1

2 signals, that can be useful for conguring FlexRay networks, has been temporarily removed. Users who need this feature should resort to version 2.x. Future releases will extend the architecture description to the system-level, and thus Electronic Control Units, tasks and runnables (i.e. elementary software modules) will be explicitely modelled. netcarbench is being developed at INRIA Lorraine in the TRIO team. netcarbench is registered by INRIA at Agence pour la Protection des Programmes (APP) under number IDDIN FR S.P You are welcome to get in touch with the authors to report bugs, suggest new features or contribute code at 2 Command line version - installation Documentation, source les and executables for Linux and Windows are freely available for download (under GPL license) at: Linux (g++) 1. Download the zip le of the sources for Linux in a directory $NETBASE of your choice and unpack it. prompt > cd $NETBASE prompt > unzip netcarbench.zip 2. Compile the binary: prompt > make This creates the binary netcarbench in the directory $NETBASE. 2.2 Windows (Visual C++) 1. Download the zip le netcarbench.zip of the sources for Windows and unpack it. 2. Open the project netcarbench.sln and compile. If VC++ is not installed on your machine and you want to use the executable provided with netcarbench, you will need to install the VC redistributable les that are freely available on the microsoft web site. 2.3 Quick start 1. Check that it works: prompt >./netcarbench -i body_config.xml -s 10 -r 1515 This will generate 10 message sets for a typical body network and create the corresponding XML les in the directory $NETBASE. 2. You may want to perform worst-case response time analysis directly on the generated xml les with NETCAR-Analyzer[3] (Windows only), or simulate and possibly perform fault injection on your networks with RTaW-Sim[4] (Windows and Linux). 3 Command line version - usage 3.1 Print the help prompt > $NETBASE/netcarbench --help 2

3 Figure 1: Graphical version of netcarbench - the left-hand screen capture shows the mandatory parameters while the right-hand capture shows the optional parameters. 3.2 Generate message sets prompt > $NETBASE/netcarbench -i <cong_le> -s <sets_number >-r <seed > --input <cong_le> -i <cong_le> To generate the message sets netcarbench will follow the specications given in <cong_le>that complies with the format given in Figure 2. --sets <sets_number > -s <sets_number > netcarbench will generate <sets_number > message sets. By default, 10 message sets are created. --random_seed <seed > -r <seed> netcarbench will use the seed value as seed of the random number generator. This is a way to reproduce the same sets of congurations. By default, the current time is used. 4 Graphical version - experimental in release 3.3 There is now an experimental graphical version that enables the user to specify the generation parameters without knowing the exact input le format. This graphical version is able to open, modify and save conguration le. Also, it is possible to directly generate a set of benchmarks from the GUI. The GUI, which is based on QT, is shown in Figure 1. This version is experimental and possesses some limitations: ˆ No gateway support - just single networks, ˆ Only Windows binaries are available for now. Linux versions should follow. 3

4 5 Benchmark conguration 5.1 Input format le netcarbench generates message sets which comply with the specications written in an XML conguration le provided by the user. The general pattern of a conguration le is given in Figure 2. <netcarbench-data version="3.2"> <can-network name=network_name bandwidth=network_bandwidth granularity=granularity > <network-load min=min_value max=max_value /> <nb-network-interfaces min=min_value max=max_value /> <fixed-station-loads> <station id=station_id value=station_load /> </fixed-station-loads> <fixed-station-queuing-policies fifo_ratio=value > <station id=station_id mode=station_mode > </fixed-station-queuing-policies> <frame-periods> <period value=frame_period weight=period_weight margin=period_margin prio_low_range=priority_low prio_high_range=priority_high /> </frame-periods> <frame-payloads> <payload value=frame_payload weight=payload_weight margin=payload_margin /> </frame-payloads> <offsets mode=osets_mode /> <jitters mode=jitters_mode value=jitters_value /> <deadlines mode=deadlines_mode value=deadlines_value /> </can-network> </gateway network_source=network_source_name network_target=network_target_name> <nb-frame-mappings min=min_frame_mappings max=max_frame_mappings /> <transmission-delay min=min_transmission_delay max=max_transmission_delay /> </gateway> </netcarbench-data> Figure 2: Pattern of a valid conguration le. 5.2 Network specication In the conguration le, the following set of parameters serves to specify a CAN network. We can distinguish between mandatory parameters (which must be provided to generate a network) from optional parameters (which may not be specied) Mandatory parameters 1. Name of the network <can-network name=network_name > ˆ Denition: Name of the network. ˆ Specication: The name of the network, network_name, is a unique identier: each specied can-network must have a dierent name. 2. Bandwidth of the network <can-network name=network_name bandwidth=network_bandwidth > ˆ Denition: Amount of data that can be sent over the network in a given period of time (i.e., the data rate). ˆ Specication: Fixed positive integer value bandwidth_value corresponding to the bandwidth. ˆ Unit: bandwidth_value in kbits/s (typically 500 or 250 for automotive systems). 4

5 3. Load of the network <network-load min=min_value max=max_value /> ˆ Denition: Percentage of bandwidth utilization (all frames considered). The worst-case overhead, including worst-case bit-stung, of CAN is considered (about 50% for 8 bytes of data). ˆ Specication: Range [min_value,max_value] of permitted values given in percentage, with 0 min_value max_value 1. Typically, for an automotive network, it ranges from 0.4 to Number of network interfaces in the network <nb-network-interfaces min=min_value max=max_value /> ˆ Denition: Total number of nodes (i.e., communication controllers) in the network. ˆ Specication: Range [min_value, max_value] of permitted values, with min_value, max_value N and 0 min_value max_value. Typically, for an automotive network, there are less than 20 nodes. 5. Periods of the frame <frame-periods> <period value=frame_period weight=period_weight margin=period_margin prio_low_range=priority_low prio_high_range=priority_high /> </periods> ˆ Denition: Time interval which separates two successive releases of the same frame on a given node of the network. ˆ Specication: If W denotes the sum of the period_weight values of all the frame periods, a new frame will be assigned a period of frame_period ms with a probability of (period_weight ± period_margin)/w. Furthermore, its priority will be chosen randomly in the range [priority_low, priority_high]. netcarbench ensures that each priority is unique in the frame set of one network. ˆ Unit: periods: frame_period in ms (integer value). priorities: priority_low, priority_high in the range [0, 2047] (as imposed by the standard). 6. Payloads of the frames <frame-payloads> <payload value=frame_payload weight=payload_weight margin=payload_margin/> </frame-payloads> ˆ Denition: Data payload of the frames. ˆ Specication: If L denotes the sum of the payload_weight of all the frame payloads, a new frame will be assigned a payload of frame_payload bytes with a probability of (payload_weight± payload_margin)/l. ˆ Unit: byte in the range [0, 8]. 5

6 5.2.2 Optional parameters 1. Period of the middleware communication task <can-network granularity=granularity > ˆ Denition: Period of the middleware task that creates the frames from the signals and issues the frame transmission requests. By default, granularity is set to 5 ms. This parameter is used for generating the frame oset values (RANDOM assignment, see Ÿ5). This parameter is also used by NETCAR-Analyzer when computing response times. If the frames are directly sent by the tasks (i.e., no middleware task), then the granularity is not meaningful (neither do osets). ˆ Specication: Fixed positive integer value granularity corresponding to the period. ˆ Unit: granularity in ms (real value). 2. Load of the stations <fixed-station-loads> <station id=station_id value=station_load /> </fixed-station-loads> ˆ Denition: Percentage of bandwidth utilization due to the frames sent by station with identier station_id. This is useful to model systems where a specic node contributes to a large share of the total bandwidth (typically, a body control module in automotive systems). ˆ Specication: Fixed value station_load. ˆ Unit: station_load is a real value [0, 1]. 3. Queueing policy of the stations <fixed_station_queuing_policies fifo_ratio=fo_ratio_value> <station id=station_id mode=station_mode /> </fixed_station_queuing_policies> ˆ Denition: option to specify specic queuing policy (for the outgoing frames) on certain stations. ˆ Specication: The attribute fifo_ratio is optional. When specied, it sets the ratio of stations with FIFO policy (among the stations that are not listed in the station list), otherwise all stations are HPF (except the stations that are listed as FIFO in the station list). The optional station list serves to specify the queuing policy for node with id station_id (station_id must be smaller than the minimal number of nodes). In the current version, the only possible values for station_mode are {FIFO, HPF}. ˆ Unit: fo_ratio_value is a real value [0, 1]. 4. Deadlines of the frames <deadlines mode=deadlines_mode value=deadlines_value /> ˆ Denition: option to specify deadlines for the frames. ˆ Specication: mode: deadlines_mode {FIXED, MAX_FIXED, PERIOD, FRACTION} * FIXED: for each frame, the deadline is set to the xed specied deadlines_value, * MAX_FIXED: for each frame, the deadline is set to min(period, deadlines_value) where period is the period of the frame that is considered, * PERIOD: for each frame, the deadline is set to the period of the frame (deadlines_value is not considered), * FRACTION: for each frame, the deadline is set to deadlines_value period where period is the period of the considered frame. 6

7 ˆ Unit: value: deadline_value 5. Osets of the frames * FIXED/MAX_FIXED: integer values in ms. * FRACTION: real value [0, 1] (percentage of time of the period). <offsets mode=osets_mode /> ˆ Denition: option to specify osets for the frames. ˆ Specication: mode: osets_mode {SYNCHRONOUS, RANDOM} 6. Jitters of the frames * SYNCHRONOUS: for each frame, the oset is set to 0, * RANDOM: for each frame, the oset value is randomly chosen between 0 and the period of the frame - 1 (integer value in ms), according to the granularity of the network (i.e., it is not possible to have osets that are not multiple of the communication task). A random oset assignment leads to better worst-case response times than in the synchronous case, but it of course not optimal and largely outperformed by dedicated algorithms [2]. <jitters mode=jitters_mode value=jitter_value ratio=jitter_ratio /> ˆ Denition: option to specify jitters for the frames. ˆ Specication: mode: jitters_mode {SYNCHRONOUS, RANDOM, FIXED} * SYNCHRONOUS: for each frame, the jitter is set to 0, * RANDOM: for each frame, the jitter value is randomly chosen between 0 and the period of the frame - 1 (integer value in ms), * FIXED: for each frame, the jitter is set to the xed specied jitters_value. ratio: jitters_ratio [0, 1] species the percentage of frames having jitters (not compatible with SYNCHRONOUS). The frames that are not selected to have jitters are assigned a jitter equal to 0. (this feature is not available i n the graphical version yet). ˆ Unit: in ms (integer value). 5.3 Gateway Specication This section of the input le allows to specify frames that are re-routed from one network to another (e.g., a frame produced by a network interface in the powertrain network is transmitted on the body network by an ECU that acts as a gateway). Several gateways can be specied in the conguration le. In the current version of netcarbench, the re-routing can only be done at the frame level (not the signals level), which means that gateways are actually bridges. There are two mutually exclusive ways to specify the gateways Simple gateway (compliant with 3.2 le format) With this solution, only uni-directional gateways can be dened. If two gateways of opposite direction are dened between the two same networks, then involved network interfaces are dierent (corresponding to the case where two dierent ECUs are involved). <gateway name=gateway_name network_source=network_source_name network_target=network_target_name > <nb-frame-mappings min=min_frame_mappings max=max_frame_mappings > <transmission-delay min=min_transmission_delay max=max_transmission_delay > </gateway> 7

8 1. Name ˆ Denition: unique identier. If not specied, the name will be automatically generated as network_source_name.network_target_name. 2. Number of frame mappings ˆ Denition: denes the number of frames which are transmitted by the gateway from the source network to the target network. ˆ Specication: Range [min_frame_mappings, max_frame_mappings] of permitted values, with min_frame_mappings, max_frame_mappings N and 0 min_frame_mappings max_frame_mappings. 3. Transmission delay ˆ Denition: denes the delay between the reception of the frame by the gateway on the source network and the re-transmission on the target network. ˆ Specication: Range [min_transmission_delay, max_transmission_delay] of permitted values, with min_transmission_delay, max_transmission_delay N and 0 min_transmission_delay max_transmission_delay. ˆ Unit: in µs (integer value) Improved gateway (from 3.4 le format) With this solution, both uni-directional and bi-directional gateways can be dened. In the case of a bi-directional gateway, the involved network interfaces are the same (corresponding to the case where one ECUs performs the gatewaying in both directions). 1. Name <gateway name=gateway_name > <direction> <networks network_source=network_a network_target=network_b > <nb-frame-mappings min=min_frame_mappings_1 max=max_frame_mappings_1 > <transmission-delay min=min_transmission_delay_1 max=max_transmission_delay_1 > </direction> <direction> <networks network_source=network_b network_target=network_a > <nb-frame-mappings min=min_frame_mappings_2 max=max_frame_mappings_2 > <transmission-delay min=min_transmission_delay_2 max=max_transmission_delay_2 > </direction> </gateway> ˆ Denition: unique identier. If not specied, the name will be automatically generated as network_a.network_b in the case of uni-directional gateway. In the case of a bi-directional gateway, two gateways are generated network_a.network_b-network_a_to_network_b and network_a.network_b-network_b_to_network_a. 2. Direction ˆ Denition: one or two directions for the ow of forwarded frames can be dened, corresponding respectively to the case where the gateway is unidirectional or bidirectional. The networks element species the direction. In the bidirectional case, the involved networks must match. 3. Number of frame mappings (for a specic direction) ˆ Denition: denes the number of frames which are transmitted by the gateway from the source network to the target network. 8

9 ˆ Specication: Range [min_frame_mappings, max_frame_mappings] of permitted values, with min_frame_mappings, max_frame_mappings N and 0 min_frame_mappings max_frame_mappings. 4. Transmission delay (for a specic direction) ˆ Denition: denes the delay between the reception of the frame by the gateway on the source network and the re-transmission on the target network. ˆ Specication: Range [min_transmission_delay, max_transmission_delay] of permitted values, with min_transmission_delay, max_transmission_delay N and 0 min_transmission_delay max_transmission_delay. ˆ Unit: in µs (integer value). 5.4 Some examples Valid conguration les are provided to generate frames for a typical body network (see body_config.xml in Figure 3), a typical powertrain network (see pwrt_config.xml in Figure 4) and to generate two networks which exchange frames via a gateway (see gateway.xml in Figure 5). The generation of signals is also possible, an example for a powertrain network is given (see pwrt_signals_config.xml). However signals generation is not yet supported in 3.x version, version 2.2 should be used for that purpose. <netcarbench-data version="3.2"> <can-network name="body_config" bandwidth="250" > <network-load min="0.45" max="0.55" /> <nb-network-interfaces min="15" max ="20" /> <fixed-station-loads> <station id="1" value="0.30" /> </fixed-station-loads> <fixed-station-queuing-policies fifo_ratio="0.30"> <station id="1" mode="fifo" /> <station id="2" mode="hpf" /> </fixed-station-queuing-policies> <frame-periods> <period value="50" weight="5" margin="1" prio_low_range="1" prio_high_range="200"/> <period value="100" weight="15" margin="3" prio_low_range="1" prio_high_range="600"/> <period value="200" weight="30" margin="5" prio_low_range="1" prio_high_range="1000"/> <period value="500" weight="15" margin="3" prio_low_range="200" prio_high_range="1000"/> <period value="1000" weight="10" margin="2" prio_low_range="600" prio_high_range="1500"/> <period value="2000" weight="5" margin="1" prio_low_range="1000" prio_high_range="2047"/> </frame-periods> <frame-payloads> <payload value="1" weight="1" margin="1"/> <payload value="2" weight="1" margin="1"/> <payload value="3" weight="1" margin="1"/> <payload value="4" weight="1" margin="1"/> <payload value="5" weight="2" margin="1"/> <payload value="6" weight="2" margin="1"/> <payload value="7" weight="2" margin="1"/> <payload value="8" weight="8" margin="2"/> </frame-payloads> <offsets mode="synchronous" /> <jitters mode="fixed" value="2" /> <deadlines mode="fraction" value="0.8" /> </can-network> </netcarbench-data> Figure 3: Source code for body_config.xml: an XML conguration le for the generation of sets of frames exchanged in a body network with FIFO queues for some ECUs. 9

10 <netcarbench-data version="3.2"> <can-network name="pwrt_config" bandwidth="500" granularity="5" > <network-load min="0.40" max="0.50" /> <nb-network-interfaces min="5" max ="15"/> <frame-periods> <period value="10" weight="5" margin="2" prio_low_range="50" prio_high_range="200"/> <period value="20" weight="10" margin="2" prio_low_range="100" prio_high_range="400"/> <period value="50" weight="20" margin="5" prio_low_range="250" prio_high_range="500"/> <period value="100" weight="10" margin="2" prio_low_range="300" prio_high_range="600"/> <period value="200" weight="5" margin="2" prio_low_range="400" prio_high_range="800"/> <period value="1000" weight="5" margin="2" prio_low_range="500" prio_high_range="1000"/> <period value="2000" weight="5" margin="2" prio_low_range="600" prio_high_range="1000"/> </frame-periods> <fixed-loaded_stations> <station id="1" value="0.30" /> <station id="2" value="0.20" /> </fixed-loaded_stations> <frame-payloads> <payload value="1" weight="2" margin="1" /> <payload value="2" weight="5" margin="2" /> <payload value="3" weight="5" margin="2" /> <payload value="4" weight="5" margin="2" /> <payload value="5" weight="10" margin="5" /> <payload value="6" weight="15" margin="5" /> <payload value="7" weight="20" margin="5" /> <payload value="8" weight="40" margin="5" /> </frame-payloads> <offsets mode="synchronous"/> <jitters mode="fixed" value = "2" /> <deadlines mode="max_fixed" value="30" /> </can-network> </netcarbench-data> Figure 4: Source code for pwrt_config.xml: an XML conguration le for the generation of sets of frames exchanged in a powertrain network where all nodes have HPF queues. 10

11 <netcarbench-data version="3.2"> <can-network name="powertrain" bandwidth="500" > <network-load min="0.4" max="0.5" /> <nb-network-interfaces min="5" max ="15" /> <fixed-station-loads> <station id="1" value="0.25" /> <station id="2" value="0.20" /> <station id="3" value="0.15" /> <station id="4" value="0.05" /> </fixed-station-loads> <frame-periods> <period value="10" weight="5" margin="2" prio_low_range="50" prio_high_range="200"/> <period value="20" weight="10" margin="2" prio_low_range="100" prio_high_range="400"/> <period value="50" weight="2" margin="1" prio_low_range="250" prio_high_range="500"/> <period value="100" weight="5" margin="2" prio_low_range="300" prio_high_range="600"/> <period value="200" weight="5" margin="2" prio_low_range="400" prio_high_range="800"/> <period value="1000" weight="5" margin="2" prio_low_range="500" prio_high_range="1000"/> <period value="2000" weight="5" margin="2" prio_low_range="600" prio_high_range="1000"/> </frame-periods> <frame-payloads> <payload value="1" weight="2" margin="1" /> <payload value="2" weight="5" margin="2" /> <payload value="3" weight="5" margin="2" /> <payload value="4" weight="5" margin="2" /> <payload value="5" weight="10" margin="5" /> <payload value="6" weight="15" margin="5" /> <payload value="7" weight="20" margin="5" /> <payload value="8" weight="40" margin="5" /> </frame-payloads> </can-network> <can-network name="body" bandwidth="250" > <network-load min="0.45" max="0.55" /> <nb-network-interfaces min="15" max ="20" /> <fixed-station-loads> <station id="1" value="0.30" /> <station id="2" value="0.15" /> <station id="3" value="0.10" /> </fixed-station-loads> <fixed-station-queuing-policies fifo_ratio="0.30"> <station id="1" mode="fifo" /> <station id="2" mode="hpf" /> </fixed-station-queuing-policies> <frame-periods> <period value="50" weight="2" margin="1" prio_low_range="1" prio_high_range="200"/> <period value="100" weight="15" margin="3" prio_low_range="1" prio_high_range="600"/> <period value="200" weight="15" margin="3" prio_low_range="1" prio_high_range="1000"/> <period value="500" weight="30" margin="5" prio_low_range="200" prio_high_range="1000"/> <period value="1000" weight="25" margin="5" prio_low_range="300" prio_high_range="1500"/> <period value="2000" weight="5" margin="1" prio_low_range="500" prio_high_range="1500"/> </frame-periods> <frame-payloads> <payload value="1" weight="1" margin="1" /> <payload value="2" weight="1" margin="1" /> <payload value="3" weight="1" margin="1" /> <payload value="4" weight="1" margin="1" /> <payload value="5" weight="2" margin="1" /> <payload value="6" weight="2" margin="1" /> <payload value="7" weight="2" margin="1" /> <payload value="8" weight="8" margin="2" /> </frame-payloads> <offsets mode="random" /> </can-network> <gateway name="can_gateway" > <direction> <networks network_source="body" network_target="powertrain" /> <nb-frame-mappings min="2" max="5" /> <transmission-delay min="0" max="500" /> </direction> <direction> <networks network_source="powertrain" network_target="body" /> <nb-frame-mappings min="5" max="10" /> <transmission-delay min="100" max="100" /> </direction> </gateway> </netcarbench-data> 11 Figure 5: Source code for gateway.xml: an XML conguration le for the generation of two networks exchanging some frames via a gateway.

12 6 Output format The V3.x output format of netcarbench is presented in Figure 6. RTaW-Sim [4] (>1.2.5) can directly import the V3.x netcarbench output le format, so you can easily simulate the congurations described in the generated xml les. The V3.x output format of netcarbench is at the time of writing not supported in a freely available version of NETCAR-Analyzer but V2.2 is still supported. However, upcoming releases will include a netcarbench V3.x import lter. <netcar-analyzer-data version="2.0.0"> <network name="net_name1" bandwidth="net_bandwidth1" granularity="net_granularity1"> <offset-list> <offset id="ncb_offset" /> </offset-list> <network-interface name="net_name1.node1" queuing="hpf"> <frame name="frame11" can-id="p11" period="t11" jitter="j11" deadline="d11" payload="l11"> <offset-value offset-id="ncb_offset" value="offset_11" fixed="false" /> </frame>... </network-interface> <network-interface name="network_name1.node2" queuing="hpf"> <frame name="frame21" can-id="p21" period="t21" jitter="j21" deadline="d21" payload="l21"> <offset-value offset-id="ncb_offset" value="offset_21" fixed="false" /> </frame>... </network-interface>... </network> <network name="net_name2" bandwidth="net_bandwidth2" granularity="net_granularity2"> <offset-list> <offset id="ncb_offset" /> </offset-list> <network-interface name="net_name2.node1" queuing="hpf"> <frame name="frame11" can-id="p11" period="t11" jitter="j11" deadline="d11" payload="l11"> <offset-value offset-id="ncb_offset" value="offset_11" fixed="false" /> </frame>... </network-interface> </network> <gateway name="gateway_name1" network-source="net_name_i" network-interface-source="net_name_i.node_n" network-target="net_name_j" network-interface-target="net_name_j.node_m" max-transmission-delay="gateway-delay"> <frame-mapping source="frame_k" target="gateway_frame1" /> <frame-mapping source="frame_l" target="gateway_frame2" />... </gateway>... </netcar-analyzer-data> Figure 6: Structure of the output XML le - rst, the description of the networks, then description of the gateways. This output le is decomposed in 2 parts: ˆ A list of CAN network description, each of which can be decomposed as follows A list of oset allocations (offset id) which denes one frame osets assignment (several choices for the oset might be considered, corresponding to dierent design choices). There is always a single oset assignment generated by netcarbench (though NETCAR-Analyzer and RTaW-Sim support several). By default, without the <offsets value=true /> tag (see Ÿ5.1), netcarbench set all oset values to 0. The list of network interfaces exchanging data on the CAN-bus. The frame waiting queue (outgoing stream) at the network interface can be either FIFO or HPF (Higher priority 12

13 rst), the latter being the default policy. Each network interface sends a set of frames, each described by its name, its can-id (priority), its period (ms), its data payload (in bytes, from 0 to 8), its jitter (ms) and its oset value (ms) dened for each offset-id. The osets of forwarded frames are not specied in the set of messages of the target networks (they can be read on the source networks). ˆ A list of gateway description, each of which describes the interaction between two networks, a source network and a target network. 7 Upcoming features Future releases will extend the architecture description to the system-level, and thus ECU, tasks and runnables will be explicitely modelled. A new possible output format le is under study: the TADL2 description language, that is being developed within the ITEA2 TIMMO-2-USE project. References [1] C. Braun, L. Havet, and N. Navet. NETCARBENCH: a benchmark for techniques and tools used in the design of automotive communication systems. In Proc. of the 7th IFAC International Conference on Fieldbuses and Networks in Industrial and Embedded Systems (FeT'2007), November Software and manual available at [2] M. Grenier, L. Havet, and N. Navet. Pushing the limits of CAN-scheduling frames with osets provides a major performance boost. In Proc. of the 4th European Congress Embedded Real Time Software., January [3] RealTime-at-Work. NETCAR-Analyzer: a CAN analysis tool. Freely available at realtimeatwork.com/software/netcar-analyzer/, [4] RealTime-at-Work. RTAW-Sim: a CAN simulation tool. Freely available at realtimeatwork.com/software/rtaw-sim/,

Pushing the limits of CAN - Scheduling frames with offsets provides a major performance boost

Pushing the limits of CAN - Scheduling frames with offsets provides a major performance boost Pushing the limits of CAN - Scheduling frames with offsets provides a major performance boost Nicolas NAVET INRIA / RealTime-at-Work http://www.loria.fr/~nnavet http://www.realtime-at-work.com Nicolas.Navet@loria.fr

More information

Verification of automotive networks -

Verification of automotive networks - Verification of automotive networks - what to expect (and not expect) from each technique Nicolas NAVET nicolas.navet@uni.lu Stuttgart, Germany, December 9-11, 2013. December 09, 2013 1 Outline Early-stage

More information

NETCAR-Analyzer V1.6.1 User Manual

NETCAR-Analyzer V1.6.1 User Manual NETCAR-Analyzer V1.6.1 User Manual Author : Jörn Migge Verifier : Nicolas Navet, Lionel Havet Date : 21/2/2011 Contents 1 Introduction...3 1.1 Licence of the software...3 1.2 Installation...4 1.3 Support...4

More information

Outline INSIGHTS ON THE CONFIGURATION AND PERFORMANCES OF SOME/IP SERVICE DISCOVERY. What is SOME/IP and SOME/IP SD

Outline INSIGHTS ON THE CONFIGURATION AND PERFORMANCES OF SOME/IP SERVICE DISCOVERY. What is SOME/IP and SOME/IP SD INSIGHTS ON THE CONFIGURATION AND PERFORMANCES OF SOME/IP SERVICE DISCOVERY Jan R. SEYLER, Daimler A.G, Mercedes Cars Nicolas NAVET, University of Luxembourg Loïc FEJOZ, RealTime-at-Work (RTaW) Outline

More information

In Vehicle Networking : a Survey and Look Forward

In Vehicle Networking : a Survey and Look Forward In Vehicle Networking : a Survey and Look Forward Nicolas Navet Workshop on Specialized Networks, ETFA09, Palma, Spain - 25/09/2009 Complexity Mastered Outline 1. Architecture of Automotive Embedded Systems

More information

Insights on the performance and configuration of AVB and TSN in automotive applications

Insights on the performance and configuration of AVB and TSN in automotive applications Insights on the performance and configuration of AVB and TSN in automotive applications Nicolas NAVET, University of Luxembourg Josetxo VILLANUEVA, Groupe Renault Jörn MIGGE, RealTime-at-Work (RTaW) Marc

More information

Organic Self-organizing Bus-based Communication Systems

Organic Self-organizing Bus-based Communication Systems Organic Self-organizing Bus-based Communication Systems, Stefan Wildermann, Jürgen Teich Hardware-Software-Co-Design Universität Erlangen-Nürnberg tobias.ziermann@informatik.uni-erlangen.de 15.09.2011

More information

FB(9,3) Figure 1(a). A 4-by-4 Benes network. Figure 1(b). An FB(4, 2) network. Figure 2. An FB(27, 3) network

FB(9,3) Figure 1(a). A 4-by-4 Benes network. Figure 1(b). An FB(4, 2) network. Figure 2. An FB(27, 3) network Congestion-free Routing of Streaming Multimedia Content in BMIN-based Parallel Systems Harish Sethu Department of Electrical and Computer Engineering Drexel University Philadelphia, PA 19104, USA sethu@ece.drexel.edu

More information

Trends in Automotive Communication Systems

Trends in Automotive Communication Systems Trends in Automotive Communication Systems Nicolas Navet, Françoise Simonot-Lion To cite this version: Nicolas Navet, Françoise Simonot-Lion. Trends in Automotive Communication Systems. Richard Zurawski.

More information

Abstract Studying network protocols and distributed applications in real networks can be dicult due to the need for complex topologies, hard to nd phy

Abstract Studying network protocols and distributed applications in real networks can be dicult due to the need for complex topologies, hard to nd phy ONE: The Ohio Network Emulator Mark Allman, Adam Caldwell, Shawn Ostermann mallman@lerc.nasa.gov, adam@eni.net ostermann@cs.ohiou.edu School of Electrical Engineering and Computer Science Ohio University

More information

Extensions to RTP to support Mobile Networking: Brown, Singh 2 within the cell. In our proposed architecture [3], we add a third level to this hierarc

Extensions to RTP to support Mobile Networking: Brown, Singh 2 within the cell. In our proposed architecture [3], we add a third level to this hierarc Extensions to RTP to support Mobile Networking Kevin Brown Suresh Singh Department of Computer Science Department of Computer Science University of South Carolina Department of South Carolina Columbia,

More information

Real-Time Protocol (RTP)

Real-Time Protocol (RTP) Real-Time Protocol (RTP) Provides standard packet format for real-time application Typically runs over UDP Specifies header fields below Payload Type: 7 bits, providing 128 possible different types of

More information

Integrating Response-Time Analyses for Heterogeneous Automotive Networks in MPS-CAN Analyzer

Integrating Response-Time Analyses for Heterogeneous Automotive Networks in MPS-CAN Analyzer Integrating Response-Time Analyses for Heterogeneous Automotive Networks in MPS-CAN Analyzer Saad Mubeen, Mohammad Ashjaei, Moris Behnam, Thomas Nolte Mälardalen Real-Time Research Centre, Mälardalen University,

More information

Reducing CAN latencies by use of weak synchronization between stations

Reducing CAN latencies by use of weak synchronization between stations Reducing CAN latencies by use of weak synchronization between stations Hugo Daigmorte 1, Marc Boyer 1, Jörn Migge 2 1 ONERA, Université de Toulouse, France 2 RealTime-at-Work, France Scheduling frames

More information

A Dag-Based Algorithm for Distributed Mutual Exclusion. Kansas State University. Manhattan, Kansas maintains [18]. algorithms [11].

A Dag-Based Algorithm for Distributed Mutual Exclusion. Kansas State University. Manhattan, Kansas maintains [18]. algorithms [11]. A Dag-Based Algorithm for Distributed Mutual Exclusion Mitchell L. Neilsen Masaaki Mizuno Department of Computing and Information Sciences Kansas State University Manhattan, Kansas 66506 Abstract The paper

More information

Timing Analysis of Automotive Architectures and Software. Nicolas Navet University of Luxembourg, founder RealTime-at-Work

Timing Analysis of Automotive Architectures and Software. Nicolas Navet University of Luxembourg, founder RealTime-at-Work Timing Analysis of Automotive Architectures and Software Nicolas Navet University of Luxembourg, founder RealTime-at-Work Outline Focus is not the formalisms but on what to expect from timing analysis

More information

Communication Networks for the Next-Generation Vehicles

Communication Networks for the Next-Generation Vehicles Communication Networks for the, Ph.D. Electrical and Computer Engg. Dept. Wayne State University Detroit MI 48202 (313) 577-3855, smahmud@eng.wayne.edu January 13, 2005 4 th Annual Winter Workshop U.S.

More information

Interrupt transfers & USB 2.0 & USB 3.0. Group Members Mehwish Awan Mehwish Kiran

Interrupt transfers & USB 2.0 & USB 3.0. Group Members Mehwish Awan Mehwish Kiran Interrupt transfers & Isochronous transfers in USB 2.0 & USB 3.0 Group Members Mehwish Awan Mehwish Kiran Agenda What is isochronous transfer? Use of isochronous transfer Format of isochronous transactions

More information

Systems. Roland Kammerer. 10. November Institute of Computer Engineering Vienna University of Technology. Communication Protocols for Embedded

Systems. Roland Kammerer. 10. November Institute of Computer Engineering Vienna University of Technology. Communication Protocols for Embedded Communication Roland Institute of Computer Engineering Vienna University of Technology 10. November 2010 Overview 1. Definition of a protocol 2. Protocol properties 3. Basic Principles 4. system communication

More information

An Encapsulated Communication System for Integrated Architectures

An Encapsulated Communication System for Integrated Architectures An Encapsulated Communication System for Integrated Architectures Architectural Support for Temporal Composability Roman Obermaisser Overview Introduction Federated and Integrated Architectures DECOS Architecture

More information

Worst-case Ethernet Network Latency for Shaped Sources

Worst-case Ethernet Network Latency for Shaped Sources Worst-case Ethernet Network Latency for Shaped Sources Max Azarov, SMSC 7th October 2005 Contents For 802.3 ResE study group 1 Worst-case latency theorem 1 1.1 Assumptions.............................

More information

A model-based design flow for CAN-based systems

A model-based design flow for CAN-based systems A model-based design flow for CAN-based systems Alexios Lekidis, Marius Bozga, Didier Mauuary, Saddek Bensalem To cite this version: Alexios Lekidis, Marius Bozga, Didier Mauuary, Saddek Bensalem. A model-based

More information

Chapter 4 ATM VP-Based Ring Network

Chapter 4 ATM VP-Based Ring Network ATM VP-based network architecture is essentially a compromise of the SONET/STM and ATM network architectures: it takes a system simplicity concept from the SONET/STM network and keeps the flexibility of

More information

SCHEDULING REAL-TIME MESSAGES IN PACKET-SWITCHED NETWORKS IAN RAMSAY PHILP. B.S., University of North Carolina at Chapel Hill, 1988

SCHEDULING REAL-TIME MESSAGES IN PACKET-SWITCHED NETWORKS IAN RAMSAY PHILP. B.S., University of North Carolina at Chapel Hill, 1988 SCHEDULING REAL-TIME MESSAGES IN PACKET-SWITCHED NETWORKS BY IAN RAMSAY PHILP B.S., University of North Carolina at Chapel Hill, 1988 M.S., University of Florida, 1990 THESIS Submitted in partial fulllment

More information

Implementation of automotive CAN module requirements

Implementation of automotive CAN module requirements Implementation of automotive CAN module requirements Alan Devine, freescale semiconductors At first glance all CAN modules are very similar, the only difference being the number of message buffers which

More information

SEtSim: A Modular Simulation Tool for Switched Ethernet Networks

SEtSim: A Modular Simulation Tool for Switched Ethernet Networks SEtSim: A Modular Simulation Tool for Switched Ethernet Networks Mohammad Ashjaei, Moris Behnam, Thomas Nolte Mälardalen Real-Time Research Center (MRTC), Mälardalen University, Västerås, Sweden P.O. Box

More information

MDP Routing in ATM Networks. Using the Virtual Path Concept 1. Department of Computer Science Department of Computer Science

MDP Routing in ATM Networks. Using the Virtual Path Concept 1. Department of Computer Science Department of Computer Science MDP Routing in ATM Networks Using the Virtual Path Concept 1 Ren-Hung Hwang, James F. Kurose, and Don Towsley Department of Computer Science Department of Computer Science & Information Engineering University

More information

Architectures of Automotive Electrical. Nicolas Navet. Can be freely used for teaching Complexity Mastered. Outline

Architectures of Automotive Electrical. Nicolas Navet. Can be freely used for teaching Complexity Mastered. Outline Architectures of Automotive Electrical and Electronics (E/E) Systems Nicolas Navet Teaching slides Can be freely used for teaching Complexity Mastered Outline 1. Architecture of Automotive Embedded Systems

More information

BROADBAND AND HIGH SPEED NETWORKS

BROADBAND AND HIGH SPEED NETWORKS BROADBAND AND HIGH SPEED NETWORKS ATM SWITCHING ATM is a connection-oriented transport concept An end-to-end connection (virtual channel) established prior to transfer of cells Signaling used for connection

More information

In-vehicle communication networks - a historical perspective and review

In-vehicle communication networks - a historical perspective and review In-vehicle communication networks - a historical perspective and review Nicolas Navet, Françoise Simonot-Lion To cite this version: Nicolas Navet, Françoise Simonot-Lion. In-vehicle communication networks

More information

ISO INTERNATIONAL STANDARD. Road vehicles FlexRay communications system Part 2: Data link layer specification

ISO INTERNATIONAL STANDARD. Road vehicles FlexRay communications system Part 2: Data link layer specification INTERNATIONAL STANDARD ISO 17458-2 First edition 2013-02-01 Road vehicles FlexRay communications system Part 2: Data link layer specification Véhicules routiers Système de communications FlexRay Partie

More information

Credit-Based Fair Queueing (CBFQ) K. T. Chan, B. Bensaou and D.H.K. Tsang. Department of Electrical & Electronic Engineering

Credit-Based Fair Queueing (CBFQ) K. T. Chan, B. Bensaou and D.H.K. Tsang. Department of Electrical & Electronic Engineering Credit-Based Fair Queueing (CBFQ) K. T. Chan, B. Bensaou and D.H.K. Tsang Department of Electrical & Electronic Engineering Hong Kong University of Science & Technology Clear Water Bay, Kowloon, Hong Kong

More information

Experimental assessment of timing verification techniques for AFDX 1

Experimental assessment of timing verification techniques for AFDX 1 Experimental assessment of timing verification techniques for AFDX 1 Marc BOYER ONERA, The French Aerospace Lab F31055 Toulouse Nicolas NAVET INRIA/RealTime-at-Work F54600 Villers-lès-Nancy Marc FUMEY

More information

AUTOBEST: A United AUTOSAR-OS And ARINC 653 Kernel. Alexander Züpke, Marc Bommert, Daniel Lohmann

AUTOBEST: A United AUTOSAR-OS And ARINC 653 Kernel. Alexander Züpke, Marc Bommert, Daniel Lohmann AUTOBEST: A United AUTOSAR-OS And ARINC 653 Kernel Alexander Züpke, Marc Bommert, Daniel Lohmann alexander.zuepke@hs-rm.de, marc.bommert@hs-rm.de, lohmann@cs.fau.de Motivation Automotive and Avionic industry

More information

Distributed Information Processing

Distributed Information Processing Distributed Information Processing 6 th Lecture Eom, Hyeonsang ( 엄현상 ) Department of Computer Science & Engineering Seoul National University Copyrights 2016 Eom, Hyeonsang All Rights Reserved Outline

More information

SATELLITE NETWORK REGULAR CONNECTIONS

SATELLITE NETWORK REGULAR CONNECTIONS Supporting unidirectional links in the Internet Emmanuel Duros eduros@sophia.inria.fr I.N.R.I.A. Sophia Antipolis http://www.inria.fr/rodeo/personnel/eduros/ Walid Dabbous dabbous@sophia.inria.fr I.N.R.I.A.

More information

NETWORK LAYER DATA PLANE

NETWORK LAYER DATA PLANE NETWORK LAYER DATA PLANE 1 GOALS Understand principles behind network layer services, focusing on the data plane: Network layer service models Forwarding versus routing How a router works Generalized forwarding

More information

Multimedia Systems 2011/2012

Multimedia Systems 2011/2012 Multimedia Systems 2011/2012 System Architecture Prof. Dr. Paul Müller University of Kaiserslautern Department of Computer Science Integrated Communication Systems ICSY http://www.icsy.de Sitemap 2 Hardware

More information

A Practical Message ID Assignment Policy for Controller Area Network that Maximizes Extensibility

A Practical Message ID Assignment Policy for Controller Area Network that Maximizes Extensibility A Practical Message ID Assignment Policy for Controller Area Network that Maximizes Extensibility Florian Pölzlbauer * Robert I. Davis Iain Bate COMET K2 Competence Center - Initiated by the Federal Ministry

More information

Real-Time (Paradigms) (47)

Real-Time (Paradigms) (47) Real-Time (Paradigms) (47) Memory: Memory Access Protocols Tasks competing for exclusive memory access (critical sections, semaphores) become interdependent, a common phenomenon especially in distributed

More information

P D1.1 RPR OPNET Model User Guide

P D1.1 RPR OPNET Model User Guide P802.17 D1.1 RPR OPNET Model User Guide Revision Nov7 Yan F. Robichaud Mark Joseph Francisco Changcheng Huang Optical Networks Laboratory Carleton University 7 November 2002 Table Of Contents 0 Overview...1

More information

Quality of Service (QoS)

Quality of Service (QoS) Quality of Service (QoS) A note on the use of these ppt slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you can add, modify, and delete

More information

director executor user program user program signal, breakpoint function call communication channel client library directing server

director executor user program user program signal, breakpoint function call communication channel client library directing server (appeared in Computing Systems, Vol. 8, 2, pp.107-134, MIT Press, Spring 1995.) The Dynascope Directing Server: Design and Implementation 1 Rok Sosic School of Computing and Information Technology Grith

More information

perform well on paths including satellite links. It is important to verify how the two ATM data services perform on satellite links. TCP is the most p

perform well on paths including satellite links. It is important to verify how the two ATM data services perform on satellite links. TCP is the most p Performance of TCP/IP Using ATM ABR and UBR Services over Satellite Networks 1 Shiv Kalyanaraman, Raj Jain, Rohit Goyal, Sonia Fahmy Department of Computer and Information Science The Ohio State University

More information

ATM Logical Connections: VCC. ATM Logical Connections: VPC

ATM Logical Connections: VCC. ATM Logical Connections: VPC ATM Logical Connections: VCC Logical Connections in ATM are referred to as virtual channel connections (VCCs). Virtual channel (VC) is a generic term used to describe unidirectional transport of ATM cells

More information

Simulation-Based Fault Injection as a Verification Oracle for the Engineering of Time-Triggered Ethernet networks

Simulation-Based Fault Injection as a Verification Oracle for the Engineering of Time-Triggered Ethernet networks Simulation-Based Fault Injection as a Verification Oracle for the Engineering of Time-Triggered Ethernet networks Loïc FEJOZ, RealTime-at-Work (RTaW) Bruno REGNIER, CNES Philippe, MIRAMONT, CNES Nicolas

More information

Real-Time Communications. LS 12, TU Dortmund

Real-Time Communications. LS 12, TU Dortmund Real-Time Communications Prof. Dr. Jian-Jia Chen LS 12, TU Dortmund 20, Jan., 2016 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 1 / 29 Random Access no access control; requires low medium utilization Prof.

More information

Assignment 4. Overview. Prof. Stewart Weiss. CSci 335 Software Design and Analysis III Assignment 4

Assignment 4. Overview. Prof. Stewart Weiss. CSci 335 Software Design and Analysis III Assignment 4 Overview This assignment combines several dierent data abstractions and algorithms that we have covered in class, including priority queues, on-line disjoint set operations, hashing, and sorting. The project

More information

Fine-grained Simulation in the Design of Automotive Communication Systems

Fine-grained Simulation in the Design of Automotive Communication Systems Fine-grained Simulation in the Design of Automotive Communication Systems Aurélien Monot, Nicolas Navet, Bernard Bavoux, Cristian Maxim To cite this version: Aurélien Monot, Nicolas Navet, Bernard Bavoux,

More information

Communication. Overview

Communication. Overview Communication Chapter 2 1 Overview Layered protocols Remote procedure call Remote object invocation Message-oriented communication Stream-oriented communication 2 Layered protocols Low-level layers Transport

More information

Talk Spurt. Generator. In Assembler. Size of samples collected Delay = Voice coding rate SSCS PDU CPCS SDU CPCS CPCS PDU SAR SDU SAR SAR PDU.

Talk Spurt. Generator. In Assembler. Size of samples collected Delay = Voice coding rate SSCS PDU CPCS SDU CPCS CPCS PDU SAR SDU SAR SAR PDU. Development of simulation models for AAL1 and AAL5 Sponsor: Sprint R. Yelisetti D. W. Petr Technical Report ITTC-FY98-TR-13110-02 Information and Telecommunications Technology Center Department of Electrical

More information

Scheduling Computations on a Software-Based Router

Scheduling Computations on a Software-Based Router Scheduling Computations on a Software-Based Router ECE 697J November 19 th, 2002 ECE 697J 1 Processor Scheduling How is scheduling done on a workstation? What does the operating system do? What is the

More information

Benchmarking the CGNS I/O performance

Benchmarking the CGNS I/O performance 46th AIAA Aerospace Sciences Meeting and Exhibit 7-10 January 2008, Reno, Nevada AIAA 2008-479 Benchmarking the CGNS I/O performance Thomas Hauser I. Introduction Linux clusters can provide a viable and

More information

Continuity and Synchronization in MPEG. P. Venkat Rangan, Srihari SampathKumar, and Sreerang Rajan. Multimedia Laboratory. La Jolla, CA

Continuity and Synchronization in MPEG. P. Venkat Rangan, Srihari SampathKumar, and Sreerang Rajan. Multimedia Laboratory. La Jolla, CA Continuity and Synchronization in MPEG P. Venkat Rangan, Srihari SampathKumar, and Sreerang Rajan Multimedia Laboratory Department of Computer Science and Engineering University of California at San Diego

More information

\Classical" RSVP and IP over ATM. Steven Berson. April 10, Abstract

\Classical RSVP and IP over ATM. Steven Berson. April 10, Abstract \Classical" RSVP and IP over ATM Steven Berson USC Information Sciences Institute April 10, 1996 Abstract Integrated Services in the Internet is rapidly becoming a reality. Meanwhile, ATM technology is

More information

Bachelor Thesis. Analyzing and Implementing Resource Synchronization Protocols on RTEMS in Multi-core Systems. Nadzeya Liabiodka Juni, 2017

Bachelor Thesis. Analyzing and Implementing Resource Synchronization Protocols on RTEMS in Multi-core Systems. Nadzeya Liabiodka Juni, 2017 Bachelor Thesis Analyzing and Implementing Resource Synchronization Protocols on RTEMS in Multi-core Systems Nadzeya Liabiodka Juni, 2017 Advisors: Prof. Dr. Jian-Jia Chen M.Sc. Kuan-Hsun Chen Faculty

More information

Understanding and Using the Controller Area Network Communication Protocol

Understanding and Using the Controller Area Network Communication Protocol Marco Di Natale Haibo Zeng Paolo Giusto Arkadeb Ghosal Understanding and Using the Controller Area Network Communication Protocol Theory and Practice ^Spri ringer Contents..? 1 The CAN 2.0b Standard 1

More information

Master Course Computer Networks IN2097

Master Course Computer Networks IN2097 Chair for Network Architectures and Services Prof. Carle Department for Computer Science TU München Chair for Network Architectures and Services Prof. Carle Department for Computer Science TU München Master

More information

Managing temporal allocation in Integrated Modular Avionics

Managing temporal allocation in Integrated Modular Avionics Managing temporal allocation in Integrated Modular Avionics Nesrine Badache, Katia Jaffrès-Runser, Jean-Luc Scharbarg and Christian Fraboul University of Toulouse IRIT-INPT/ENSEEIHT 2, rue Charles Camichel,

More information

FlexRay International Workshop. Protocol Overview

FlexRay International Workshop. Protocol Overview FlexRay International Workshop 4 th March 2003 Detroit Protocol Overview Dr. Christopher Temple - Motorola FlexRay principles Provide a communication infrastructure for future generation highspeed control

More information

Southern Polytechnic State University Spring Semester 2009

Southern Polytechnic State University Spring Semester 2009 Southern Polytechnic State University Spring Semester 2009 ECET 4840 Laboratory Exercises 9: Router Queuing Configuration and Testing Objective: Students will investigate the effect of varying link capacity

More information

Multiprocessor scheduling

Multiprocessor scheduling Chapter 10 Multiprocessor scheduling When a computer system contains multiple processors, a few new issues arise. Multiprocessor systems can be categorized into the following: Loosely coupled or distributed.

More information

A programming environment to control switching. networks based on STC104 packet routing chip 1

A programming environment to control switching. networks based on STC104 packet routing chip 1 A programming environment to control switching networks based on STC104 packet routing chip 1 I.C. Legrand 2, U. Schwendicke, H. Leich, M. Medinnis, A. Koehler, P. Wegner, K. Sulanke, R. Dippel, A. Gellrich

More information

Master Course Computer Networks IN2097

Master Course Computer Networks IN2097 Chair for Network Architectures and Services Prof. Carle Department for Computer Science TU München Master Course Computer Networks IN2097 Prof. Dr.-Ing. Georg Carle Christian Grothoff, Ph.D. Chair for

More information

Introduction of CAN FD into the next generation of vehicle E/E architectures

Introduction of CAN FD into the next generation of vehicle E/E architectures Introduction of CAN FD into the next generation of vehicle E/E architectures 16 th international CAN Conference, March 7-8 2017, Nuremberg Marc Schreiner, Daimler AG Agenda Introduction Future Vehicle

More information

6LPXODWLRQÃRIÃWKHÃ&RPPXQLFDWLRQÃ7LPHÃIRUÃDÃ6SDFH7LPH $GDSWLYHÃ3URFHVVLQJÃ$OJRULWKPÃRQÃDÃ3DUDOOHOÃ(PEHGGHG 6\VWHP

6LPXODWLRQÃRIÃWKHÃ&RPPXQLFDWLRQÃ7LPHÃIRUÃDÃ6SDFH7LPH $GDSWLYHÃ3URFHVVLQJÃ$OJRULWKPÃRQÃDÃ3DUDOOHOÃ(PEHGGHG 6\VWHP LPXODWLRQÃRIÃWKHÃ&RPPXQLFDWLRQÃLPHÃIRUÃDÃSDFHLPH $GDSWLYHÃURFHVVLQJÃ$OJRULWKPÃRQÃDÃDUDOOHOÃ(PEHGGHG \VWHP Jack M. West and John K. Antonio Department of Computer Science, P.O. Box, Texas Tech University,

More information

A Practical Message ID Assignment Policy for Controller Area Network that Maximizes Extensibility

A Practical Message ID Assignment Policy for Controller Area Network that Maximizes Extensibility A Practical Message ID Assignment Policy for Controller Area Network that Maximizes Extensibility Florian Pölzlbauer Virtual Vehicle Research Center, Austria florian.poelzlbauer@v2c2.at Robert I. Davis

More information

The Global Standard for Mobility (GSM) (see, e.g., [6], [4], [5]) yields a

The Global Standard for Mobility (GSM) (see, e.g., [6], [4], [5]) yields a Preprint 0 (2000)?{? 1 Approximation of a direction of N d in bounded coordinates Jean-Christophe Novelli a Gilles Schaeer b Florent Hivert a a Universite Paris 7 { LIAFA 2, place Jussieu - 75251 Paris

More information

Asynchronous Transfer Mode

Asynchronous Transfer Mode ATM Asynchronous Transfer Mode CS420/520 Axel Krings Page 1 Protocol Architecture (diag) CS420/520 Axel Krings Page 2 1 Reference Model Planes User plane Provides for user information transfer Control

More information

The Compositional C++ Language. Denition. Abstract. This document gives a concise denition of the syntax and semantics

The Compositional C++ Language. Denition. Abstract. This document gives a concise denition of the syntax and semantics The Compositional C++ Language Denition Peter Carlin Mani Chandy Carl Kesselman March 12, 1993 Revision 0.95 3/12/93, Comments welcome. Abstract This document gives a concise denition of the syntax and

More information

Configurable Queue Depth

Configurable Queue Depth This feature allows you to configure (resize) the depth of the packet queues on your network. That is, you can set the maximum number (the depth) of packets that a class queue can hold, which in turn controls

More information

Setting-up WAN Emulation using WAN-Bridge Live-CD v1.10

Setting-up WAN Emulation using WAN-Bridge Live-CD v1.10 Setting-up WAN Emulation using WAN-Bridge Live-CD v1.10 Contents Document version 0.1 Overview... 2 What s New in Version 1.10... 2 Software Installed on the CD... 2 License... 3 Sample Lab Configurations...

More information

The Avalanche Myrinet Simulation Package. University of Utah, Salt Lake City, UT Abstract

The Avalanche Myrinet Simulation Package. University of Utah, Salt Lake City, UT Abstract The Avalanche Myrinet Simulation Package User Manual for V. Chen-Chi Kuo, John B. Carter fchenchi, retracg@cs.utah.edu WWW: http://www.cs.utah.edu/projects/avalanche UUCS-96- Department of Computer Science

More information

MATLAB Expo Simulation Based Automotive Communication Design using MATLAB- SimEvent. Sudhakaran M Anand H General Motors

MATLAB Expo Simulation Based Automotive Communication Design using MATLAB- SimEvent. Sudhakaran M Anand H General Motors MATLAB Expo 2013 Simulation Based Automotive Communication Design using MATLAB- SimEvent Sudhakaran M Anand H General Motors 1 Agenda Introduction Different Analysis Methods Analytical vs. Simulation Approach

More information

IEEE Time-Sensitive Networking (TSN)

IEEE Time-Sensitive Networking (TSN) IEEE 802.1 Time-Sensitive Networking (TSN) Norman Finn, IEEE 802.1CB, IEEE 802.1CS Editor Huawei Technologies Co. Ltd norman.finn@mail01.huawei.com Geneva, 27 January, 2018 Before We Start This presentation

More information

Schedulability-Driven Communication Synthesis for Time Triggered Embedded Systems

Schedulability-Driven Communication Synthesis for Time Triggered Embedded Systems Schedulability-Driven Communication Synthesis for Time Triggered Embedded Systems Paul Pop, Petru Eles, and Zebo Peng Dept. of Computer and Information Science, Linköping University, Sweden {paupo, petel,

More information

Introduction of CAN FD into the next generation of vehicle E/ E architectures. Vector CAN FD Symposium 2017, Marc Schreiner, Daimler AG

Introduction of CAN FD into the next generation of vehicle E/ E architectures. Vector CAN FD Symposium 2017, Marc Schreiner, Daimler AG Introduction of CAN FD into the next generation of vehicle E/ E architectures Vector CAN FD Symposium 2017, 16.2.2017 Marc Schreiner, Daimler AG Agenda Introduction Future Vehicle Architectures Integration

More information

Laxmi N. Bhuyan, Ravi R. Iyer, Tahsin Askar, Ashwini K. Nanda and Mohan Kumar. Abstract

Laxmi N. Bhuyan, Ravi R. Iyer, Tahsin Askar, Ashwini K. Nanda and Mohan Kumar. Abstract Performance of Multistage Bus Networks for a Distributed Shared Memory Multiprocessor 1 Laxmi N. Bhuyan, Ravi R. Iyer, Tahsin Askar, Ashwini K. Nanda and Mohan Kumar Abstract A Multistage Bus Network (MBN)

More information

Insights into the performance and configuration of TCP in Automotive Ethernet Networks

Insights into the performance and configuration of TCP in Automotive Ethernet Networks Insights into the performance and configuration of TCP in Automotive Ethernet Networks Jörn MIGGE, RealTime-at-Work (RTaW) Nicolas NAVET, University of Luxembourg 2018 IEEE Standards Association (IEEE-SA)

More information

OSEK/VDX. Communication. Version January 29, 2003

OSEK/VDX. Communication. Version January 29, 2003 Open Systems and the Corresponding Interfaces for Automotive Electronics OSEK/VDX Communication Version 3.0.1 January 29, 2003 This document is an official release and replaces all previously distributed

More information

Developing deterministic networking technology for railway applications using TTEthernet software-based end systems

Developing deterministic networking technology for railway applications using TTEthernet software-based end systems Developing deterministic networking technology for railway applications using TTEthernet software-based end systems Project n 100021 Astrit Ademaj, TTTech Computertechnik AG Outline GENESYS requirements

More information

Dynamic Voltage Scaling of Periodic and Aperiodic Tasks in Priority-Driven Systems Λ

Dynamic Voltage Scaling of Periodic and Aperiodic Tasks in Priority-Driven Systems Λ Dynamic Voltage Scaling of Periodic and Aperiodic Tasks in Priority-Driven Systems Λ Dongkun Shin Jihong Kim School of CSE School of CSE Seoul National University Seoul National University Seoul, Korea

More information

T H. Runable. Request. Priority Inversion. Exit. Runable. Request. Reply. For T L. For T. Reply. Exit. Request. Runable. Exit. Runable. Reply.

T H. Runable. Request. Priority Inversion. Exit. Runable. Request. Reply. For T L. For T. Reply. Exit. Request. Runable. Exit. Runable. Reply. Experience with Real-Time Mach for Writing Continuous Media Applications and Servers Tatsuo Nakajima Hiroshi Tezuka Japan Advanced Institute of Science and Technology Abstract This paper describes the

More information

JAMS: Jitter-Aware Message Scheduling for FlexRay Automotive Networks Special Session Paper

JAMS: Jitter-Aware Message Scheduling for FlexRay Automotive Networks Special Session Paper JAMS: Jitter-Aware Message Scheduling for FlexRay Automotive Networks Special Session Paper Vipin Kumar Kukkala*, Sudeep Pasricha*, Thomas Bradley *Department of Electrical and Computer Engineering Department

More information

(Preliminary Version 2 ) Jai-Hoon Kim Nitin H. Vaidya. Department of Computer Science. Texas A&M University. College Station, TX

(Preliminary Version 2 ) Jai-Hoon Kim Nitin H. Vaidya. Department of Computer Science. Texas A&M University. College Station, TX Towards an Adaptive Distributed Shared Memory (Preliminary Version ) Jai-Hoon Kim Nitin H. Vaidya Department of Computer Science Texas A&M University College Station, TX 77843-3 E-mail: fjhkim,vaidyag@cs.tamu.edu

More information

Disk. Real Time Mach Disk Device Driver. Open/Play/stop CRAS. Application. Shared Buffer. Read Done 5. 2 Read Request. Start I/O.

Disk. Real Time Mach Disk Device Driver. Open/Play/stop CRAS. Application. Shared Buffer. Read Done 5. 2 Read Request. Start I/O. Simple Continuous Media Storage Server on Real-Time Mach Hiroshi Tezuka y Tatsuo Nakajima Japan Advanced Institute of Science and Technology ftezuka,tatsuog@jaist.ac.jp http://mmmc.jaist.ac.jp:8000/ Abstract

More information

IBM Software Group. IBM WebSphere MQ V7.0. Introduction and Technical Overview. An IBM Proof of Technology IBM Corporation

IBM Software Group. IBM WebSphere MQ V7.0. Introduction and Technical Overview. An IBM Proof of Technology IBM Corporation IBM Software Group IBM WebSphere MQ V7.0 Introduction and Technical Overview An IBM Proof of Technology 2008 IBM Corporation Unit Agenda Why is Messaging Important to the Enterprise? What is WebSphere

More information

Design and Implementation of Distributed Algorithms for Their Application in Telematic Services. Use case: Shared Calendar

Design and Implementation of Distributed Algorithms for Their Application in Telematic Services. Use case: Shared Calendar Design and Implementation of Distributed Algorithms for Their Application in Telematic Services. Use case: Shared Calendar A Master's Thesis Submitted to the Faculty of the Escola Tècnica d'enginyeria

More information

Can controller implementing features for reliable communication 1

Can controller implementing features for reliable communication 1 Can controller implementing features for reliable communication 1 J.C. Campelo, A. Rubio, F. Rodríguez, J.J. Serrano Dept. of Computer Engineering, Technical University of Valencia (SPAIN) {jcampelo, alicia,

More information

warped: A Time Warp Simulation Kernel for Analysis and Application Development Dale E. Martin, Timothy J. McBrayer, and Philip A.

warped: A Time Warp Simulation Kernel for Analysis and Application Development Dale E. Martin, Timothy J. McBrayer, and Philip A. Published in the Proceedings of the Hawaiian International Conference on System Sciences, HICSS-1996. c 1996, IEEE. Personal use of this material is permitted. However permission to reprint or republish

More information

802.1Qbv: Performance / Complexity Tradeoffs

802.1Qbv: Performance / Complexity Tradeoffs 802.1Qbv: Performance / Complexity Tradeoffs Rodney Cummings National Instruments Automotive Networking History (1 of 2) During FlexRay s formation, common complaint CAN is not deterministic CAN media

More information

ECE519 Advanced Operating Systems

ECE519 Advanced Operating Systems IT 540 Operating Systems ECE519 Advanced Operating Systems Prof. Dr. Hasan Hüseyin BALIK (10 th Week) (Advanced) Operating Systems 10. Multiprocessor, Multicore and Real-Time Scheduling 10. Outline Multiprocessor

More information

Model transformation and scheduling analysis of an AUTOSAR system

Model transformation and scheduling analysis of an AUTOSAR system Model transformation and scheduling analysis of an AUTOSAR system Ahmed Daghsen, Khaled Chaaban, Sébastien Saudrais ESTACA campus ouest Embedded systems laboratory Laval, 53000, France ahmed.daghsen@estaca.fr

More information

2 J. Karvo et al. / Blocking of dynamic multicast connections Figure 1. Point to point (top) vs. point to multipoint, or multicast connections (bottom

2 J. Karvo et al. / Blocking of dynamic multicast connections Figure 1. Point to point (top) vs. point to multipoint, or multicast connections (bottom Telecommunication Systems 0 (1998)?? 1 Blocking of dynamic multicast connections Jouni Karvo a;, Jorma Virtamo b, Samuli Aalto b and Olli Martikainen a a Helsinki University of Technology, Laboratory of

More information

Resource allocation in networks. Resource Allocation in Networks. Resource allocation

Resource allocation in networks. Resource Allocation in Networks. Resource allocation Resource allocation in networks Resource Allocation in Networks Very much like a resource allocation problem in operating systems How is it different? Resources and jobs are different Resources are buffers

More information

CAN send and receive with hardware timestamping

CAN send and receive with hardware timestamping CAN send and receive with hardware timestamping Hauke Webermann, esd electronic system design gmbh Modern CAN controllers, especially for FPGA integration, keep growing stronger and more versatile. Also

More information

Installation. List Wrangler - Mailing List Manager for GTK+ Part I. 1 Requirements. By Frank Cox. September 3,

Installation. List Wrangler -  Mailing List Manager for GTK+ Part I. 1 Requirements. By Frank Cox. September 3, List Wrangler - Email Mailing List Manager for GTK+ By Frank Cox September 3, 2012 theatre@melvilletheatre.com Abstract Do you have a mailing list of people that you send periodic emails to? If so, List

More information

UN/CEFACT Core Components Data Type Catalogue Version December 2007

UN/CEFACT Core Components Data Type Catalogue Version December 2007 1 2 3 4 5 6 7 8 9 UN/CEFACT Core s Data Type Catalogue Version 2.01 7 December 2007 UN/CEFACT Core s Data Type Catalogue Version 2.01 of 7 December 2007 Page 1 of 137 10 11 12 13 14 15 16 Abstract This

More information

EPON Scheduling Protocol Requirements

EPON Scheduling Protocol Requirements EPON Scheduling Protocol Requirements A system-level perspective Glen Kramer (kramer@cs.ucdavis.edu) Ryan Hirth (RHirth@terawave.com) Ed Boyd (ed.boyd@teknovus.com) Onn Haran (onn.haran@passave.com) Kent

More information

Probabilistic Worst-Case Response-Time Analysis for the Controller Area Network

Probabilistic Worst-Case Response-Time Analysis for the Controller Area Network Probabilistic Worst-Case Response-Time Analysis for the Controller Area Network Thomas Nolte, Hans Hansson, and Christer Norström Mälardalen Real-Time Research Centre Department of Computer Engineering

More information