Towards an HLA Run-time Infrastructure with Hard Real-time Capabilities

Our work takes place in the context of the HLA standard and its application in real-time systems context. The HLA standard is inadequate for taking into consideration the different constraints involved in real-time computer systems. Many works have been invested in order to providing real-time capabilities to Run Time Infrastructures (RTI) to run real time simulation. Most of these initiatives focus on major issues including QoS guarantee, Worst Case Transit Time (WCTT) knowledge and scheduling services provided by the underlying operating systems. Even if our ultimate objective is to achieve real-time capabilities for distributed HLA federations executions, this paper describes a preliminary work focusing on achieving hard real-time properties for HLA federations running on a single computer under Linux operating systems. Our paper proposes a novel global bottom up approach for designing real-time Run time Infrastructures and a formal model for validation of uni processor to (then) distributed real-time simulation with CERTI

Performance analysis of a Master/Slave switched Ethernet for military embedded applications

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

Centralized vs distributed communication scheme on switched ethernet for embedded military applications

Current military communication network is a generation old and is no longer effective in meeting the emerging requirements imposed by the future embedded military applications. Therefore, a new interconnection system is needed to overcome these limitations. Two new communication networks based upon Full Duplex Switched Ethernet are presented herein in this aim. The first one uses a distributed communication scheme where equipments can emit their data simultaneously, which clearly improves system’s throughput and flexibility. However, migrating all existing applications into a compliant form could be an expensive step. To avoid this process, the second proposal consists in keeping the current centralized communication scheme. Our objective is to assess and compare the real time guarantees that each proposal can offer. The paper includes the functional description of each proposed communication network and a military avionic application to highlight proposals ability to support the required time constrained communications

Radar-Aware Transmission and Scheduling for Cognitive Radio Dynamic Spectrum Access in the CBRS Radio Band

Use of the wireless spectrum is increasing. In order to meet the throughput requirements, Dynamic Spectrum Access is a popular technique to maximize spectrum usage. This can be applied to the Citizen Broadband Radio Service (3550-3700MHz), a band recently opened by the Federal Communications Commission for opportunistic access. This radio band can be accessed as long as no higher priority users are interfered with. The top priority users are called incumbents, which are commonly naval radar. Naval radars transmit a focused beam that can be modelled as a periodic function. Lower tier users are prohibited from transmitting when their transmissions coincide and interfere with the radar beam. The second and third tier users are called Priority Access Licensees and General Authorized Access, respectively. Lower tier users must account for the transmission outage due to the presence of the radar in their scheduling algorithms. In addition, the scheduling algorithms should take Quality of Service constraints, more specifically delay constraints into account. The contribution of this thesis is the design of a scheduling algorithm for CBRS opportunistic access in the presence of radar that provides Quality of Service for users, consider different traffic needs. This was implemented using the ns-3 discrete-event network simulator to simulate an environment with a radar and randomly placed radios using LTE-U to opportunistically transmit data. The proposed algorithm was compared against the Proportional Fair algorithm and a Proportional Fair algorithm with delay awareness. Performance was measured with and without fading models present. The proposed algorithm better balanced Quality of Service requirements and minimized the effect of transmission outage due to presence of the radar

Optimal scheduling and fair servicepolicy for STDMA in underwater networks with acoustic communications

In this work, a multi-hop string network with a single sink node is analyzed. A periodic optimal scheduling for TDMA operation that considers the characteristic long propagation delay of the underwater acoustic channel is presented. This planning of transmissions is obtained with the help of a new geometrical method based on a 2D lattice in the space-time domain. In order to evaluate the performance of this optimal scheduling, two service policies have been compared: FIFO and Round-Robin. Simulation results, including achievable throughput, packet delay, and queue length, are shown. The network fairness has also been quantified with the Gini index

Real-time characteristics of switched ethernet for "1553B" -embedded applications : simulation and analysis

In our previous work , Full Duplex Switched Ethernet was put forward as an attractive candidate to replace the MIL-STD 1553B data bus, in next generation "1553B"-embedded applications. An analytic study was conducted, using the Network Calculus formalism, to evaluate the deterministic guarantees offered by our proposal. Obtained results showed the effectiveness of traffic shaping techniques, combined with priority handling mechanisms on Full Duplex Switched Ethernet in order to satisfy 1553B-like real-time constraints. In this paper, we extend this work by the use of simulation. This gives the possibility to capture additional characteristics of the proposed architecture with respect to the analytical study, which was basically used to evaluate worst cases and deterministic guarantees. Hence, to assess the real-time characteristics of our proposed interconnection technology, the results yielded by simulation are discussed and average latencies distributions are considered

MorphoSys: efficient colocation of QoS-constrained workloads in the cloud

In hosting environments such as IaaS clouds, desirable application performance is usually guaranteed through the use of Service Level Agreements (SLAs), which specify minimal fractions of resource capacities that must be allocated for unencumbered use for proper operation. Arbitrary colocation of applications with different SLAs on a single host may result in inefficient utilization of the host’s resources. In this paper, we propose that periodic resource allocation and consumption models -- often used to characterize real-time workloads -- be used for a more granular expression of SLAs. Our proposed SLA model has the salient feature that it exposes flexibilities that enable the infrastructure provider to safely transform SLAs from one form to another for the purpose of achieving more efficient colocation. Towards that goal, we present MORPHOSYS: a framework for a service that allows the manipulation of SLAs to enable efficient colocation of arbitrary workloads in a dynamic setting. We present results from extensive trace-driven simulations of colocated Video-on-Demand servers in a cloud setting. These results show that potentially-significant reduction in wasted resources (by as much as 60%) are possible using MORPHOSYS.National Science Foundation (0720604, 0735974, 0820138, 0952145, 1012798