Les systèmes de commande en réseau (SCR) sont de plus en plus répandus dans le milieu industriel. Ils procurent en effet de nombreux avantages en termes de coût, de flexibilité, de maintenance, etc. Cependant,l’introduction d’un réseau, qui par nature est composé de ressources partagées, impacte considérablement les performances temporelles des systèmes de commande. Un signal de commande par exemple n’arrive à destination qu’après un certain délai. Pour s’assurer que ce délai soit inférieur à un certain seuil de sécurité ou du respect d’autres contraintes temps réels de ces systèmes, une évaluation au préalable, avant la mise en service d’un SCR, s’avère donc nécessaire. Dans nos travaux de recherche, nous nous intéressons à la réactivité des SCR client/serveur et évaluons leur temps de réponse.Notre contribution dans ces travaux est d’adopter une approche analytique à base de l’algèbre (Max,+) et remédier aux problèmes des méthodes existantes comme l’explosion combinatoire de la vérification formelle ou de la non exhaustivité des approches par simulation. Après modélisation des SCR client/serveur à l’aide de Graphe d’Evénements Temporisés puis représentation de leurs dynamiques à l’aides d’équations (Max,+) linéaires, nous obtenons des formules de calcul direct du temps de réponse. Plus précisément, nous adoptons une analyse déterministe pour calculer les bornes, minimale et maximale, du temps de réponse puis une analyse stochastique pour calculer la fonction de sa distribution. De plus, nous prenons en compte dans nos travaux tous les délais élémentaires qui composent le temps de réponse, y compris les délais de bout-en-bout, dus à la traversée du seul réseau de communication. Ce dernier étant naturellement composé de ressources partagées, rendant l’utilisation des modèles (Max,+) classiques impossibles, nous introduisons une nouvelle approche de modélisation à base du formalisme (Max,+) mais prenant en compte le concept de conflit ou ressource partagée.L’exemple d’un réseau de type Ethernet est considéré pour évaluer ces délais de bout-en-bout. Par ailleurs, cette nouvelle méthode (Max,+) est assez générique et reste applicable à de nombreux systèmes impliquant des ressources partagées, au delà des seuls réseaux de communication. Enfin, pour vérifier la validité des résultats obtenus dans nos travaux, notamment la formule de la borne maximale du temps de réponse, une compagne de mesures expérimentales sont menées sur une plateforme dédiée. Différentes configurations et conditions de trafic dans un réseau Ethernet sont considérées. / Networked automation systems (NAS) are more and more used in industry, given the several advantages they provide like flexibility, low cost, ease of maintenance, etc. However, the use of a communication network in SCR means in essence sharing some resources and therefore strikingly impacts their time performances. For instance, a control signal does get to its destination (actuator) only after a non zero delay. So, to guarantee that such a delay is shorter than a given threshold or other time constraints well respected, an a priori evaluation is necessary before operating the SCR. In our research activities, we are interested in client/server SCR reactivity and the evaluation of their response time.Our contribution in this investigation is the introduction of a (Max,+) Algebra-based analytic approach to solve some problems, faced in the existing methods like state explosion of model checking or the non exhaustivity of simulation. So, after getting Timed Event Graphs based models of the SCR and their linear state (Max,+) representation, we obtain formulae that enables to calculate straightforwardly the SCR response times. More precisely, we obtain formulae of the bounds of response time by adopting a deterministic analysis and other formulae to calculate the probability density of response time by considering a stochastic analysis. Moreover, in our investigation we take into account every single elementary delay involved in the response time, including the end-to-end delays, due exclusively to crossing the communication network. This latter being however constituted of shared resources, making by the way the use of TEG and (Max,+) Algebra impossible, we introduce a novel approach to model the communication network. This approach brings to life a new class of Petri nets, called Conflicting Timed Event Graphs (CTEG), which enables us to solve the problem of the shared resources. We also manage to represent the CTEG dynamics using recurrent (Max,+) equations and therefore calculate the end to-end delays. An Ethernet-based network is studied as an example to apply this novel approach. Note by the way that the field of application of this approach borders largely communication networks and is quite possible when dealing with other systems.Finally, to validate the different results of our research activities and the related hypotheses, especially the maximal bound of response time formula, we carry out lots of experimental measurements on a lab facility. We compare the measures to the formula predictions and check their agreement under different conditions.

Orientador: Luiz Eduardo Buzato / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação / Made available in DSpace on 2018-08-22T08:23:33Z (GMT). No. of bitstreams: 1 Cason_Daniel_M.pdf: 1133475 bytes, checksum: 2c269ea2aec943999c502cd1944b09ae (MD5) Previous issue date: 2013 / Resumo: Protocolos de Difusão Totalmente Ordenada (DTO) constituem o núcleo de diversas soluções que dão suporte ao desenvolvimento de aplicações distribuídas tolerantes a falhas. O longo período no qual este problema vem sendo objeto de pesquisa e a quantidade de algoritmos que foram para ele propostos atestam, não só a sua importância, mas também a dificuldade de se obter soluções eficientes para DTO. Este trabalho apresenta um novo algoritmo de DTO, que explora a sincronia e a confiabilidade inerentes ao ambiente dos aglomerados ou clusters de alto desempenho para construir uma solução bastante simples de Difusão Totalmente Ordenada, cujo desempenho experimental mostrou-se comparável ao obtido por soluções de DTO projetadas para modelos assíncronos de computação. O protocolo proposto destina-se ao modelo assíncrono temporizado de computação, aumentado com um mecanismo simples, baseado na difusão de pulsos, para sincronizá-la a execução dos processos. A hipótese que sustenta este mecanismo de sincronização é que os aglomerados modernos, dado que se controle a carga a eles aplicada, podem executar por períodos razoavelmente longos sem que ocorram falhas de processos e apresentando um comportamento bastante similar ao de sistemas síncronos. Dada esta hipótese, os processos que realizam Difusão Totalmente Ordenada tornam-se capazes de construir visões globais da computação distribuída, e a construção de visões globais, por sua vez, torna trivial a resolução de Difusão Totalmente Ordenada. O protocolo proposto tolera uma quantidade ilimitada de falhas de desempenho, que previnem o progresso da solução de DTO, mas que não levam à violação de suas propriedades de segurança, que são asseguradas na presença de assincronia e de falhas de processos. O protocolo foi implementado em Java e o seu desempenho foi avaliado em um aglomerado com máquinas interconectadas via Ethernet. A comparação dos resultados obtidos com os resultados de desempenho publicados para as principais soluções de DTO existentes nos permite afirmar que nossa solução representa um interessante compromisso entre desempenho experimental e simplicidade de projeto e implementação de soluções de Difusão Totalmente Ordenada. Além dos resultados de desempenho, esta pesquisa também revela que ainda há espaço para a exploração prática da interação entre sincronia e assincronia na engenharia de protocolos distribuídos / Abstract: Total order broadcast algorithms are at the core of several toolkits for the construction of fault-tolerant applications. The importance and the difficulty of finding efficient total order broadcast (TOB) algorithms is attested by the long period that such algorithms have been the object of intense research and by the large number of algorithms already proposed. This work presents a new algorithm for total order broadcast that takes advantage of the inherent reliability and timeliness of high performance clusters in its design. Experimental results show that the performance of this very simple TOB is on a par with the performance of TOBs designed for asynchronous computing models. The proposed protocol has been designed for the timed asynchronous computing model, enhanced with a simple pulse-based mechanism that is used to synchronize the processes' execution. The assumption behind the pulse-based synchronization is that modern clusters, given some workload conditioning, can maintain reasonably long failure-free execution periods in which they behave very much as synchronous system. This assumption allows the processes that engage in total order broadcasts to build a global view of their joint computation and this global view, in its turn, allows them to solve total order broadcast in a straightforward way. The protocol tolerates an unbounded number of timing failures, that can prevent its progress but have no impact on its safety, it is also safe in the in the presence of asynchrony, and processes failures. The protocol has been implemented in Java and tested on an Ethernet-based cluster. A comparison of the results obtained in the experiments with results published for other well-known TOBs allow us to conclude that our solution represents an interesting trade-o_ between performance and simplicity of design and implementation for total order broadcasts protocols. Beyond performance, this research seems to indicate that there is still room for the practical exploration of the interplay between synchronicity and asynchronicity in the engineering of distributed protocols / Mestrado / Ciência da Computação / Mestre em Ciência da Computação

The NetCOPE framework has proven itself as a viable framework for rapid development of hardware accelerated wire-speed network applications using Network Functions Virtualization (NFV). To meet the current and future requirements of such applications the NetCOPE platform has to catch up with upcoming 400 Gigabit Ethernet. Otherwise, it may become deprecated in following years. Catching up with 400 Gigabit Ethernet brings many challenges bringing necessity of completely different way of thinking. Multiple network packets have to be processed each clock cycle requiring a new concept of processing. Advanced memory management is used to ensure constant memory complexity with respect to the number of DMA channels without any impact on performance. Thanks to that, even more than 256 completely independent DMA channels are feasible with current technology. A lot of effort was made to create the framework as generic as possible allowing deployment of 400 Gigabit Ethernet and beyond. Emphasis is put on communication between the framework and host computer via PCI Express technology. Multiple Ethernet ports are also considered. The proposed system is prepared to be deployed on the family of COMBO cards, used as a reference platform.

[pt] O principal objetivo desta dissertação consiste na proposta de implementação de uma rede de telecomunicações utilizando novas tecnologias, enfatizando as aplicações de entretenimento. As soluções adotadas foram orientadas pelas características econômicas verificadas nas áreas nobres das regiões metropolitanas brasileiras e também pelas novas tecnologias de roteamento, chaveamento, armazenamento e distribuição local. A avaliação do custo de investimento e operacional da rede, bem como a formulação de um modelo de negócios associado a uma estrutura de serviços oferecidos foram apresentadas e desenvolvidas. A construção de um plano de negócio hipotético para avaliar a relação custo-benefício resultante da utilização da infra-estrutura da rede proposta associado ao modelo e estrutura dos serviços elaborados foi implementado e executado. Quatro alternativas de implementação de rede foram avaliadas. / [en] The present dissertation is aiming at proposing a telecommunications network implementation using some new technologies where the emphasis is put on entertainment applications. The adopted solutions try to offer a selection grid that qualitatively cope with the economic level of some selected noble metropolitan areas in Brazil and rely in new routing, switching storage and local distribution technologies. The investment evaluation, the operational network costs and the formulation of a business model associated with the respective used service structure is subsequently introduced and described. Next, a hypothetic business plan service model is launched in order to evaluate the cost-benefit ratio between the network infrastructure proposed working together with its new service model and its new structure. Four possible alternatives of network implementation were evaluated and commented.

[pt] O objetivo desta Dissertação é apresentar a análise do comportamento de protocolos e dos métodos de proteção em sistemas ópticos para as futuras redes de altas taxas de transmissão. A demanda por banda de transmissão em redes ópticas vem aumentando sobremaneira nas últimas décadas, principalmente, devido à disseminação do acesso e da utilização da Internet e aos novos tipos de aplicações que ela utiliza, com compartilhamento de vídeos e aplicações em nuvem. Esse aumento de tráfego tem impulsionado fortemente o desenvolvimento de tecnologias de sistemas ópticos que procuram garantir o atendimento a essa demanda. Várias frentes de estudos buscam obter taxas de transmissão de bits mais altas por canais (100Gbps, 400Gbps e 1Tbps), utilizando-se de tecnologias avançadas como o formato de modulação multinível, fibras com baixa perda e área de transmissão efetiva mais larga, amplificação híbrida EDFA/Raman e tecnologias de detecção digital coerente. A taxa máxima de transmissão em sistemas ópticos está saindo do atual 10Gbps e indo na direção dos 40Gbps e 100Gbps, já comercialmente oferecidos, e dos 400Gbps e 1Tbps ainda em desenvolvimento. E esse aumento na taxa de transmissão gera uma necessidade de avaliação do comportamento dos protocolos e métodos de proteção atuais quando aplicados a essas novas redes ultra-rápidas. A mudança para taxas de transmissão tão altas pode requerer diferentes estratégias de operação, e a razão é que os efeitos de retardo de propagação alteram significantemente o controle de fluxo do tráfego. / [en] The aim of this Dissertation is to present an analysis of the behavior of protocols and protection methods in optical communication systems for the ultra high bit rate networks. The demand for optical networking transmission bandwidth is increasing greatly in recent decades, mainly due to the spread of access to and the use of the Internet and new types of services, with video sharing and cloud applications. This increase in traffic has driven strongly the development of optical systems technologies that seek to ensure compliance with this demand. Several fronts of studies seeking to obtain rates from higher bits per channel (100Gbps, 400Gbps and 1Tbps), using advanced technologies such as multilevel modulation format, fibers with low loss and wider effective transmission area, hybrid EDFA/Raman amplification and digital coherent detection technologies. The maximum transmission rate in optical systems is coming out of the current 10Gbps and 40Gbps and going towards the 100Gbps, already commercially offered, and still developing 400Gbps and 1Tbps. This increase in transmission rate generates a need for evaluation of the behavior of current protection protocols and methods when applied to these new ultra-fast networks. The change to so high transmission rates may require different operating strategies, and the reason is that the effects of propagation delay alter significantly the control traffic flow.

In real-time systems spanning a network, there is a need for deterministic communication. The best-effort approach which most of the Internets traffic follows is not suitable for this area since it does not guarantee packet delivery within a deadline and there is also no accurate measure of when the packet was sent. The network core and edge entities such as routers and hosts do not have any concept of time in normal networking, making real-time constraints more difficult to enforce. Time Sensitive Networking is a set of standards, all of which are related to solving the problem above. The most central of these standards is IEEE 802.1AS which defines the generic Precision Time Protocol that specifies how all the nodes of a network should synchronize their clocks to one master clock, giving them a common perception of time. This standard is a prerequisite for some of the other standards in the suite, for example, the 802.1Qbv standard defining a Time Aware Sharper which provides bounded latency for time-critical traffic. A common perception of time is also by itself needed by applications that have to orchestrate actions, with temporal relations to each other, across a network. These applications can be found within areas such as industrial automation and vehicular control systems. The problem that this thesis explores is how the precision of time synchronization of a Time Sensitive Networking (TSN) solution depends on variables in the network such as configuration, topology, and external factors. To find the correlation between the parameters and the precision of the time synchronization, several experiments have been conducted. The experiments were performed on a simple network of hardware components constituting a physical test bed and an oscilloscope was used to probe the clocks if its nodes and extract measurements. Our findings indicate several relationships between the tested parameters and the synchronization precision. The biggest conclusion we can make from our study is that the IEEE 802.1AS standard does not rely on the support of other standards to achieve sub-microsecond results when there is a best-effort traffic load on the network. The manipulated configuration of the standard has given results that in general coincide with the expected behavior. Finally, the data gathered on different topologies, that were tested showed no significant trends regarding the precision. / I realtidssystem som kommunicerar över nätverk finns det ett behov av deterministisk kommunikation. Det vanliga tillvägagångssättet som de mesta av internettrafiken följer är inte lämpligt för detta område eftersom det inte garanterar paketleverans inom en deadline och det inte heller finns något exakt mått av när paketet skickades. Nätverkets enheter som routrar och noder har inte någon uppfattning om tid i normala nätverk, vilket gör realtidsbegränsningar omöjliga att upprätthålla. Time Sensitive Networking är en uppsättning standarder, som alla är relaterade till att lösa problemet ovan. Den mest centrala av dessa standarder är IEEE 802.1AS som definierar generic precision Time Protocol som specificerar hur alla noder i ett nätverk ska synkronisera sina klockor till en masterklicka, vilket ger dem en gemensam tidsuppfattning. Denna standard är en förutsättning för några av de andra standarderna i sviten, till exempel 802.1Qbv-standrarden som definierar en Time Aware Scheduler som ger begränsad latens för tidskritisk trafik. En gemensam tidsuppfattning behövs också av applikationer som måste orkestrera operationer, med tidsmässiga relationer till varandra, över ett nätverk. Dessa applikationer finns inom områden som industriell automation och fordonsstyrningssystem. Problemet som denna avhandling undersöker är hur precisionen av tidssynkronisering av en TSN-lösning beror på variabler i nätverket så som konfiguration, topologi och externa faktorer. För att hitta korrelationen mellan parametrarna och precisionen i tidssynkroniseringen har flera experiment genomförts. Experimenten utfördes på ett enkelt nätverk av hårdvarukomponenter som utgör en fysisk testbädd och ett oscilloskop användes för att undersöka klockorna på dess noder och extrahera mätningarna. Våra resultat indikerar flera samband mellan de testade parametrarna och synkroniseringsprecisionen. Den största slutsatsen vi kan dra från vår studie är att IEEE 802.1AS-standaden inte förlitar sig på stöd från andra standarder för att uppnå resultat under mikrosekunder när det finns en annan trafikbelastning på nätverket. Den manipulerade konfigurationen av standarden har gett resultat som i allmänhet överensstämmer med det förväntade beteendet. Slutligen visade de insamlade data om olika typologier som testades inga signifikanta trender vad gäller precisionen.

Electrohydraulic drives are primarily used whenever a low power/weight ratio, a compact build and/or large forces are required for individual applications. These drives are often used together with electric drive technology in machines. However, in terms of automation, unlike electric drives, electrohydraulic drives are still largely connected via analog interfaces and centralized closed control loops today. To compensate for this competitive disadvantage of hydraulic drive technology and, at the same time, significantly enhance its performance and diagnostics capability, a consistent automation solution has been developed that can be configured for both centralized and decentralized solutions. This contribution firstly gives an overview over this complete solution already available and its classification in the automation world. In a second step, the subset of decentralized drive solutions contained therein is presented in more detail and their benefits are explained on the basis of some exemplary applications.

El presente trabajo analiza los principales y más básicos componentes que actúan en un Sistema de Transporte Inteligente, de tal manera que se diseñe una infraestructura de red capaz de transmitir la información, recogida de las vías, que necesitan los operadores del tránsito, y poder así controlar mejor el transporte urbano. / Tesis

La presente Tesis consiste en brindar una propuesta técnica para la migración del core de la red NGN de una operadora implementada en IP hacia IP/MPLS. Durante el desarrollo de este proyecto se presenta el marco teórico de las redes NGN y se realiza la comparación entre las tecnologías IP y MPLS con el objetivo de observar las ventajas que presenta MPLS al brindar QoS. Luego, se presenta la Propuesta de migración en la cual se presenta el escenario inicial así como los aspectos técnicos, plan de trabajo y el escenario final de la migración. Por último, se detallan las conclusiones obtenidas al final de este proyecto, recomendaciones y trabajos futuros. / Tesis

<p>A channel board was designed for a DRFM circuit. The DRFM is implemented in a Virtex-4 FPGA from Xilinx. In the future a similar channel board is intended to be used for target echo generation in ELSI which is an electronic warfare simulator at Saab Bofors Dynamics in Linköping.</p><p>Besides the DRFM circuit the channel board consists of analog-to-digital converters, digital-to-analog converters, Ethernet plug-in board with a microcontroller, voltage regulators, FPGA configuration memory, voltage amplifiers, current amplifiers, oscillator, buffers/drivers and bus transceivers. The sample rate is 200 MHz and LVDS signalling standard is used between the DRFM circuit and the converters.</p><p>The channel board has a JTAG interface which enables in-system programming of the FPGA. This implies that the DRFM can easily be redesigned. An external computer can manage the channel board via Ethernet. Software was developed for the microcontroller on the channel board and for the external computer. The function of the channel board is heavily dependent on the DRFM circuit.</p><p>The channel board design resulted in the assembly of a prototype circuit board. Measurements were performed in a lab and the channel board was approved to be integrated in ELSI for further tests.</p>