41,077 research outputs found
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
Dynamic Windows Scheduling with Reallocation
We consider the Windows Scheduling problem. The problem is a restricted
version of Unit-Fractions Bin Packing, and it is also called Inventory
Replenishment in the context of Supply Chain. In brief, the problem is to
schedule the use of communication channels to clients. Each client ci is
characterized by an active cycle and a window wi. During the period of time
that any given client ci is active, there must be at least one transmission
from ci scheduled in any wi consecutive time slots, but at most one
transmission can be carried out in each channel per time slot. The goal is to
minimize the number of channels used. We extend previous online models, where
decisions are permanent, assuming that clients may be reallocated at some cost.
We assume that such cost is a constant amount paid per reallocation. That is,
we aim to minimize also the number of reallocations. We present three online
reallocation algorithms for Windows Scheduling. We evaluate experimentally
these protocols showing that, in practice, all three achieve constant amortized
reallocations with close to optimal channel usage. Our simulations also expose
interesting trade-offs between reallocations and channel usage. We introduce a
new objective function for WS with reallocations, that can be also applied to
models where reallocations are not possible. We analyze this metric for one of
the algorithms which, to the best of our knowledge, is the first online WS
protocol with theoretical guarantees that applies to scenarios where clients
may leave and the analysis is against current load rather than peak load. Using
previous results, we also observe bounds on channel usage for one of the
algorithms.Comment: 6 figure
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
Applying autonomy to distributed satellite systems: Trends, challenges, and future prospects
While monolithic satellite missions still pose significant advantages in terms of accuracy and
operations, novel distributed architectures are promising improved flexibility, responsiveness,
and adaptability to structural and functional changes. Large satellite swarms, opportunistic satellite
networks or heterogeneous constellations hybridizing small-spacecraft nodes with highperformance
satellites are becoming feasible and advantageous alternatives requiring the adoption
of new operation paradigms that enhance their autonomy. While autonomy is a notion that
is gaining acceptance in monolithic satellite missions, it can also be deemed an integral characteristic
in Distributed Satellite Systems (DSS). In this context, this paper focuses on the motivations
for system-level autonomy in DSS and justifies its need as an enabler of system qualities. Autonomy
is also presented as a necessary feature to bring new distributed Earth observation functions
(which require coordination and collaboration mechanisms) and to allow for novel structural
functions (e.g., opportunistic coalitions, exchange of resources, or in-orbit data services). Mission
Planning and Scheduling (MPS) frameworks are then presented as a key component to implement
autonomous operations in satellite missions. An exhaustive knowledge classification explores the
design aspects of MPS for DSS, and conceptually groups them into: components and organizational
paradigms; problem modeling and representation; optimization techniques and metaheuristics;
execution and runtime characteristics and the notions of tasks, resources, and constraints.
This paper concludes by proposing future strands of work devoted to study the trade-offs of
autonomy in large-scale, highly dynamic and heterogeneous networks through frameworks that
consider some of the limitations of small spacecraft technologies.Postprint (author's final draft
On green routing and scheduling problem
The vehicle routing and scheduling problem has been studied with much
interest within the last four decades. In this paper, some of the existing
literature dealing with routing and scheduling problems with environmental
issues is reviewed, and a description is provided of the problems that have
been investigated and how they are treated using combinatorial optimization
tools
- …