<p>Ova disertacija se bavi istraživanjem problema kontinuiteta IP<br />mrežnih sesija u oblasti komunikscija u mobilnim računarskim mrežama.<br />Cilj istraživanja u okviru ove doktorske disertacije je da se definiše<br />rešenje problema mobilnosti primenjivo na heterogene bežične mreže<br />primenom metode softverski definisanog umrežavanja. U okviru<br />istraživanja prikazana je i praktična implementacija predloženog<br />rešenja. Tokom istraživanja su dobijeni rezultati koji ukazuju na potrebu<br />integracije postojećih tradicionalnih bežičnih mreža sa softverski<br />definisanim mrežama. Osnovu predloženog rešenja predstavlja<br />inkrementslan pristup u pogledu uvođenja novih SDN funkcionslnosti u<br />bežične IP mreže. Kroz implementaciju minimalnog seta SDN<br />funkcionalnosti gradi se tzv. hibridni model SDN mreže. Glavni<br />doprinos ovog istraživanja se ogleda u definisanju postupka koji će<br />omogućiti da se prevaziđe problem mobilnosti u aktuelnom konceptu<br />heterogenih bežičnih računarskih mreža. Ovakav model rešenja, pruža<br />značajan doprinos i sa aspekta ulaganja u promenu infrastrukture u<br />bežičnim mrežama. Implementacijom hibridnog modela, redukuje se<br />potreba za potpunim, ali i značajnim, uvođenjem virtuelne<br />infrastrukture bazirane na fleksibilnim softverski definisanim<br />mrežama.</p> / <p>This dissertation investigates the problem of IP networking communication<br />sessions continuity in mobile computer networks. The aim of the research within<br />this doctoral dissertation is to define a solution to the mobility problem<br />applicable to heterogeneous wireless networks using the software-defined<br />networking method. The research also demonstrates the practical<br />implementation of the proposed solution. During the research were obtained<br />results that indicate the need for integration of software-defined networks into<br />existing traditional wireless networks. The basis of the proposed solution is an<br />incremental approach in terms of introducing new SDN functionality into<br />wireless IP networks. Through the implementation of the minimal set of SDN<br />functionality, the so-called hybrid model of the SDN network is being built. The<br />main contribution of this research is reflected in the definition of a process that<br />will allow to overcome the problem of mobility in the current concept of<br />heterogeneous wireless computing networks. This solution model, also provides<br />a significant contribution from the aspect of investing in the change of<br />infrastructure in wireless networks. Implementation of the hybrid model reduces<br />the need for a complete replacement with a virtual infrastructure based on<br />flexible software-defined networks.</p>

Future Wireless Local Area Networks (WLANs) with high carrier frequencies and wide channels need a dense deployment of Access Points (APs) to provide good performance. In densely deployed WLANs associations of stations and handovers need to be managed more intelligently than today. This dissertation studies when and how a station should perform a handover and to which AP from a theoretical and a practical perspective. We formulate and solve optimization problems that allow to compute the optimal AP for each station in normal WLANs and WLANs connected via a wireless mesh backhaul. Moreover, we propose to use software defined networks and the OpenFlow protocol to optimize station associations, handovers and traffic rates. Furthermore, we develop new mechanisms to estimate the quality  of a link  between a station and an AP. Those mechanisms allow optimization algorithms to make better decisions about when to initiate a handover. Since handovers in today’s WLANs are slow and may disturb real-time applications such as video streaming, a faster procedure is developed in this thesis. Evaluation results from wireless testbeds and network simulations show that our architectures and algorithms significantly increase the performance of WLANs, while they are backward compatible at the same time.

Modern datacenters require a network with high cross-section bandwidth, fine-grained security, support for virtualization, and simple management that can scale to hundreds of thousands of hosts at low cost. This thesis first presents the firmware for Rain Man, a novel datacenter network architecture that meets these requirements, and then performs a general scalability study of the design space. The firmware for Rain Man, a scalable Software-Defined Networking architecture, employs novel algorithms and uses previously unused forwarding hardware. This allows Rain Man to scale at high performance to networks of forty thousand hosts on arbitrary network topologies. In the general scalability study of the design space of SDN architectures, this thesis identifies three different architectural dimensions common among the networks: source versus hop-by-hop routing, the granularity at which flows are routed, and arbitrary versus restrictive routing and finds that a source-routed, host-pair granularity network with arbitrary routes is the most scalable.

Datacenters are a significant capital expense for many enterprises. Yet, they are difficult to manage and are hard to design and maintain. The initial design of a datacenter network tends to follow vendor guidelines, but subsequent upgrades and expansions to it are mostly ad hoc, with equipment being upgraded piecemeal after its amortization period runs out and equipment acquisition is tied to budget cycles rather than changes in workload. These networks are also brittle and inflexible. They tend to be manually managed, and cannot perform dynamic traffic engineering. The high-level goal of this dissertation is to reduce the total cost of owning a datacenter by improving its network. To achieve this, we make the following contributions. First, we develop an automated, theoretically well-founded approach to planning cost-effective datacenter upgrades and expansions. Second, we propose a scalable traffic management framework for datacenter networks. Together, we show that these contributions can significantly reduce the cost of operating a datacenter network. To design cost-effective network topologies, especially as the network expands over time, updated equipment must coexist with legacy equipment, which makes the network heterogeneous. However, heterogeneous high-performance network designs are not well understood. Our first step, therefore, is to develop the theory of heterogeneous Clos topologies. Using our theory, we propose an optimization framework, called LEGUP, which designs a heterogeneous Clos network to implement in a new or legacy datacenter. Although effective, LEGUP imposes a certain amount of structure on the network. To deal with situations when this is infeasible, our second contribution is a framework, called REWIRE, which using optimization to design unstructured DCN topologies. Our results indicate that these unstructured topologies have up to 100-500\% more bisection bandwidth than a fat-tree for the same dollar cost. Our third contribution is two frameworks for datacenter network traffic engineering. Because of the multiplicity of end-to-end paths in DCN fabrics, such as Clos networks and the topologies designed by REWIRE, careful traffic engineering is needed to maximize throughput. This requires timely detection of elephant flows---flows that carry large amount of data---and management of those flows. Previously proposed approaches incur high monitoring overheads, consume significant switch resources, or have long detection times. We make two proposals for elephant flow detection. First, in the Mahout framework, we suggest that such flows be detected by observing the end hosts' socket buffers, which provide efficient visibility of flow behavior. Second, in the DevoFlow framework, we add efficient stats-collection mechanisms to network switches. Using simulations and experiments, we show that these frameworks reduce traffic engineering overheads by at least an order of magnitude while still providing near-optimal performance.

Développer des applications réseaux pour des routeurs programmables basés sur les Network Processors (NPs) implique l'utilisation de langages de bas-niveau et d'outils propriétaires fortement dépendants des architectures matérielles sous-jacentes. Le code source, généralement écrit en langage assembleur, n'est pas facile à écrire et cause des problèmes de maintenance. Les applications résultantes sont également difficiles à déboguer. Dans ce mémoire nous proposons NETLANG, un nouveau langage de programmation de haut-niveau dédié aux NPs. De plus d'être un langage simple et élégant, de réduire les coûts de développement et de la maintenance, et d'améliorer la réutilisation du code, NETLANG a pour objectif essentiel de décrire le comportement des paquets dans un NP. NETLANG est un langage qui permet de développer des applications de traitement de paquets. Il établit deux niveaux. Le premier niveau du langage offre une abstraction et une description du routeur à travers un pipeline de tables OpenFlow et des règles de forwarding ayant l'aptitude d'être modifiées dynamiquement et donc de permettre de changer le comportement du routeur à la volée. La sémantique du langage est inspirée du protocole OpenFlow qui a permis d'exprimer les principales tâches de traitement de paquets telles que le parsing, le lookup et la modification. Le langage est bâti en respectant le modèle des Software Defined Networks (SDNs) qui définit un nouveau plan de séparation entre le control plane et le data plane. Le deuxième niveau de NETLANG est traduit en matériel et permet l'adaptabilité du langage à plusieurs plateformes. Des adaptateurs spécifiques à des plateformes différentes sont intégrés au compilateur de NETLANG et permettent de rendre le langage portable. En effet, nous avons utilisé deux environnements pour l'implémentation de NETLANG ; le NP4 d'EZchip caractérisé par sa structure de TOPs (Task Optimized Processors) en pipeline et le NFP-3240 de Netronome connu pour son parallélisme et l'exploitation du multithreading. La validation de NETLANG s'est basée sur un ensemble d'applications réseau ayant des complexités et des domaines différents. A travers ce mémoire nous avons démontré qu'on est capable d'avoir aujourd'hui un langage pour les routeurs programmables. La sémantique d'OpenFlow, sur laquelle nous avons basé notre langage NETLANG, est suffisante et même pertinente en termes de description de comportement des paquets dans un NP. ______________________________________________________________________________ MOTS-CLÉS DE L’AUTEUR : langages à domaine spécifique, réseaux programmables, processeurs de réseau.

Datacenters are a significant capital expense for many enterprises. Yet, they are difficult to manage and are hard to design and maintain. The initial design of a datacenter network tends to follow vendor guidelines, but subsequent upgrades and expansions to it are mostly ad hoc, with equipment being upgraded piecemeal after its amortization period runs out and equipment acquisition is tied to budget cycles rather than changes in workload. These networks are also brittle and inflexible. They tend to be manually managed, and cannot perform dynamic traffic engineering. The high-level goal of this dissertation is to reduce the total cost of owning a datacenter by improving its network. To achieve this, we make the following contributions. First, we develop an automated, theoretically well-founded approach to planning cost-effective datacenter upgrades and expansions. Second, we propose a scalable traffic management framework for datacenter networks. Together, we show that these contributions can significantly reduce the cost of operating a datacenter network. To design cost-effective network topologies, especially as the network expands over time, updated equipment must coexist with legacy equipment, which makes the network heterogeneous. However, heterogeneous high-performance network designs are not well understood. Our first step, therefore, is to develop the theory of heterogeneous Clos topologies. Using our theory, we propose an optimization framework, called LEGUP, which designs a heterogeneous Clos network to implement in a new or legacy datacenter. Although effective, LEGUP imposes a certain amount of structure on the network. To deal with situations when this is infeasible, our second contribution is a framework, called REWIRE, which using optimization to design unstructured DCN topologies. Our results indicate that these unstructured topologies have up to 100-500\% more bisection bandwidth than a fat-tree for the same dollar cost. Our third contribution is two frameworks for datacenter network traffic engineering. Because of the multiplicity of end-to-end paths in DCN fabrics, such as Clos networks and the topologies designed by REWIRE, careful traffic engineering is needed to maximize throughput. This requires timely detection of elephant flows---flows that carry large amount of data---and management of those flows. Previously proposed approaches incur high monitoring overheads, consume significant switch resources, or have long detection times. We make two proposals for elephant flow detection. First, in the Mahout framework, we suggest that such flows be detected by observing the end hosts' socket buffers, which provide efficient visibility of flow behavior. Second, in the DevoFlow framework, we add efficient stats-collection mechanisms to network switches. Using simulations and experiments, we show that these frameworks reduce traffic engineering overheads by at least an order of magnitude while still providing near-optimal performance.

Os Pontos de Troca de Tráfego participam de maneira substancial e crítica no ecossistema da Internet, possibilitando conexões entre múltiplos Sistemas Autônomos (ASes, do inglês Autonomous Systems). O gerenciamento das redes de PTT possui como objetivos primários, o gerenciamento dos chamados fluxos elefante (do inglês, elephant flows). Fluxos elefante tendem a existir em número reduzido, porém correspondem à maioria do tráfego em uma infraestrutura de rede. O gerenciamento dos fluxos elefante envolve uma adequada identificação e quando necessário, um redirecionamento destes fluxos para caminhos mais apropriados, de forma a minimizar os possíveis impactos sobre os outros fluxos ativos na rede. Além disso, o gerenciamento de fluxos elefante tornou-se um importante objeto de discussão em PTTs baseados em redes SDN, principalmente porque estas redes dispõem de controladores que possuem uma visão consistente da rede subjacente, o que permite uma gerência destes fluxos de forma refinada. Nesta dissertação, será proposto, desenvolvido e avaliado um sistema de identificação dos fluxos elefante e seus respectivos caminhos de rede, em conjunto com um sistema de recomendação, que possui o objetivo de sugerir configurações alternativas para os fluxos elefante identificados anteriormente nas redes de PTTs baseadas em SDN. Neste sistema, o operador do PTT pode definir templates que em última instância definem como os caminhos dos fluxos elefante serão modificados para atender objetivos específicos. Por fim, será demonstrado que o sistema proposto pode auxiliar o operador do PTT a identificar, gerenciar e mitigar o impacto dos fluxos elefante da rede do PTT. / Internet Exchange Points (IXPs) play a key role in the current Internet architecture enabling cost-effective connections among multiple autonomous systems (ASes). Management of IXP networks is primarily concerned with the management of the so-called elephant flows. Such flows represent a small portion of the total flows of a IXP network but usually have high impact on the overall traffic. Managing elephant flows involves adequate identification and eventually rerouting of such flows to more appropriate locations to minimize the possible negative impact on the other (mice) flows active in the network. Elephant flow management becomes more important in SDN-based IXPs that require controllers to have a consistent view of the underlying network to allow fine-grained adjustment. In this master thesis, we propose, develop, and evaluate an identification system to identify elephant flows and their respectively paths, as well as a recommendation system to suggest alternative configurations to previously identified elephant flows in an SDN-based IXP network. In this solution, the IXP operator can define templates that ultimately define how elephant flows can be reconfigured to achieve a specific objective. We demonstrate that our system can help IXP operators to identify, handle and mitigate the impact of elephant flows in the IXP network.

Em um futuro próximo, “dispositivos inteligentes” serão massivamente empregados em campos de batalha. Essa já é uma realidade, porém, o número de dispositivos utilizados em campos de batalha tende a aumentar em ordens de magnitude. As redes de comunicação de dados serão essenciais para transmitir os dados que esses dispositivos coletam e transformá-los em informações valiosas utilizadas como suporte à atuação humana. O suporte à tomada de decisão, ou mesmo níveis de autonomia, permitindo que estes dispositivos coordenem outros dispositivos, exigem comunicação contínua. Desafios relacionados à comunicação surgirão devido à dinamicidade do ambiente. A configuração da rede deve refletir decisões superiores automaticamente. A grande escala das redes conectando os altos escalões, tropas, veículos e sensores, aliada à falta de padronização dos dispositivos, tornará a integração destes desafiadora. Em um ambiente tão heterogêneo, muitos protocolos e tecnologias coexistirão. As redes de campo de batalha são um elemento de suma importância nas operações militares modernas e conceito de guerra centrada em rede é uma tendência sem volta e influencia desde os altos escalões até o controle de tropas Embora estudos tenham sido realizados nessa área, a maioria deles aborda redes estratégicas de alto nível e portanto não levam em conta as “redes táticas de última milha” (TEN), que compreendem dispositivos de comunicação com recursos limitados, como sensores ou ainda pequenos veículos aéreos não tripulados. Em uma tentativa de preencher esta lacuna, esse trabalho propõe uma arquitetura que combina conceitos dos paradigmas de redes definidas por software (SDN) juntamente com redes tolerantes à atraso/disrupçoes (DTN), para aplicação em redes táticas de última milha. O uso de SDN em cenários com nodos móveis é avaliado considerando uma aplicação de vigilância que utiliza streaming de vídeo e medidas de Qualidade de Experiência (QoE) de usuário são coletadas. Com base nos resultados obtidos, uma aplicação em conjunto dos conceitos de SDN e DTN é proposta, além disso abordamos a escolha do nodo que atuará como controlador SDN na rede. Os experimentos foram executados utilizando um emulador de redes. Apesar de pesquisas adicionais serem necessárias – considerado requisitos de segurança, por exemplo – os resultados foram promissores e demonstram a aplicabilidade destes conceitos no cenários das TENs. / The future battlefield tends to be populated by a plethora of “intelligent things”. In some ways, this is already a reality, but in future battlefields, the number of deployed things should be orders of magnitude higher. Networked communication is essential to take real advantage of the deployed devices on the battlefield, and to transform the data collected by them into information valuable for the human warfighters. Support for human decision making and even a level of autonomy, allowing devices to coordinate and interact with each other to execute their activities in a collaborative way require continuous communication. Challenges regarding communication will arise from the high dynamics of the environment. The network adaption and management should occur autonomously, and it should reflect upper-level decisions. The large scale of the network connecting high-level echelons, troops on the field, and sensors of many types, beside the lack of communication standards turn the integration of the devices more challenging. In such a heterogeneous environment, many protocols and communication technologies coexist. This way, battlefield networks is an element of paramount importance in modern military operations Additionally, a change of paradigm regarding levels of autonomy and cooperation between humans and machines is in course and the concept of network-centric warfare is a no way back trend. Although new studies have been carried out in this area, most of these concern higher-level strategic networks, with abundant resources. Thus, these studies fail to take into account the “last-mile Tactical Edge Network (TEN) level,” which comprises resource constrained communication devices carried by troopers, sensor nodes deployed on the field or small unmanned aerial vehicles. In an attempt to fill this gap, this work proposes an architecture combining concepts from software-defined networking (SDN) paradigm and the delay-tolerant approach to support applications in the last-mile TEN. First, the use of SDN in dynamic scenarios regarding node positioning is evaluated through a surveillance application using video streaming and Quality of Experience (QoE) measures are captured on the video player. We also explore the election of nodes to act as SDN Controllers in the TEN environment. The experiments use emulator for SDN with support to wireless networks. Further investigation is required, for example, considering security requirements, however the results are promising and demonstrate the applicability of this architecture in the TEN network scenario.

The aim of this master thesis is to create a web-based graphical user interface which communicates with a Software Defined Controller and the OpenFlow protocol to provide a basic network management and a topology graph, then to describe main aspects of the OpenFlow technology and to optimalize the chosen SDN Controller for full support in a multi-vendor enviroment.

Energy conservation is a main concern in Wireless Sensor Networks (WSN). To reduce energy consumption it is important to know how it is spent and how much is available during the node and network operation. Several previous works have proposed energy consumption models focused on the communication module, while neglecting the processing and sensing activities. Other works presented more complex and complete models, but lacked experiments to demonstrate their accuracy in real deployments. The main objective of this work is to design and to evaluate an accurate energy consumption model for WSN, which considers the sensing, processing, and communication modules usage. This model was used to implement two energy consumption prediction mechanism. One mechanism is based in Markov chains and the other one is based in time series analysis. The metrics to evaluate the model and prediction mechanisms performance were: energy consumption estimation accuracy, energy consumption prediction accuracy, and node\'s communication and processing resources usage. The energy consumption prediction mechanisms performance was compared using two implementation schemes: running the prediction algorithm in the sensor node and running the prediction algorithm in a Software-Defined Networking controller. The implementation was conducted using IT-SDN, a Software-Defined Wireless Sensor Network framework. For the evaluation, simulation and emulation used COOJA, while testbed experiments used TelosB devices. Results showed that considering the sensing, processing, and communication energy consumption into the model, it is possible to obtain an accurate energy consumption estimation for Wireless Sensor Networks. Also, the use of a Software-Defined Networking controller for processing complex prediction algorithms can improve the prediction accuracy. / A conservação da energia é uma das principais preocupações nas Redes de Sensores Sem Fio (WSN, do inglês Wireless Sensor Networks). Para reduzir o consumo de energia, é importante saber como a energia é gasta e quanta energia há disponível durante o funcionamento da rede. Diversos trabalhos anteriores propuseram modelos de consumo de energia focados no módulo de comunicação, ignorando o consumo por tarefas de processamento e sensoriamento. Outros trabalhos apresentam modelos mais completos e complexos, mas carecem de experimentos que demonstrem a exatidão em dispositivos reais. O objetivo principal deste trabalho é projetar e avaliar um modelo de consumo de energia para WSN que considere o consumo por sensoriamento, processamento e comunicação. Este modelo foi utilizado para implementar dois mecanismos de previsão de consumo de energia, um deles baseado em cadeias de Markov e o outro baseado em séries temporais. As métricas para avaliar o desempenho do modelo e dos mecanismos de previsão de consumo de energia foram: exatidão da estimativa de consumo de energia, exatidão da previsão de consumo de energia e uso dos recursos de comunicação e processamento do nó. O desempenho dos mecanismos de previsão de consumo de energia foram comparados utilizando dois esquemas de implementação: rodando o algoritmo de previsão no nó sensor e rodando o algoritmo de previsão em um controlador de rede definida por software. A implementação foi conduzida utilizando IT-SDN, um arcabouço de desenvolvimento de redes de sensores sem fio definidas por software. A avaliação foi feita com simulações e emulações utilizando o simulador COOJA e ensaios com dispositivos reais utilizando o TelosB. Os resultados mostraram que considerando o consumo de energia por sensoriamento, processamento e communicação, é possivel fazer uma estimativa de consumo de energia em redes de sensores sem fio com uma boa exatidão. Ainda, o uso de um controlador de rede definida por software para processamento de algoritmos de previsão complexos pode aumentar a exatidão da previsão.