AFDX is the standard switched Ethernet solution for the transmission of avionics flows. Today's AFDX deployments in commercial aircrafts are lightly loaded to ensure the determinism of control and command operations. Manufacturers envision to take advantage of the remaining AFDX bandwidth to transmit additional non avionics flows (video, audio, service). These flows must not compromise the in-time transmission of avionics ones: constraints on jitter at source end system and end-to-end latency have to be insured for each avionics flow. In this paper, we investigate the scheduling of avionics and additional flows, mainly at the end system level. We show that an event-triggered strategy is better than a time-triggered one for additional flows at source level, but it might compromise the jitter constraint of avionics flows and increase the end-to-end latency of additional ones. We consider two time-triggered scheduling strategies, i.e. an optimal one and a simpler one based on a heuristic. We show that the later one performs nearly as well as the former one and that, for both of them, the difference with an event-triggered strategy at source level is limited and can be statically bounded.

In order to handle mixed criticality flows in a realtime embedded network, switched Ethernet with Quality of Service (QoS) facilities has become a popular solution. Deficit Round Robin (DRR) is such a QoS facility. Worst-Case Traversal Time (WCTT) analysis is mandatory for such systems, in order to ensure that end-to-end delay constraints are met. Network Calculus is a classical approach to achieve this WCTT analysis. A solution has been proposed for switched Ethernet with DRR. It computes pessimistic upper bounds on end-to-end latencies. This pessimism is partly due to the fact that the scheduling of flows by end systems is not considered in the analysis. This scheduling can be modeled by offsets between flows. This modeling has been integrated in WCTT analysis of switched Ethernet with First In First Out (FIFO) scheduling. It leads to a significant reduction of delay upper bounds. The contribution of this paper is to integrate the offsets in the WCTT analysis for switched Ethernet with DRR and to evaluate the reduction on delay upper bounds, considering a realistic case study.

Avionics Full Duplex switched Ethernet (AFDX) is the de facto standard for the transmission of critical avionics flows. It is a specific switched Ethernet solution based on First-in First-out (FIFO) scheduling. Worst-case traversal time (WCTT) analysis is mandatory for such flows, since timing constraints have to be guaranteed. A classical approach in this context is Network Calculus (NC). However, NC introduces some pessimism in the WCTT computation. Moreover, the worst-case often corresponds to very rare scenarios. Thus, the network architecture is most of the time lightly loaded. Typically, less than 10 % of the available bandwidth is used for the transmission of avionics lows on an AFDX network embedded in an aircraft. One solution to improve the utilization of the network is to introduce Quality of Service (QoS) mechanisms. Deficit Round Robin (DRR) is such a mechanism and it is envisioned for future avionics networks. A WCTT analysis has been proposed for DRR. It is based on NC. It doesn't make any assumption on the scheduling of flows by end systems. The first contribution of this paper is to identify sources of pessimism of this approach and to propose an improved solution which removes part of this pessimism. The second contribution is to show how the scheduling of flows can be integrated in this optimized DRR approach, thanks to offsets. An evaluation on a realistic case study shows that both contributions bring significantly tighter bounds on worst-case latencies.

Wireless networks have become a very attractive solution for soft real-time data transport in the industry. For such technologies to carry real-time traffic, reliable bounds on end-to-end communication delays have to be ascertained to warrant a proper system behavior. As for legacy wired embedded and real-time networks, two main wireless multiple access methods can be leveraged: one is time division multiple access (TDMA), which follows a time-triggered paradigm, and the other is carrier sense multiple access with collision avoidance (CSMA/CA), which follows an event-triggered paradigm. This paper proposes an analytical comparison of the time behavior of two representative TDMA and CSMA/CA protocols in terms of the worst-case end-to-end delay. This worst-case delay is expressed in a probabilistic manner because our analytical framework captures the versatility of the wireless medium. Analytical delay bounds are obtained from delay distributions, which are compared to fine-grained simulation results. Exhibited study cases show that TDMA can offer smaller or larger worst-case bounds than CSMA/CA depending on its settings.

Many-core architectures are promising hardware to design real-time systems. However, the worst-case behavior of the Network-on-Chip (NoC) for both core-to-core and core-to-Input/Output (I/O) communications of critical applications must be established. The mapping over the NoC of both critical and non-critical applications has an impact on the network contention these critical communications exhibit. So far, all existing mapping strategies have focused on core-to-core communications. However, many-cores in embedded real-time systems will be integrated within backbone Ethernet networks, as they mostly provide Ethernet controllers as I/O interfaces. In a previous work we have shown that Ethernet packets can be dropped due to an internal congestion in a Tilera-like NoC. In this work, we describe and evaluate a mapping strategy for such Tilera-like NoCs that minimizes the contention of core-to-I/O critical flows in order to solve this problem. Experimental results on real avionics applications show significant improvements of core-to-IO flows transmission delays, without significantly impacting transmission delays of core-to-core flows.

Current avionics architectures implemented on large aircraft use complex processors, which are shared by many avionics applications according Integrated Modular Avionics (IMA) concepts. Using less complex processors on smaller aircraft such as helicopters leads to a distributed IMA architecture. Allocation of the avionics applications on a distributed architecture has to deal with two main challenges. A first problem is about the feasibility of a static allocation of partitions on each processing element. The second problem is the worst-case end-to-end communication delay analysis: due to the scheduling of partitions on processing elements which are not synchronized, some allocation schemes are not valid. This paper first presents a mapping algorithm using an integrated approach taking into account these two issues. In a second step, we evaluate, on a realistic helicopter case study, the feasibility of mapping a given application on a variable number of processing elements. Finally, we present a scalability analysis of the proposed mapping algorithm.

Many-core architectures are more promising hardware to design real-time systems than multi-core systems as they should enable an easier mastered integration of an higher number of applications, potentially of different level of criticalities. However, the worst-case behavior of the Network-on-Chip (NoC) for both inter-core and core-to-Input/Output (I/O) communications of critical applications must be established. We use the term core-to-I/O for both core communications from or to I/O interfaces. The mapping over the NoC of both critical and non-critical applications has an impact on the network contention these critical communications exhibit. So far, all existing mapping strategies have focused on inter-core communications. However, we claim that many-cores in embedded real-time systems will be integrated within backbone ethernet networks, as they mostly provide ethernet controllers as I/O interfaces. In this work, we first show that ethernet packets can be dropped due to an internal congestion in the NoC, if these core-to-I/O communications are not taken into account while mapping applications. To this end, we rely on a case study from the avionic domain. It is made of a critical Full Authority Digital Engine (FADEC) application and a non-critical Health Monitoring (HM) application of the engine, used for recognizing incipient failure conditions. Based on this analysis, we introduce our approach to map critical and non critical real-time applications over many-cores that reduces the WCTT of core-to-I/O communications. We show for two variants of our case study that our algorithm successfully find a mapping that avoids ethernet packets, whose payload are making the core-to-I/O communications, to be dropped. This demonstrates the benefits of our proposal compared to a state of the art mapping strategy that fails to do so.

In this paper, we consider two Network-on-Chip (NoC) architectures used within commercially available many-core systems, namely Tilera TILE64 which implements flow regulation within routers and KalRay MPPA 256 which implements flow regulation in source nodes. The Worst-Case Traversal Time (WCTT) on the NoC has to be bounded for real-time applications, and buffers should never overflow. Different worst-case analysis approaches have been proposed for each of these NoC architectures. However, no general worst-case analysis supporting both NoC architectures exists in the literature and most approaches are specific to one of the studied NoC. In this paper, we propose to use Recursive Calculus (RC) method for Tilera and KalRay. Furthermore, we compare the performances on a preliminary case study, in terms of WCTT and required buffer capacity. It allows to quantify the trade-off between delays and buffer occupancy.

Wireless networks have become a very attractive solution for soft real-time data transport in the industry. For such technologies to carry real-time traffic, reliable bounds on end-to-end communication delays have to be ascertained to warrant a proper system behavior. As for legacy wired embedded and real-time networks, two main wireless multiple access methods can be leveraged: (i) time division multiple access (TDMA), which follows a time-triggered paradigm and (ii) Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA), which follows an event-triggered paradigm. This paper proposes an analytical comparison of the time behavior of two representative TDMA and CSMA/CA protocols in terms of worst-case end-to-end delay. This worst-case delay is expressed in a probabilistic manner because our analytical framework captures the versatility of the wireless medium. Analytical delay bounds are obtained from delay distributions, which are compared to fine-grained simulation results. Exhibited study cases show that TDMA can offer smaller or larger worst-case bounds than CSMA/CA depending on its settings.

Recent civil airborne platforms are produced using Integrated Modular Avionics (IMA). IMA promotes both sharing of execution and communication resources by the avionics applications. Designs following IMA decrease the weight of avionics equipment and improve the whole system scalability. However, the price to pay for these benefits is an increase of the system's complexity, triggering a challenging system integration process. Central to this integration step are the timing requirements of avionics applications: the system integrator has to find a mapping of applications and communications on the available target architecture (processing modules, networks, etc.) such as end-to-end delay constraints are met. These challenges stress the need for a tool capable of evaluating different integration choices in the early design stages of IMA. In this paper, we present and formalize the problem of spatial and temporal integration of an IMA system. Then, we focus on the temporal allocation problem which is critical to ensure a proper timely behavior of the system. Two main properties are presented to ensure perfect data transmission for hard real-time flows. To quantify the quality of a set of valid temporal allocations, CPM utilization and communication robustness performance criteria are defined. We show on an example that both criteria are antagonist and that they can be leveraged to choose an allocation that either improves the system computing performance or the robustness of the network.

The increasing complexity and heterogeneity of avionics networks make resource optimization a challenging task. In contrast to many previous approaches pursuing the optimization of traffic-source mapping and backbone network analysis, our work presented herein mainly focuses on the optimization of interconnection devices for multi-cluster avionics networks. In this paper, we introduce an optimized interconnection device, integrating novel frame packing strategies and schedulability analysis to enhance the communications between an AFDX-like backbone network and various peripheral sensor/actuator networks in terms of resource savings. The performance analysis conducted on a representative avionics communication architecture highlights the efficiency of our proposal to save resources particularly consumed bandwidth. These latter is considered as an important feature for avionics applications to guarantee easy incremental design during the long lifetime of an aircraft.

Recent modular avionics architectures have been designed to share computation and communication resources. However, such an approach creates new challenges to master the temporal properties of avionics applications. In the context of IMA (Integrated Modular Avionics), it is crucial to investigate the performance gains that future integration platforms and software will propose. This paper brings to light the impact of spatial and temporal integration choices on the communication performance (e.g. message loss rate, latencies, ...). The conclusion of this investigation is that it is necessary to conduct a thorough modeling and simulation study of an IMA architecture integrating several applications during its early design stages.

Spacewire is a real-time communication network for use onboard satellites. It has been designed to transmit both payload and control/command data. To guarantee that communications respect the real-time constraints, designers use tools to compute the worst-case end-to-end delays. Among these tools, recursive flow analysis and Network Calculus approaches have been studied. This paper proposes to use the model-checking approach based on timed automata. A case study based on an industrial one is shown. Our approach is compared with recursive flow analysis and Network Calculus.

The flexibility of wireless connectivity is appealing in the context of industrial networks. This paper discusses the use of a wireless protocol to interconnect remotely located fieldbuses. The focus of this paper is to analyze the feasibility and design issues related to this type of hybrid network architecture. Therefore, we concentrate on deriving appropriate bridging strategies for a network topology composed of remotely located CAN buses interconnected through a wireless local area network following the IEEE802.11g protocol. Using this very simple and cost-effective architecture, we show in this study that by intelligently leveraging the features of CAN and IEEE802.11g in the interconnection policies employed, the missed deadlines can be limited for the CAN frames carried by the wireless network.

Worst case backlog evaluation is a key issue to avoid under or over sizing of output port buffers for store-and-forward switches. Typically, the dimensioning of switches in the context of avionics is at least as important as the upper bounding of the end-to-end delays. This paper presents a new method based on the Trajectory approach for backlog evaluation of output ports of AFDX switches. On an industrial AFDX configuration, this new method leads to an average buffer size reduction of 10% compared to the existing Network Calculus approach.

Space Wire is a standard of on-board networks for satellites promoted by the ESA. As the ESA plans to use Space Wire as the sole network for both critical and non-critical traffics, network designers need tools to check that all the critical messages meet their deadlines. We previously proposed two such tools to compute an upper-bound on the worst-case end-to-end delay of a packet traversing a Space Wire network. The main contribution of this paper is the comparison of those two methods on a network configuration provided by Thales Alenia Space that is representative of next generation large satellites. The goal is to identify the key parameters that affect the bounds computed by the methods. We then conduct a sensitivity analysis on simpler network configurations to study the impact of those parameters on the methods and determine which method works better in different situations.

AFDX (Avionics Full Duplex Switched Ethernet) standardised as ARINC 664 is a major upgrade for avionics systems. Guarantees on worst case end-to-end communication delays are required for certification purposes. These guarantees are obtained thanks to safe upper bounds computed by Network Calculus and trajectory approaches. Indeed, up to now, the computation of an exact worst case delay is intractable for industrial size configurations. An existing approach, based on timed automata, allows the analysis of periodic AFDX configurations with up to 18 flows. This paper proposes a modified timed automata approach which not only increases the size of the configuration for which an exact worst case can be obtained but also supports sporadic flows.

The current avionics communication architecture has recently arisen some limitations for meeting the emerging requirements of new generation aircraft in terms of modularity, weight and integration costs. In order to cope with these limitations, an alternative avionics communication architecture based on a multi-cluster embedded network is proposed in this paper. The critical avionics subsystems still are interconnected via the backbone network AFDX, however the sensors and actuators are grouped to be interconnected via CAN buses, independently of the associated avionics subsystems. The obtained clusters will be interconnected via specific gateways to handle the heterogeneity between the AFDX and CAN buses. This paper focuses first on the relevant aspects of our proposal and the offered real time guarantees required by critical avionics applications. Then, since an efficient bandwidth consumption is inherently important to guarantee an easy incremental design process, an optimized gateway design with a new frame packing strategy is proposed and evaluated in our context.

Packet classification is the process of matching multiple packet header fields against a possibly large set of filters to find a matching rule. Packet classification was implemented in several application areas such as service differentiation, firewalls, QoS and secure routing. In this paper, we extend the firewall session table to speed up QoS marking process, and thus, to save QoS Classification time. Our proposed algorithm and system have been implemented in the kernel of NetBSD. Experimental tests show that the new implementation can save about 10 μsec per packet if a QoS classification of 10000 filters is used. Moreover, the new implementation needs just less than 0.5 μsec to mark packet regardless of the size of the filtering rules. To evaluate the performance of our new implementation with respect to the QoS characteristics, we measured four important QoS metrics (throughput, packet loss rate, delay and jitter) and compared them with the classical implementation. We finally demonstrate that a significant enhancement is remarked using our new algorithm.

In Avionics Switched Ethernet network (AFDX), guarantees on worst-case end-to-end (E2E) communication delays are obtained thanks to safe upper bounds computed by Network Calculus and Trajectory Approaches. Up to now, the computation of an exact worst-case delay is intractable, except for very small configurations. This paper proposes a modified timed automata approach which increases the size of the configuration for which an exact worst-case can be obtained. This is achieved thanks to a drastic reduction of the search space.

Our goal is to design an IEEE 802.11e/AFDX (WiFi with QoS/Avionics Full DupleX switched Ethernet) hybrid network. More precisely the aim is to guarantee the QoS requirements of AFDX traffics transmitted on an IEEE 802.11e wireless network, for on-ground maintenance applications. The AFDX requirements are related to the temporal constraints (latency and jitter). The use of IEEE 802.11e induces several constraints due to the wireless communication medium (QoS, non-deterministic access method, high packet loss rate, transmission errors). In this paper, we present a HCCA (HCF Controlled Channel Access) scheduling algorithm named AWS (AFDX Wireless Scheduler) which improves the performance of the HCCA Reference Scheduler (RS) in order to convey AFDX traffics on an IEEE 802.11e wireless network. AWS is based on the classification of flows, on the retransmission management of frames and on the guarantee of deadline and maximum jitter of frames. We also present, in this paper, an optimized version of AWS (OAWS) which uses the available bandwidth of TXOP periods for transmitting frames near of their deadline and frames in retransmission. Performance evaluation results show that a very large reduction of dropped packets and a better throughput are obtained with AWS compared to RS. The performance of the optimized version of AWS (OAWS) are better than those of AWS.

In this paper, we present a HCCA (HCF Controlled Channel Access) scheduler called AWS (AFDX Wireless Scheduler) which improves the performances of the HCCA Reference Scheduler (RS); in order to convey AFDX (Avionics Full DupleX switched Ethernet) traffics on an IEEE 802.11e WLAN and guarantee their QoS requirements (bandwidth, maximum latency and jitter). AWS is based on the classification of flows (priority class), on a retransmission policy of frames, on the frame deadlines and on the maximum jitter. We also present, in this paper, two strategies for managing the free bandwidth of each TXOP. The first (OAWS, Optimized AWS) uses the free bandwidth of TXOPs for transmitting frames in Critical or Retransmission state. The latest (AWS-RB, AWS with Release Bandwidth) releases the free bandwidth of TXOPs and schedules the following flows.

Nowadays, wireless network security has a considerable attention. However, wireless communication faces several security threats. Consequently, several security efforts have been exerted to combat the wireless attacks, but unfortunately complete attack prevention is not realistically attainable. Thus, the emphasis on detecting intrusions through a second line of defense, in the form of Intrusion Detection System (IDS), is increasing. Selecting an effective and appropriate IDS system should take its functionality and performance evaluation into account. Unbiased and reliable evaluation necessarily depends on a well-engineered evaluation methodology. Dealing with this challenge, this paper proposed a holistic methodology for IDSs evaluation in wireless networks. Our methodology includes all necessary and sufficient tasks for IDSs evaluation. Also, we present holistic taxonomies of wireless IDSs and wireless security attacks from the perspective of the IDS evaluator.

Space Wire is a wormhole network standard scheduled to be used as the sole on-board network for future satellites by the ESA. As the network will be shared by real-time and non real-time traffic, network designers require a tool to check that temporal constraints are verified for all the urgent messages. Previously, we proposed a model for a best-effort worm-hole network based on Network Calculus theory. This model is based on new network element that we call the Wormhole Section. Here, we show how to combine Wormhole Section elements to compute the end-to-end service curve offered to a flow and illustrate its use on a industrial case study.

AFDX (Avionics Full Duplex Switched Ethernet) standardized as ARINC 664 is a major upgrade for avionics systems. But network delay analysis is required to evaluate end-to-end delay's upper bounds. The Network Calculus approach, that has been used to evaluate such end-to-end delay upper bounds for certification purposes, is shortly described. The Trajectory approach is an alternative method that can be applied to an AFDX avionics network. We show on an industrial configuration, in which cases the Trajectory approach outperforms the existing end-to-end delays upper bounds and how the combination of the two methods can lead to an improvement of the existing analysis.

AFDX (Avionics Full Duplex Switched Ethernet) standardized as ARINC 664 is a major upgrade for avionics systems. But guarantees on upper bounds of end-to-end communication delays are required for certification purposes. The objective of this paper is to present an improved modeling approach using timed automata for calculation of exact worst case delays. This approach takes advantage of local scheduling of flows. Moreover, it can cope with larger network configurations than existing approaches based on timed automata, thanks to a port by port analysis which reduces the search space.

AFDX (Avionics Full Duplex Switched Ethernet) standardized as ARINC 664 is a major upgrade for avionics systems. The mandatory certification implies a worst-case delay analysis of all the flows transmitted on the AFDX network. Up to now, this analysis is done thanks to a tool based on the Network Calculus approach. This existing approach considers that all the flows transmitted on the network are asynchronous and it does not take into account the scheduling of output flows done by each end system. The main contribution of this paper is to extend the existing Network Calculus approach by introducing the offsets associated to the different periodic flows into the computation. The resulting approach is evaluated on an industrial AFDX configuration with an existing offset assignment algorithm. The obtained upper bounds are significantly reduced.

Avionics Full Duplex Switched Ethernet (AFDX) standardized as ARINC 664 is a major upgrade for avionics systems. The mandatory certification implies a worst-case delay analysis of all the flows transmitted on the AFDX network. Up to now, this analysis is done thanks to a tool based on a Network Calculus approach. The more recent Trajectory approach has been proposed for the computation of worst-case response time in distributed systems. This paper shows how the worst-case delay analysis of the AFDX can be improved using an optimized Trajectory approach. The Network Calculus and the Trajectory approaches are compared on a real avionics AFDX configuration. Moreover, an evaluation of an upper bound of the pessimism of each approach is proposed.

Current military communication network is a generation old and is no longer effective in meeting the emerging requirements imposed by the next-generation military embedded applications. A new communication network based upon Full Duplex Switched Ethernet is proposed in this paper to overcome these limitations. To allow existing military subsystems to be easily supported by a Switched Ethernet network, our proposal consists in keeping their current centralized communication scheme by using an optimized master/slave transmission control on Switched Ethernet thanks to the Flexible Time Triggered (FTT) paradigm. Our main objective is to assess the performance of such a proposal and estimate the quality-of-service we can expect in terms of latency. Using the Network Calculus formalism, schedulability analysis are determined. These analysis are illustrated in the case of a realistic military embedded application extracted from a real military aircraft network, to highlight the proposal's ability to support the required time constrained communications.

AFDX (avionics full duplex switched Ethernet) standardized as ARINC 664 is a major upgrade for avionics systems. But network delay analysis is required to evaluate end-to-end delay's upper bounds. The network calculus approach, that has been used to evaluate such end-to-end delay upper bounds for certification purposes, is shortly described. In this paper we present how the trajectory approach can be applied to an AFDX avionics network. Moreover we explain how this approach can be optimized in this context. We show that, on an industrial configuration, it outperforms existing end-to-end delays upper bounds.

To effectively manage network resources and to serve different traffic needs, several studies have been done in the Quality of Service (QoS) area. Basically, 'Multi-Field' (MF) packet classifiers classify a packet by looking for multiple fields of the IP-TCP headers, recognise which flow the packet belongs to, and according to this information, provide service differentiation in IP networks. However, for security purposes, existing security protocols (such as the IPSec ESP) hide much of this information in their encrypted payloads, preventing network control devices such as routers and switches from utilising this information in performing classification appropriately. The ESPQ protocol deals with this problem but it has some security weaknesses. In this paper, we present the ESPQ vulnerabilities and we propose QoS-friendly Encapsulated Security Payload (Q-ESP) as a security protocol that provides both security and QoS support.

AFDX (Avionics Full DupleX Switched Ethernet, ARINC 664) developed for the Airbus A380 represents a major upgrade in both bandwidth and capability. Its reliance on Ethernet technology helps to lower some implementation costs, but guaranteed service presents challenges for system designers. An analysis of end-to-end transfer delays through the network is required in order to determine upper bounds. In this paper, we propose to compute probabilistic upper bounds for end-to-end delays on avionic flows. Such upper bounds can be exceeded with a given probability p, and are relevant in the context of avionics, where functions are designed to give accurate results even if they miss some frames. The stochastic network calculus approach analytically determines a probabilistic upper bound, whereas the simulation approach gives an experimental upper bound. The former may be used for new certification needs since it assures that the probability of exceeding the computed upper bound is not greater than p. The latter closely approximates actual network behavior and can help to give some idea of the pessimism of the stochastic network calculus upper bound. The two approaches have been developed in the context of an industrial AFDX network configuration.

In order to effectively manage network resources and to serve different traffic needs, several works have been done in the QoS area. Basically, “Multi-Field (MF) packet classifiers” classify a packet by looking for multiple fields of the IP/TCP headers, recognize which flow the packet belongs to, and according to this information, provide service differentiation in IP networks. However, for security purposes, existing security protocols (such as the IPSec Encapsulating Security Payload (ESP) algorithm) hides much of this information in their encrypted payloads, preventing network control devices such as routers and switches from utilizing this information in performing classification appropriately. The ESPQ (ESP considered QoS) protocol deals with this problem but unfortunately, it has some security weaknesses. In this paper we present the ESPQ vulnerabilities and we propose EESP (Enhanced encapsulated security payload) as a security protocol that provides both security and QoS.

AFDX (avionics full duplex switched Ethernet, AR-INC 664) developed for the Airbus A380 represents a major upgrade in both bandwidth and capability. Its reliance on Ethernet technology helps to lower some implementation costs, but guaranteed service presents challenges for system designers. An analysis of end-to-end transfer delays through the network is required in order to determine upper bounds. The stochastic network calculus approach analytically determines worst-case probabilistic upper bounds in the context of homogeneous avionics flows without priorities. Such upper bounds can be exceeded with a given probability PUB, and are relevant in the context of avionics, where functions are designed to give accurate results even if they miss some frames. Nowadays, there is a need to handle new classes of traffics with different priorities (voice, video, best-effort, ...) on the same AFDX network with no consequences on existing avionic flows. This paper presents the application of the stochastic network calculus approach in the context of a static priority queueing service discipline and evaluates the influence of the service discipline on analytical probabilistic upper bounds.

AFDX (Avionics Full Duplex Switched Ethernet, ARINC 664) used for modern aircraft such as Airbus A380 represents a major upgrade in both bandwidth and capability for aircraft data networks. Its reliance on Ethernet technology helps to lower some of the implementation costs, though the requirement for guaranteed service does present challenges to system designers. Thus, the problem is to prove that no frame will be lost by the network (no switch queue will overflow) and to evaluate the end-to-end transfer delay through the network. Several approaches have been proposed for this evaluation. Network calculus gives a guaranteed upper bound on end-to-end delays, while simulation produces more accurate results on a given set of scenarios. Main problem of simulation is to find a representative subset among the huge number of possible scenarios. In this paper, we propose an original and promising approach to drastically reduce the number of possible scenarios. We illustrate this approach on a realistic industrial network configuration.

Over the last thirty years, the MIL-STD 1553B data bus has been used in many embedded systems, like aircrafts, ships, missiles and satellites. However, the increasing number and complexity of interconnected subsystems lead to emerging needs for more communication bandwidth. Therefore, a new interconnection system is needed to overcome the limitations of the MIL-STD 1553B data bus. Among several high speed networks, full duplex switched Ethernet is put forward here as an attractive candidate to replace the MIL-STD 1553B data bus. However, the key argument against switched Ethernet lies in its non-deterministic behavior that makes it inadequate to deliver hard time-constrained communications. Hence, our primary objective in this paper is to achieve an accepted QoS level offered by switched Ethernet, to support diverse "1553B"-based applications requirements. We evaluate the performance of traffic shaping techniques on full duplex switched Ethernet with an adequate choice of service strategy in the switch, to guarantee the real-time constraints required by these specific 1553B-based applications. An analytic study is conducted, using the network calculus formalism, to evaluate the deterministic guarantees offered by our approach. Theoretical analysis are then investigated in the case of a realistic "1553B"-based application extracted from a real military aircraft network. The results herein show the ability of profiled full duplex switched Ethernet to satisfy 1553B-like real-time constraints

Architectures of avionics networks, such as that of the Airbus A380, currently know important evolutions. This is principally due to the increase in the complexity of the embedded systems, in term of rise in number of integrated functions and their connectivity. The evolution of switched Ethernet technologies allows their implementation as an avionics architecture (AFDX: avionics full duplex switched Ethernet). The problem is then to prove that no frame is lost by the network (no switch queue will overflow) and to evaluate the end-to-end transfer delay through the network. The objective of this paper is to present and shortly compare three methods for the evaluation of end-to-end delays: network calculus, queuing networks simulation and model checking

Full-Duplex Switched Ethernet is a forecasted new technology for advanced military aircraft system interconnection. However, it was not originally developed to meet the requirements of real-time communications. Therefore, in this paper, we analyze traffic shaping and a priority handling approach over switched Ethernet to achieve reliable transmission with bounded delays that conform to the real-time constraints, required by military applications.

Embedded systems have specific real-time requirements that led to the development of dedicated communication protocols. Such systems often face increasing communication needs and the integration of switched Ethernet architecture. But moving from existing dedicated field-buses architectures to new Ethernet based architectures is not always easily feasible, due to industrial constraints. In this paper, we propose a solution for integrating existing data busses (such as CAN, which is an important standard in automotive context) on a global architecture that respects increasing bandwidth requirements. We consider a time triggered CAN application and propose CAN/Ethernet bridging strategies that respect the time-triggered real time behaviour of CAN End System when communicating through a switched Ethernet network that can also be shared by (non CAN) applications

MITv is a proposition for interactive television to be deployed using an association of current distribution television systems (e.g., satellite DVB-S, cable DVB-T, TV over xDSL, etc.) and classical Internet infrastructure. MITv makes use of the natural association between broadcasted TV programs and associated interactive contents to manage replication of those contents over an ad-hoc infrastructure. The replication phase can be based on IP multicast over satellite service, providing a high performance and realistic way to convey the interactive content over the geographically distributed replication units. The proximity between replication units and end-users then allow a very high quality for interactive media presentation by way of an access network such as xDSL. The MITv system was entirely developed and tested in real conditions through a satellite/xDSL network emulator.