Performance analysis of a new mobility/QoS-aware architecture

Ideally, the future Internet must provide acceptable Quality of Service (QoS) to mobile users that are running real-time applications and are moving across different access points at high speeds. The user mobility presents a great challenge to the network layer in order to maintain users on going connections. Currently, the Internet protocol that manages the user mobility at the network level is the Mobile Internet Protocol (MIP). This protocol, when a mobile user changes its point of attachment, maintains the same IP address for mobile node, so that user mobility became invisible to the application level and thus avoiding a connection interruption. Although, MIP standard allows the user mobility while maintaining an uninterrupted connection to an application, it does not have any concerns with the QoS support provided to applications with more strict performance requirements such as real-time applications. This paper addresses the issue of mobility and QoS management principles as well as the mobility and QoS management integration in the sense of build a QoS-aware architecture for mobile Internet. After covering the mobility and QoS management principles and integration, this paper also proposes a new QoS-aware architecture for mobile Internet. This new architecture takes into account the specific characteristics of mobile networks in order to design an integrated Mobility/QoS-aware management architecture suitable for real-time applications requirements. The simulation results indicate that the suggested architecture is able to provide acceptable QoS levels to real-time applications that are running in mobiles devices.(undefined

A data Grid prototype for distributed data production in CMS

The CMS experiment at CERN is setting up a Grid infrastructure required to fulfill the needs imposed by Terabyte scale productions for the next few years. The goal is to automate the production and at the same time allow the users to interact with the system, if required, to make decisions which would optimize performance. We present the architecture, design and functionality of our first working Objectivity file replication prototype. The middle-ware of choice is the Globus toolkit that provides promising functionality. Our results prove the ability of the Globus toolkit to be used as an underlying technology for a world-wide Data Grid. The required data management functionality includes high speed file transfers, secure access to remote files, selection and synchronization of replicas and managing the meta information. The whole system is expected to be flexible enough to incorporate site specific policies. The data management granularity is the file rather than the object level. The first prototype is currently in use for the High Level Trigger (HLT) production (autumn 2000). Owing to these efforts, CMS is one of the pioneers to use the Data Grid functionality in a running production system. The project can be viewed as an evaluator of different strategies, a test for the capabilities of middle-ware tools and a provider of basic Grid functionalities

BluEJAMM: A Bluespec Embedded Java Architecture with Memory Management

This paper presents BLUEJAMM, a prototype architecture suitable for embedded systems based on a Java native processor BLUEJEP, the processor which is a microprogrammed pipelined stack machine, and its hardware memory management unit were developed in Bluespec SystemVerilog (BSV). A relatively new high-level of abstraction hardware description language, BSV proved to be an excellent choice for rapid prototyping and architecture exploration. The architecture, which has been implemented and tested on a Xilinx FPGA, is currently used to evaluate a number of interesting Java specific techniques, such as runtime bytecode folding and real-time garbage collecti

SUPA: Strewn user-preserved authentication**

Objective – This paper presents the high level conceptual architecture of SUPA, an authentication system that would allow a system to authenticate users without having its own repository of users’ secret identification related data. Methodology/Technique – Central storage and management of user credentials or passwords leave a single tempting repository for the attackers. If the credentials are not stored by a system at all, there will be no stored ‘vault’ to allure the attackers. At the same time, there will be no single resource that holds the credentials of all users of a system. SUPA enables a system to authenticate itself users without having their secret credentials stored in it. Findings – The proposed authentication system uses the features of asymmetric encryption as part of its authentication process. Novelty – SUPA eliminates the requirement of secret user credentials at the system end, the user credentials are retained within the end-user’s devices

High performance computing simulator for the performance assessment of trajectory based operations

High performance computing (HPC), both at hardware and software level, has demonstrated significant improve- ments in processing large datasets in a timely manner. However, HPC in the field of air traffic management (ATM) can be much more than only a time reducing tool. It could also be used to build an ATM simulator in which distributed scenarios where decentralized elements (airspace users) interact through a centralized manager in order to generate a trajectory-optimized conflict-free scenario. In this work, we introduce an early prototype of an ATM simulator, focusing on air traffic flow management at strategic, pre-tactical and tactical levels, which allows the calculation of safety and efficiency indicators for optimized trajectories, both at individual and network level. The software architecture of the simulator, relying on a HPC cluster of computers, has been preliminary tested with a set of flights whose trajectory vertical profiles have been optimized according to two different concepts of operations: conventional cruise operations (i.e. flying at constant altitudes and according to the flight levels scheme rules) and continuous climb cruise operations (i.e., optimizing the trajectories with no vertical constraints). The novel ATM simulator has been tested to show preliminary benchmarking results between these two concepts of operations. The simulator here presented can contribute as a testbed to evaluate the potential benefits of future Trajectory Based Operations and to understand the complex relationships among the different ATM key performance areasPeer ReviewedPostprint (published version

A Hierarchical Architecture for the Coordination of an Ensemble of Steam Generators

This work presents a hierarchical architecture for the optimal management of an ensemble of steam generators, which needs to jointly sustain a common load. The coordination of independent subsystems is provided by a multi-layer control scheme. A high-level optimizer computes the optimal shares of production to be allocated to single generators. At medium level, a robust tube-based model predictive control (MPC) is proposed to track the time-varying demand of the ensemble using a centralized, but aggregated model, whose order does not scale with the number of subsystems. At low level, decentralized controllers are in place to stabilize the internal boiler pressure. The control architecture enables the dynamic modification of the ensemble configuration and plug and play operations. Simulation results are reported to demonstrate the potentialities of the proposed approach

Data Management in the APPA System

International audienceCombining Grid and P2P technologies can be exploited to provide high-level data sharing in large-scale distributed environments. However, this combination must deal with two hard problems: the scale of the network and the dynamic behavior of the nodes. In this paper, we present our solution in APPA (Atlas Peer-to-Peer Architecture), a data management system with high-level services for building large-scale distributed applications. We focus on data availability and data discovery which are two main requirements for implementing large-scale Grids. We have validated APPA's services through a combination of experimentation over Grid5000, which is a very large Grid experimental platform, and simulation using SimJava. The results show very good performance in terms of communication cost and response time

An agent-based DDM for high level architecture

The Data Distribution Management (DDM) service is one of the six services provided in the Runtime Infrastructure (RTI) of High Level Architecture (HLA). Its purpose is to perform data filtering and reduce irrelevant data communicated between federates. The two DDM schemes proposed for RTI, region based and grid based DDM, are oriented to send as little irrelevant data to subscribers as possible, but only manage to filter part of this information and some irrelevant data is still being communicated. Previously (G. Tan et al., 2000), we employed intelligent agents to perform data filtering in HLA, implemented an agent based DDM in RTI (ARTI) and compared it with the other two filtering mechanisms. The paper reports on additional experiments, results and analysis using two scenarios: the AWACS sensing aircraft simulation and the air traffic control simulation scenario. Experimental results show that compared with other mechanisms, the agent based approach communicates only relevant data and minimizes network communication, and is also comparable in terms of time efficiency. Some guidelines on when the agent based scheme can be used are also give

Parallel Sort-Based Matching for Data Distribution Management on Shared-Memory Multiprocessors

In this paper we consider the problem of identifying intersections between two sets of d-dimensional axis-parallel rectangles. This is a common problem that arises in many agent-based simulation studies, and is of central importance in the context of High Level Architecture (HLA), where it is at the core of the Data Distribution Management (DDM) service. Several realizations of the DDM service have been proposed; however, many of them are either inefficient or inherently sequential. These are serious limitations since multicore processors are now ubiquitous, and DDM algorithms -- being CPU-intensive -- could benefit from additional computing power. We propose a parallel version of the Sort-Based Matching algorithm for shared-memory multiprocessors. Sort-Based Matching is one of the most efficient serial algorithms for the DDM problem, but is quite difficult to parallelize due to data dependencies. We describe the algorithm and compute its asymptotic running time; we complete the analysis by assessing its performance and scalability through extensive experiments on two commodity multicore systems based on a dual socket Intel Xeon processor, and a single socket Intel Core i7 processor.Comment: Proceedings of the 21-th ACM/IEEE International Symposium on Distributed Simulation and Real Time Applications (DS-RT 2017). Best Paper Award @DS-RT 201