From statistical- to machine learning-based network traffic prediction

Nowadays, due to the exponential and continuous expansion of new paradigms such as Internet of Things (IoT), Internet of Vehicles (IoV) and 6G, the world is witnessing a tremendous and sharp increase of network traffic. In such large-scale, heterogeneous, and complex networks, the volume of transferred data, as big data, is considered a challenge causing different networking inefficiencies. To overcome these challenges, various techniques are introduced to monitor the performance of networks, called Network Traffic Monitoring and Analysis (NTMA). Network Traffic Prediction (NTP) is a significant subfield of NTMA which is mainly focused on predicting the future of network load and its behavior. NTP techniques can generally be realized in two ways, that is, statistical- and Machine Learning (ML)-based. In this paper, we provide a study on existing NTP techniques through reviewing, investigating, and classifying the recent relevant works conducted in this field. Additionally, we discuss the challenges and future directions of NTP showing that how ML and statistical techniques can be used to solve challenges of NTP.publishedVersio

Semi-online Scheduling with Lookahead

The knowledge of future partial information in the form of a lookahead to design efficient online algorithms is a theoretically-efficient and realistic approach to solving computational problems. Design and analysis of semi-online algorithms with extra-piece-of-information (EPI) as a new input parameter has gained the attention of the theoretical computer science community in the last couple of decades. Though competitive analysis is a pessimistic worst-case performance measure to analyze online algorithms, it has immense theoretical value in developing the foundation and advancing the state-of-the-art contributions in online and semi-online scheduling. In this paper, we study and explore the impact of lookahead as an EPI in the context of online scheduling in identical machine frameworks. We introduce a $k$-lookahead model and design improved competitive semi-online algorithms. For a $2$-identical machine setting, we prove a lower bound of $\frac{4}{3}$ and design an optimal algorithm with a matching upper bound of $\frac{4}{3}$ on the competitive ratio. For a $3$-identical machine setting, we show a lower bound of $\frac{15}{11}$ and design a $\frac{16}{11}$-competitive improved semi-online algorithm.Comment: 14 pages, 1 figur

Network Managers as Hidden Gatekeepers in Online Education : A case study in Streaming Video

Teaching, learning and research for educators and students in the 21st century has changed. This change is attributed to various reasons but foremost amongst them is the internet and a valid learning technology within it called streaming video. Research into multimedia as a learning tool shows it has the ability to boost cognitive response and improve overall learning in students. Streaming video is well-known and utilized for everything from entertainment to education. What is not as well-known is the influence that network managers have on the online education experience through their control of available bandwidth and related technology functions. The case study presented uses the network gatekeeping salience theory by Barzilai Nahon to expose the network manager as a gatekeeper in the network environment. The case at one university is complemented by showcasing additional studies. Together these studies contribute to a foundational understanding of the power of these gatekeepers and the impact of their actions on online video and student learning experiences. This understanding provides libraries, schools and universities additional tools in their efforts to improve learning experiences

Topics in access, storage, and sensor networks

In the first part of this dissertation, Data Over Cable Service Interface Specification (DOCSIS) and IEEE 802.3ah Ethernet Passive Optical Network (ETON), two access networking standards, are studied. We study the impact of two parameters of the DOCSIS protocol and derive the probability of message collision in the 802.3ah device discovery scheme. We survey existing bandwidth allocation schemes for EPONs, derive the average grant size in one such scheme, and study the performance of the shortest-job-first heuristic. In the second part of this dissertation, we study networks of mobile sensors. We make progress towards an architecture for disconnected collections of mobile sensors. We propose a new design abstraction called tours which facilitates the combination of mobility and communication into a single design primitive and enables the system of sensors to reorganize into desirable topologies alter failures. We also initiate a study of computation in mobile sensor networks. We study the relationship between two distributed computational models of mobile sensor networks: population protocols and self-similar functions. We define the notion of a self-similar predicate and show when it is computable by a population protocol. Transition graphs of population protocols lead its to the consideration of graph powers. We consider the direct product of graphs and its new variant which we call the lexicographic direct product (or the clique product). We show that invariants concerning transposable walks in direct graph powers and transposable independent sets in graph families generated by the lexicographic direct product are uncomputable. The last part of this dissertation makes contributions to the area of storage systems. We propose a sequential access detect ion and prefetching scheme and a dynamic cache sizing scheme for large storage systems. We evaluate the cache sizing scheme theoretically and through simulations. We compute the expected hit ratio of our and competing schemes and bound the expected size of our dynamic cache sufficient to obtain an optimal hit ratio. We also develop a stand-alone simulator for studying our proposed scheme and integrate it with an empirically validated disk simulator

Using the ethernet protocol for real-time communications in embedded systems

Doutoramento em Engenharia ElectrotécnicaOs Sistemas Computacionais de Controlo Distribuído (SCCD) estão muito disseminados em aplicações que vão desde o controlo de processos e manufactura a automóveis, aviões e robôs. Muitas aplicações são de natureza tempo-real, ou seja, impõem fortes restrições às propriedades subjacentes aos sistemas de controlo, gerando a necessidade de fornecer um comportamento temporal previsível durante períodos alargados de tempo. Em particular, dependendo da aplicação, uma falha em garantir as restrições pode causar importantes perdas económicas ou mesmo pôr vidas humanas em risco. Actualmente, a quantidade e funcionalidade dos modernos SCCD têm crescido firmemente. Esta evolução é motivada por uma nova classe de aplicações que requer maior demanda de recursos tais como aplicações de multimedia (por exemplo visão), bem como pela tendência em usar grande número de processadres simples e interconectados, em vez de poucos e poderosos processadores, encapsulando cada funcionalidade num único processador. Consequentemente, a quantidade de informação que deve ser trocada entre os nós da rede também cresceu drasticamente nos últimos anos e está agora atingindo os limites que podem ser obtidos por tradicionais barramentos de campo, como por exempo CAN, WorldFIP, PROFIBUS. Outras alternativas são pois requeridas para suportar a necessidade de largura de banda e a manutenção de exigências dos sistemas de comunicação tempo-real: previsibilidade, pontualidade, atraso e variação de período limitados. Uma das linhas de trabalho tem apostado na Ethernet, tirando vantagem dos baixos custos dos circuitos, da elevada largura de banda, da fácil integração com a Internet, e da simplicidade em promover expansões e compatibilidade com redes usadas na estrutura administrativa das empresas industriais. Porém, o mecanismo padronizado de acesso ao meio da Ethernet (CSMA/CD) é destrutivo e não determinístico, o que impede seu uso directo ao nível de campo ou pelo menos em aplicações de comunicação tempo-real. Apesar disso, muitas abordagens diferentes têm sido propostas e usadas para obter comportamento tempo-real em Ethernet. As abordagens actuais para dotar de comportamento tempo-real Ethernet partilhada apresentam desvantagens tais como: exigência de hardware especializado, fornecimento de garantias temporais estatísticas, ineficiência na utilização da largura de banda ou na reposta tempo-real. São ainda por vezes inflexíveis com respeito às propriedades de tráfego bem como com as políticas de escalonamento. Podem exigir processadores com elevado poder de cálculo. Finalmente não permitem que estações tempo-real possam coexistir com estações Ethernet standard no mesmo segmento. Uma proposta recente, o algoritmo hBEB, permite a coexistência de estações tempo-real e standard no mesmo segmento. Contudo, apenas uma estação tempo-real pode estar activa, o que é inaceitável para aplicações de automação e controlo. Esta tese discute uma nova solução para promover tempo-real em Ethernet partilhada, baseando-se na passagem implícita de testemunho de forma similar à usada pelo protocolo P-NET. Esta técnica é um mecanismo de acesso ao meio físico pouco exigente em termos de processamento, sendo portanto adequada para implementar uma rede de dispositivos baseados em processadores de baixo poder de cálculo e controladores Ethernet standard. Esta tese apresenta ainda uma proposta de implementação do VTPE em IP core para superar algumas dificuldades derivadas de funcionalidades que não são suportadas por controladores standard, nomeadamente a arbitragem do meio físico durante a transmissão de uma trama. Esta nova proposta pode aumentar muito a eficiência do VTPE no uso da largura de banda. O VTPE, assim como P-NET ou protocolos similares, permite a uma estação apenas comunicar uma vez por cada circulação do testemunho. Esta imposição pode causar bloqueios de comunicação por períodos inaceitáveis em aplicações com tráfego isócrono, por exemplo multimedia. Uma solução proposta permite que uma estação possa aceder ao meio físico mais de uma vez por cada circulação do token. Os resultados experimentais a as análises desenvolvidas mostram que o bloqueio pode ser drasticamente reduzido. Por último esta tese discute uma variante do protocolo VTPE, o VTPE/h- BEB, que permite que mais de uma estação hBEB possa coexistir com diversas estações Ethernet standard num mesmo segmento partilhado. Um demonstrador para prova de conceito bem como uma aplicação foram também implementados.Distributed Computer-Control Systems (DCCS) are widely disseminated in applications ranging from automation and control to automotive, avionics and robotics. Many of these applications are real-time, posing stringent constraints to the properties of underlying control systems, which arise from the need to provide predictable behaviour during extended time periods. Depending on the particular type of application, a failure to meet these constraints can cause important economic losses or can even put human life in risk. Currently the number and functionality of modern DCCSs have been increasing steadily. This evolution has been motivated for a new class of applications of more resource demanding applications, such as multimedia (e.g. machine vision), as well as by the trend to use large numbers of simple interconnected processors, instead of a few powerful ones, encapsulating each functionality in one single processor. Consequently, the amount of information that must be exchanged among the network nodes has also increased dramatically and is now reaching the limits achievable by traditional fieldbuses. Therefore, other alternatives are required to support higher bandwidth demands while keeping the main requirements of a real-time communication system: predictability, timeliness, bounded delays and jitter. Efforts have been made with Ethernet to take advantage of the low cost of the silicon, high bandwidth, easy integration with the Internet, easy expansion and compatibility with the networks used at higher layers in the factory structure. However its standardized media access control (CSMA/CD) is destructive and not deterministic, impairing its direct use at field level at least for real-time communication. Despite this, many solutions have been proposed to achieve real-time behavior in Ethernet. However they present several disadvantages: requiring specialized hardware, providing statistical timeliness guarantees only, being bandwidth or response-time inefficient, being inflexible concerning traffic properties and/or scheduling policy, or finally not allowing real-time stations to coexist with standard Ethernet stations in the same segment. A recent proposal, the hBEB algorithm, allows the coexistence of real-time and standard Ethernet stations in the same shared segment. However hBEB limits at most one real-time station per segment which is unacceptable for applications in industrial automation and process control. This thesis discusses a new real-time shared Ethernet solution based on the virtual token passing technique similarly to the one used by the P-NET protocol. This technique is a medium access control mechanism that requires small processing power, being suitable to implement devices based on processors with small processing power. The solution is called Virtual Token Passing Ethernet or VTPE. This proposal discusses the modifications required in the Ethernet frame format, the temporal analysis to guarantee real-time communication and the implementation of two demonstrators based on microcontrollers and standard Ethernet controllers. This thesis also presents a proposal to implement VTPE in an IP Core to overcome some difficulties derived from limitations of standard Ethernet controllers, namely to allow medium access control during a frame transmission. This proposal can increase the bandwidth efficiency of VTPE. VTPE, as well as P-NET or any other protocol based on circular token rotation technique, only allows a station to communicate once for each token round. This design imposition can cause unacceptable communication blocking in applications with isochronous traffic such as multimedia. An improvement in the VTPE proposal enables a station to access the medium more than once per token round. The experimental results as well as the temporal analysis show that the blocking can be drastically reduced. This improvement can also be used in the P-NET protocol. Finally this thesis proposes a variant of VTPE, named VTPE/hBEB, to be implemented in Ethernet controllers that are able to support the hBEB algorithm. The VTPE/hBEB allows more than one hBEB station to coexist with several standard Ethernet stations in the same shared Ethernet segment. A demonstrator for the VTPE/hBEB validation, as well as an application, are also presented and discussed

Delay-dependent output feedback compensators for a class of networked control systems

Tese (doutorado) - Universidade Federal de Santa Catarina, Centro Tecnológico, Programa de Pós-Graduação em Engenharia de Automação e Sistemas, Florianópolis, 2014Sistemas de controle via rede (NCS, do inglês Networked Control Systems) são uma classe especial de sistemas amostrados digitalmente, nos quais os dispositivos do sistema de controle se comunicam através de uma rede de comunicação (como mostrado na Fig. I). Significantes avanços tecnológicos tem levado a um maior interesse tanto na utilização de NCS em ambiente industrial (MOYNE; TILBURY, 2007), quanto em pesquisas relacionadas ao assunto (HESPANHA; NAGHSHTABRIZI; XU,2007; HEEMELS; WOUW, 2010; ZHANG; GAO; KAYNAK, 2013). Algumas das vantagens oferecidas por tais sistemas, com relação a sistemas de controle tradicionais, compreendem menor custo de implementação, flexibilidade e facilidade de manutenção. Apesar disso, inerentemente alguns efeitos indesejados também podem ocorrer, tais como atrasos na comunicação e intervalos de amostragem variantes, ocasionando degradação no desempenho do sistema em malha fechada. Devido a esses efeitos, a análise de estabilidade e também o projeto de controladores para NCS tornam-se mais desafiadores (TANG; YU, 2007). De modo geral, os estudos sobre NCS podem ser divididos em duas grandes áreas: controle da rede e controle via rede (GUPTA; CHOW, 2010). A primeira está mais interessada em proporcionar uma melhor qualidade no serviço de transmissão de dados realizado pela rede de comunicação, enquanto a segunda objetiva uma melhor qualidade do desempenho dos sistemas de controle sob determinadas condições induzidas pelos efeitos da utilização da rede. Embora tipicamente tratadas de forma separada, recentemente alguns esforços têm sido empreendidos de modo a integrar algumas características de ambas as áreas em fase de projeto, as chamadas estratégias de co-design (TORNGREN et al., 2006). Uma abordagem integrada é necessária de modo a se obter uma maior compreensão do funcionamento de um NCS, podendo assim obter um melhor desempenho geral do sistema. Neste contexto, especialmente levando em consideração que o uso rede de comunicação é limitado, tal recurso deve ser corretamente distribuído entre os sistemas de controle de modo a garantir um funcionamento adequado. Além disso, requisitos de desempenho individuais de cada planta também devem ser cumpridos, mesmo sujeitos a tais restrições de limites de recursos.Abstract: Networked control system (NCS) is a special class of sampled-data system where control systems devices are interconnected through a communication network. Despite the advantages, such as lower cost, flexibility and easy of maintenance compared to a more traditional implementation, some undesired effects may be induced by the use of a shared medium in the feedback loop, for instance, time-varying sampling intervals and delays. Due to the multidisciplinary nature of an NCS, the analysis and design of such systems also demand a more comprehensive approach. Thus, the main objective of this thesis is to propose some strategies for the synthesis of dynamic output feedback compensators, assuming an industrial network control system environment with temporal behavior features and requirements. Throughout this document, the NCS is modeled considering unknown time-varying delays, which leads to an uncertain system representation, later overapproximated by a convex polytope with additional norm-bounded uncertainty. Based on parameter dependent Lyapunov functions, closed-loop stability conditions are provided, which can be verified in terms of feasibility of a set of linear matrix inequalities (LMIs). The control designs are then promptly derived from the stability conditions, leading to delay-dependent compensators. Furthermore, an integrated control design and resource management strategy is proposed, taking into account the controller design while also addressing the shared nature of the communication network. This co-design strategy assumes that a supervisor task has the knowledge of all devices that access the network, as well as their allocated bandwidths. Numerical examples and simulations are provided to illustrate the effectiveness of the proposed design methodologies