Over the past twenty years industrial communications networks have become common place in most industrial plants. The high availability of these networks is crucial in smooth plant operations. Therefore local and remote diagnostics of these networks is of primary importance in solving any existing or emerging network problems. Users for most part consider the “plant networks” as black boxes, and often not sure of the actual health of the networks. The major part of the work outlined in this research concentrates on the proposed “Network Diagnostics Model” for local and remote monitoring. The main objective of the research is to aid the establishment of tools and techniques for diagnosis of the industrial networks, with particular emphasis on PROFIBUS and PROFINET. Additionally this research has resulted in development of a number of devices to aid in network diagnostics. The work outlined in this submission contributes to the developments in the area of online diagnostics systems. The development work was conducted in the following phases: 1. Development of Function Block (FB) for diagnosing PROFIBUS network for implementation on PLC. 2. Development of OPC server for diagnosing PROFIBUS network for implementation on PC. 3. Development of a web based diagnostic software for multiple fieldbuses for implementation on imbedded XP platform. 4. Development of OPC server for diagnosing PROFINET network for implementation on PC 5. Conformance testing of masters (PLC) in PROFIBUS network to increase the health of the network. 6. Use of diagnostics tools for performance analysis of fieldbuses networks for high performance applications. The research work outlined in this submission has made a significant and coherent contribution to online diagnostics of fieldbus communications networks, and has paved the way for the introduction of the online diagnostics devices to the market place. It has shown that the proposed model provides a uniform framework for research and development of diagnostics tools and techniques for fieldbus networks. Organizations that use fieldbus should consider installing advanced online diagnostic systems to boost maintenance efficiency and reduce operating costs, and maintain the availability of plant resources. Based on the experience gained over a number of years a multilayer model is proposed for future development of diagnostics tools.

It is projected that by 2026, most workloads in cloud data centers will be Deep Learning (DL) workloads. However, these workloads pose significant challenges due to their high computational demands, requiring infrastructure and platform advancements to meet DL’s performance, efficiency, and scalability requirements. One emerging problem in large-scale DL is the data stall issue, which occurs when DL models require extensive input data pre-processing, causing CPUs to struggle to keep up with the data consumption demands of GPUs during the training stage. This results in the DL pipeline stalling and GPUs running idle. Our work aims to fundamentally address the data stall issue in modern pre-processing DL pipelines. Traditional solutions involve allocating more CPUs to the pre-processing stage to meet GPU demands, but this approach significantly increases energy con- sumption and provisioning costs. For example, Meta recently disclosed that their DLRM pipeline requires 9 to 55 CPU servers per trainer node, depending on the workload. Our research explores offloading common pre-processing primi- tives to programmable network hardware, specifically Tofino2-equipped switches known for their high bandwidth and energy efficiency, and the Bluefield-2 Smart- NIC. Our initial power measurements demonstrate that Tofino2 and Bluefield-2 achieve 11.6x and 3.0x higher throughput per Watt, respectively, compared to a generic x86 or AMD CPU while performing pre-processing operations. However, due to Tofino2’s limitations in terms of the operations it can perform compared to a CPU, several design optimizations are required to fully exploit the potential of programmable network devices.

LACOME, the Large Collaborative Meeting Environment, is a collaboration system that allows multiple users to simultaneously publish their computer desktops (workspace) and/or windows on a large shared display via a network connection. Once published, windows or even full desktops can be moved, resized, and iconified; optionally, users can even interact with the content of other users. LACOME was originally designed and developed at The University of British Columbia; we extend the system to consider privacy and security concerns. We conducted a series of focus groups to obtain feedback on the initial design of the system. Based on our findings, we developed high level design requirements for future iterations of LACOME; these include the need for addressing privacy and security concerns when moving from the use of LACOME in a co-located setting to the overarching goal of its use in a mixed presence environment. We implemented new features that provide enhanced awareness of users’ shared workspaces and the interactions of others with them. We also developed an access control framework in the system that allows users to assign permissions on an ad-hoc basis. We undertook an initial evaluation of the LACOME system to evaluate the overall system and the changes that we made to it.

Digital transformation will experience massive connections and massive data handling. This will imply a growing demand for computing in communication networks due to network softwarization. Moreover, digital transformation will host very sensitive verticals, requiring high end-to-end reliability and low latency. Accordingly, the emerging concept “in-network computing” has been arising. This means integrating the network communications with computing and also performing computations on the transport path of the network. This can be used to deliver actionable information directly to end users instead of raw data. However, this change of paradigm to in-network computing raises disruptive challenges to the current communication networks. In-network computing (i) expects the network to host general-purpose softwarized network functions and (ii) encourages the packet payload to be modified. Yet, today’s networks are designed to focus on packet forwarding functions, and packet payloads should not be touched in the forwarding path, under the current end-to-end transport mechanisms. This dissertation presents fullstack in-network computing solutions, jointly designed from network and computing perspectives to accelerate data analysis applications, specifically for acoustic data analysis. In the computing domain, two design paradigms of computational logic, namely progressive computing and traffic filtering, are proposed in this dissertation for data reconstruction and feature extraction tasks. Two widely used practical use cases, Blind Source Separation (BSS) and anomaly detection, are selected to demonstrate the design of computing modules for data reconstruction and feature extraction tasks in the in-network computing scheme, respectively. Following these two design paradigms of progressive computing and traffic filtering, this dissertation designs two computing modules: progressive ICA (pICA) and You only hear once (Yoho) for BSS and anomaly detection, respectively. These lightweight computing modules can cooperatively perform computational tasks along the forwarding path. In this way, computational virtual functions can be introduced into the network, addressing the first challenge mentioned above, namely that the network should be able to host general-purpose softwarized network functions. In this dissertation, quantitative simulations have shown that the computing time of pICA and Yoho in in-network computing scenarios is significantly reduced, since pICA and Yoho are performed, simultaneously with the data forwarding. At the same time, pICA guarantees the same computing accuracy, and Yoho’s computing accuracy is improved. Furthermore, this dissertation proposes a stateful transport module in the network domain to support in-network computing under the end-to-end transport architecture. The stateful transport module extends the IP packet header, so that network packets carry message-related metadata (message-based packaging). Additionally, the forwarding layer of the network device is optimized to be able to process the packet payload based on the computational state (state-based transport component). The second challenge posed by in-network computing has been tackled by supporting the modification of packet payloads. The two computational modules mentioned above and the stateful transport module form the designed in-network computing solutions. By merging pICA and Yoho with the stateful transport module, respectively, two emulation systems, i.e., in-network pICA and in-network Yoho, have been implemented in the Communication Networks Emulator (ComNetsEmu). Through quantitative emulations, the experimental results showed that in-network pICA accelerates the overall service time of BSS by up to 32.18%. On the other hand, using in-network Yoho accelerates the overall service time of anomaly detection by a maximum of 30.51%. These are promising results for the design and actual realization of future communication networks.

O desenvolvimento da Internet motivou o surgimento de inúmeras aplicações que utilizam sua infra-estrutura. Dentre elas destacam-se as aplicações P2P para a transmissão de streamings de voz/vídeo. Essas aplicações exigem que determinados requisitos como largura de banda, latência, variação de atraso, escalabilidade, disponibilidade, entre outros, sejam satisfeitos para que possa haver qualidade no serviço provido (QoS Quality of Service). Satisfazer a todos esses requisitos torna-se um grande desafio quando é utilizada a infra-estrutura da Internet para transmissão. Deste modo, impulsionado pelo grande atrativo que existe no paradigma P2P, assim como todos os desafios por trás dessa abordagem, o objetivo principal deste trabalho é a proposta de um protocolo para a construção de overlays para a distribuição de streamings de vídeo em redes P2P. O protocolo proposto visa garantir que o overlay a ser empregado na distribuição de streamings seja construído, levando-se em consideração as características da rede física (nesse trabalho, a Internet) sob o mesmo. A idéia fundamental deste protocolo é organizar os pares de forma dinâmica, agrupando aqueles que estão mais próximos em termos de latência. O segundo objetivo a ser alcançado neste trabalho é a validação do protocolo por meio de experimentos (prova de conceito) realizados com o PlanetLab, de modo a validar os mecanismos propostos. / The Internet development has leveraged several kinds of application that depends on its infrastructure, such as P2P applications to voice/video streaming transmission. These applications have a plenty of requirements, such as bandwidth, latency, jitter, scalability, availability, and so on, that should be fulfilled in order to achieve the required level of Quality of Service (QoS). When it is used the Internet infrastructure to transmission, it is a great challenge fulfill all these requirements. In this manner, the main goal of this work is to propose a protocol to build an overlay to distribute video streaming in P2P networks, taking into account the network characteristics. The fundamental idea of this protocol is dynamically organize the peers, gathering these peers considering the latency between them. Another goal of this work is the protocol assessment by means of experiments (proof of concept) performed in PlanetLab, in order to verify the proposed mechanisms.

Public resource computing (PRC) is an innovative approach to high performance computing that relies on volunteers who donate their personal computers' unused resources to a computationally intensive research project. Prominent PRC projects include SETI@home, Folding@Home, and distributed.net. Many PRC projects are built upon a PRC framework that abstracts functionality that is common to all PRC projects, such as network communications, database access, and project management. These PRC frameworks tend to be complex, limiting, and difficult to use. We have designed and implemented a new PRC framework called the Simple Light-weight Infrastructure for Network Computing (SLINC) that addresses the disadvantages we identified with existing frameworks. SLINC is a flexible and extensible PRC framework that will enable researchers to more easily build PRC projects.

O desenvolvimento da Internet motivou o surgimento de inúmeras aplicações que utilizam sua infra-estrutura. Dentre elas destacam-se as aplicações P2P para a transmissão de streamings de voz/vídeo. Essas aplicações exigem que determinados requisitos como largura de banda, latência, variação de atraso, escalabilidade, disponibilidade, entre outros, sejam satisfeitos para que possa haver qualidade no serviço provido (QoS Quality of Service). Satisfazer a todos esses requisitos torna-se um grande desafio quando é utilizada a infra-estrutura da Internet para transmissão. Deste modo, impulsionado pelo grande atrativo que existe no paradigma P2P, assim como todos os desafios por trás dessa abordagem, o objetivo principal deste trabalho é a proposta de um protocolo para a construção de overlays para a distribuição de streamings de vídeo em redes P2P. O protocolo proposto visa garantir que o overlay a ser empregado na distribuição de streamings seja construído, levando-se em consideração as características da rede física (nesse trabalho, a Internet) sob o mesmo. A idéia fundamental deste protocolo é organizar os pares de forma dinâmica, agrupando aqueles que estão mais próximos em termos de latência. O segundo objetivo a ser alcançado neste trabalho é a validação do protocolo por meio de experimentos (prova de conceito) realizados com o PlanetLab, de modo a validar os mecanismos propostos. / The Internet development has leveraged several kinds of application that depends on its infrastructure, such as P2P applications to voice/video streaming transmission. These applications have a plenty of requirements, such as bandwidth, latency, jitter, scalability, availability, and so on, that should be fulfilled in order to achieve the required level of Quality of Service (QoS). When it is used the Internet infrastructure to transmission, it is a great challenge fulfill all these requirements. In this manner, the main goal of this work is to propose a protocol to build an overlay to distribute video streaming in P2P networks, taking into account the network characteristics. The fundamental idea of this protocol is dynamically organize the peers, gathering these peers considering the latency between them. Another goal of this work is the protocol assessment by means of experiments (proof of concept) performed in PlanetLab, in order to verify the proposed mechanisms.

abstract: With the increasing user demand for low latency, elastic provisioning of computing resources coupled with ubiquitous and on-demand access to real-time data, cloud computing has emerged as a popular computing paradigm to meet growing user demands. However, with the introduction and rising use of wear- able technology and evolving uses of smart-phones, the concept of Internet of Things (IoT) has become a prevailing notion in the currently growing technology industry. Cisco Inc. has projected a data creation of approximately 403 Zetabytes (ZB) by 2018. The combination of bringing benign devices and connecting them to the web has resulted in exploding service and data aggregation requirements, thus requiring a new and innovative computing platform. This platform should have the capability to provide robust real-time data analytics and resource provisioning to clients, such as IoT users, on-demand. Such a computation model would need to function at the edge-of-the-network, forming a bridge between the large cloud data centers and the distributed connected devices. This research expands on the notion of bringing computational power to the edge- of-the-network, and then integrating it with the cloud computing paradigm whilst providing services to diverse IoT-based applications. This expansion is achieved through the establishment of a new computing model that serves as a platform for IoT-based devices to communicate with services in real-time. We name this paradigm as Gateway-Oriented Reconfigurable Ecosystem (GORE) computing. Finally, this thesis proposes and discusses the development of a policy management framework for accommodating our proposed computational paradigm. The policy framework is designed to serve both the hosted applications and the GORE paradigm by enabling them to function more efficiently. The goal of the framework is to ensure uninterrupted communication and service delivery between users and their applications. / Dissertation/Thesis / Masters Thesis Computer Science 2015

No description available.

Orientador: Lee Luan Ling / Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação / Made available in DSpace on 2018-08-26T04:07:32Z (GMT). No. of bitstreams: 1 Stenico_JefersonWiliandeGodoy_D.pdf: 40438128 bytes, checksum: 1647243082abcfd8d16256d5f6027e53 (MD5) Previous issue date: 2014 / Resumo: Esta tese apresenta uma nova abordagem de construção de cascata multiplicativa, fundamentada na expressão do Binômio de Newton. Com base nessa nova cascata, é elaborado, um modelo de tráfego multifractal, denominado Modelo Multifractal baseado no Binômio de Newton - (MMBN). Esse modelo é capaz capturar com eficiência algumas das principais características multifractais observadas nas séries reais de tráfego estudadas via sua função escala e fator de momento. Expressões analíticas para a média e a variância do correspondente processo, foram derivadas, com a finalidade de obter uma modelagem mais precisa e robusta dos fluxos de tráfego de rede. Além disso, através da respectiva função autocorreção, foi demonstrado as características de dependência de longa duração (LDR). A avaliação de desempenho do novo modelo proposto foi avaliado utilizando as séries de tráfego reais provenientes de redes fixas e móveis wireless. Os resultados do desempenho foram comparados com outras abordagens multifractais bem conhecidas na literatura. Através dessa da análise, foi possível mostrar que o modelo de tráfego proposto é simples e capaz de representar com precisão as séries de tráfego com características multifractais. Baseado nessa nova abordagem de modelagem de tráfego, um parâmetro de escala global foi determinado e usado em conjunto com os parâmetros do modelo multifractal proposto, o que tornou possível a derivação de uma equação para a estimação de banda efetiva. O principal objetivo dessa expressão está em oferecer melhor alocação de recursos no planejamento e projetos de redes, especialmente para tráfegos com características multifractais. Outra novidade desta tese está na obtenção de uma expressão analítica geral para a estimação de probabilidade de perda para séries de tráfego com características multifractais, em um enlace com um único servidor e buffer finito. Para isso, foi utilizado o método de misturas de gaussianas para expressar a distribuição de cauda pesada do tráfego multifractal. A eficiência da modelagem estatística e a precisão da estimativa de probabilidade de perda foram validadas experimentalmente, assim como os resultados foram comparados com outros métodos multifractais, amplamente utilizados e conhecidos na literatura / Abstract: This thesis presents a novel construction scheme of multiplicative cascade, based on Newton Binomial expression. Based on this new cascade is established, also in an innovative way, a multifractal traffic model, called Multifractal Model based on Newton Binomial (MMNB). This model is able to faithfully capture some main characteristics of the multifractal processes, scaling function and moment factor. In order to get a more accurate and robust modeling of the networks traffic flows, we also derive analytical expressions for the mean and variance of the corresponding network traffic process and show that its autocorrelation function exhibits long-range dependent characteristics (LRD). The performance evaluation of our model has been evaluated using real traffic traces from fixed and mobile networks. The results were compared with those provided by other well-known traffic models reported in the literature. We show that the proposed model is simple and capable of accurately representing network traffic traces with multifractal characteristics. Based on a new approach for traffic modeling and the corresponding multifractal traffic parameters, a global scaling parameter is determined and used together with the multifractal traffic model parameters for the effective bandwidth computation in order to offer better resource allocation in network planning and design, especially for network traffic with multifractal characteristics. Another novel contribution of this thesis is the derivation of a general analytical expression for the loss probability for traffic traces with multifractal characteristics in queuing systems with a simple server and finite buffer. For this, we used Gaussian mixture model to express the heavy tail distribution, one of the most important properties of multifractal traffic. The efficiency of this statistical model and the accuracy of the estimated loss probabilities are experimentally validated by a comparison with other multifractal approaches widely used and well-known in the literature / Doutorado / Telecomunicações e Telemática / Doutor em Engenharia Elétrica