282 research outputs found
Verifying Weakly-Hard Real-Time Properties of Traffic Streams in Switched Networks
In this paper, we introduce the first verification method which is able to provide weakly-hard real-time guarantees for tasks and task chains in systems with multiple resources under partitioned scheduling with fixed priorities. Existing weakly-hard real-time verification techniques are restricted today to systems with a single resource. A weakly-hard real-time guarantee specifies an upper bound on the maximum number m of deadline misses of a task in a sequence of k consecutive executions. Such a guarantee is useful if a task can experience a bounded number of deadline misses without impacting the system mission. We present our verification method in the context of switched networks with traffic streams between nodes, and demonstrate its practical applicability in an automotive case study
Design Optimization of Cyber-Physical Distributed Systems using IEEE Time-sensitive Networks (TSN)
In this paper we are interested in safety-critical real-time applications implemented on distributed architectures supporting the Time-SensitiveNetworking (TSN) standard. The ongoing standardization of TSN is an IEEE effort to bring deterministic real-time capabilities into the IEEE 802.1 Ethernet standard supporting safety-critical systems and guaranteed Quality-of-Service. TSN will support Time-Triggered (TT) communication based on schedule tables, Audio-Video-Bridging (AVB) flows with bounded end-to-end latency as well as Best-Effort messages. We first present a survey of research related to the optimization of distributed cyber-physical systems using real-time Ethernet for communication. Then, we formulate two novel optimization problems related to the scheduling and routing of TT and AVB traffic in TSN. Thus, we consider that we know the topology of the network as well as the set of TT and AVB flows. We are interested to determine the routing of both TT and AVB flows as well as the scheduling of the TT flows such that all frames are schedulable and the AVB worst-case end-to-end delay is minimized. We have proposed an Integer Linear Programming (ILP) formulation for the scheduling problem and a Greedy Randomized Adaptive Search Procedure (GRASP)-based heuristic for the routing problem. The proposed approaches have been evaluated using several test cases
On Cyclic Dependencies and Regulators in Time-Sensitive Networks
For time-sensitive networks, as in the context of
IEEE TSN and IETF Detnet, cyclic dependencies are associated
with certain fundamental properties such as improving availability
and decreasing reconfiguration effort. Nevertheless, the
existence of cyclic dependencies can cause very large latency
bounds or even global instability, thus making the proof of the
timing predictability of such networks a much more challenging
issue. Cyclic dependencies can be removed by reshaping
flows inside the network, by means of regulators. We consider
FIFO-per-class networks with two types of regulators: perflow
regulators and interleaved regulators (the latter reshape
entire flow aggregates). Such regulators come with a hardware
cost that is less for an interleaved regulator than for a perflow
regulator; both can affect the latency bounds in different
ways. We analyze the benefits of both types of regulators in
partial and full deployments in terms of latency. First, we
propose Low-Cost Acyclic Network (LCAN), a new algorithm
for finding the optimum number of regulators for breaking all
cyclic dependencies. Then, we provide another algorithm, Fixed-
Point Total Flow Analysis (FP-TFA), for computing end-to-end
delay bounds for general topologies, i.e., with and without cyclic
dependencies. An extensive analysis of these proposed algorithms
was conducted on generic grid topologies. For these test networks,
we find that FP-TFA computes small latency bounds; but, at
a medium to high utilization, the benefit of regulators becomes
apparent. At high utilization or for high line transmission-rates, a
small number of per-flow regulators has an effect on the latency
bound larger than a small number of interleaved regulators.
Moreover, interleaved regulators need to be placed everywhere
in the network to provide noticeable improvements. We validate
the applicability of our approaches on a realistic industrial timesensitive
network
Modelação e simulação de equipamentos de rede para Indústria 4.0
Currently, the industrial sector has increasingly opted for digital technologies
in order to automate all its processes. This development comes from
notions like Industry 4.0 that redefines the way these systems are designed.
Structurally, all the components of these systems are connected in a complex
network known as the Industrial Internet of Things. Certain requirements
arise from this concept regarding industrial communication networks. Among
them, the need to ensure real-time communications, as well as support for
dynamic resource management, are extremely relevant. Several research
lines pursued to develop network technologies capable of meeting such
requirements. One of these protocols is the Hard Real-Time Ethernet Switch
(HaRTES), an Ethernet switch with support for real-time communications and
dynamic resource management, requirements imposed by Industry 4.0.
The process of designing and implementing industrial networks can,
however, be quite time consuming and costly. These aspects impose
limitations on testing large networks, whose level of complexity is higher and
requires the usage of more hardware. The utilization of network simulators
stems from the necessity to overcome such restrictions and provide tools to
facilitate the development of new protocols and evaluation of communications
networks.
In the scope of this dissertation a HaRTES switch model was developed
in the OMNeT++ simulation environment. In order to demonstrate a
solution that can be employed in industrial real-time networks, this dissertation
presents the fundamental aspects of the implemented model as well as a set
of experiments that compare it with an existing laboratory prototype, with the
objective of validating its implementation.Atualmente o setor industrial tem vindo cada vez mais a optar por tecnologias
digitais de forma a automatizar todos os seus processos. Este desenvolvimento
surge de noções como Indústria 4.0, que redefine o modo de como
estes sistemas são projetados. Estruturalmente, todos os componentes
destes sistemas encontram-se conectados numa rede complexa conhecida
como Internet Industrial das Coisas. Certos requisitos advêm deste conceito,
no que toca às redes de comunicação industriais, entre os quais se destacam
a necessidade de garantir comunicações tempo-real bem como suporte a
uma gestão dinâmica dos recursos, os quais são de extrema importância.
Várias linhas de investigação procuraram desenvolver tecnologias de rede
capazes de satisfazer tais exigências. Uma destas soluções é o "Hard
Real-Time Ethernet Switch" (HaRTES), um switch Ethernet com suporte a
comunicações de tempo-real e gestão dinâmica de Qualidade-de-Serviço
(QoS), requisitos impostos pela Indústria 4.0.
O processo de projeto e implementação de redes industriais pode, no
entanto, ser bastante moroso e dispendioso. Tais aspetos impõem limitações
no teste de redes de largas dimensões, cujo nível de complexidade é
mais elevado e requer o uso de mais hardware. Os simuladores de redes
permitem atenuar o impacto de tais limitações, disponibilizando ferramentas
que facilitam o desenvolvimento de novos protocolos e a avaliação de redes
de comunicações.
No âmbito desta dissertação desenvolveu-se um modelo do switch HaRTES
no ambiente de simulação OMNeT++. Com um objetivo de demonstrar uma
solução que possa ser utilizada em redes de tempo-real industriais, esta
dissertação apresenta os aspetos fundamentais do modelo implementado
bem como um conjunto de experiências que o comparam com um protótipo
laboratorial já existente, no âmbito da sua validação.Mestrado em Engenharia Eletrónica e Telecomunicaçõe
Distributed Linear Algebra on Networks of Workstations
This thesis describes the development of a portion of a distributed linear algebra library for use on networks of workstations. The library was designed with special consideration towards three characterists of networks of workstations: small numbers of processes, availability of multithreading, and high communication latency. Two aspects of the library are highlighted. First, modifications to message passing primitives to permit their use in a multithreaded environment. Second, modifications to basic linear algebra algorithms to improve their performance on networks of stations. A model of distributed linear algebra on networks of workstations is developed, and used to predict the performance of the modified algorithms. These predictions are compared to experimental results on several networks of workstations
- …