Academic literature on the topic 'Network service chaining'

L'émergence de la technologie de virtualisation des fonctions réseau (NFV) a suscité un vif intérêt autour de la conception, la gestion et le déploiement de services réseau de manière flexible, automatisée et indépendante du fournisseur. La mise en œuvre de la technologie NFV devrait être une solution profitable pour les fournisseurs de services et les clients. Cependant, ce changement de paradigme, amorcé par NFV, nécessite un abandon progressif des services réseau fournis à travers des équipements dédiés. En contrepartie, un environnement totalement ou partiellement virtualisé est proposé pour instancier dynamiquement et à la demande des modules logiciels appelés fonctions de réseau virtuelles (VNF). Cette évolution soulève un ensemble de défis liés au déploiement et à l'exploitation de services, tels que l'orchestration et la gestion, la résilience des services, le contrôle de la qualité de service (QoS), l’approvisionnement des ressources, etc. En outre, la question centrale à résoudre dans le contexte NFV est la suivante : « comment placer et chaîner effacement des fonctions virtuelles d’un service afin de fournir un niveau de qualité demandé par le client tout en optimisant l'utilisation des ressources par le fournisseur de services ? ”.Ainsi, cette thèse étudie la problématique du placement et du chaînage des VNF en tenant compte de certaines exigences de service telles que le délai de bout en bout, la disponibilité du service et la consommation d'énergie, et propose un ensemble d'algorithmes et de mécanismes visant à optimiser le déploiement des services demandés/fournis. Nos contributions dans cette thèse sont triples. Premièrement, nous proposons deux algorithmes de placement et de chaînage de VNF sensibles au délai de bout-en-bout pour des applications temps-réel. Les algorithmes proposés visent à respecter le délai approprié de bout-en-bout qui dépend du service déployé (exemples : VoIP, Streaming, etc.). Deuxièmement, nous présentons une analyse comparative de la disponibilité des services et nous proposons deux mécanismes de placement et de chaînage de VNF pour garantir un niveau prédéfini de disponibilité. L’objectif est de fournir des services résilients en ajustant avec précision les paramètres du schéma de protection (nombre, type, emplacement et taille des instances VNF) nécessaires pour atteindre ce niveau de disponibilité en dépit des défaillances du réseau. Enfin, nous proposons une architecture générale qui explore la possibilité d’étendre le paradigme de la virtualisation à l’Internet des objets (IoT). À cette fin, nous définissons un mécanisme de placement et de chaînage respectant les contraintes énergétiques pour des services IoT. Notre architecture propose de découpler et de virtualiser les fonctionnalités inhérentes à un objet connecté de l’équipement IoT physique. En étendant NFV au domaine IoT, notre solution ouvre de nouvelles perspectives d’application en supportant de nouveaux cas d’usages<br>The emergence of Network Function Virtualization (NFV) technology has aroused keen interest to design, manage and deploy network services in a flexible, automated and vendor-agnostic manner. Implementing NFV technology is expected to be a win-win solution for both service providers and costumers. However, this paradigm shift, sparked by NFV, calls for a progressive abandon of network services that are provided as hardware appliance and rather it proposes a fully or partially virtualized environment that offers software modules called Virtual Network Functions (VNFs). This shift rises a set of challenges related to service deployment and operation such as orchestration and management, service resiliency, Quality of Service (QoS) and resource provisioning among others. Furthermore, the core question that needs to be solved within NFV context is “What is the best way to place and chain VNFs that form a service in order to meet Service Level Agreement requirements (costumer side) while optimizing resource usage (service provider side)?”.This thesis investigates the problem of VNF Placement and Chaining considering service requirements such as end-to-end delay, service availability and energy consumption and proposes a set of algorithms and mechanisms that aim to achieve an optimized deployment of the requested/provided services. Our contributions in this thesis are threefold. First, we propose a delay-aware Placement and Chaining algorithms for delay-sensitive applications over NFV networks. The proposed algorithms aim to meet the appropriate end-to-end delay defined according to the deployed service (VoIP, Streaming, etc.). Second, we provide a comprehensive service availability benchmarking and we propose two availability-aware mechanisms for VNFs chain. The aim is to provide resilient service provisioning by fine-tuning the parameters of the protection scheme (the number, the type, the placement and the size of the spare instances) needed to reach a predefined availability level, despite network failures. Finally, we propose a framework architecture that explores the possibility to extend the virtualization paradigm to Internet of Things (IoT). Toward this end, we define an energy-aware Placement and Chaining for IoT services where inherent IoT functionalities are decoupled from specific dedicated IoT devices and instantiated on-demand. By bringing together NFV and IoT paradigms, this extension opens new perspectives and push toward designing new use cases

La programmabilité et la virtualisation croissante des architectures réseaux nécessitent de nouvelles approches pour garantir une résilience face aux catastrophes (naturelles, défaillances matérielles localisées ou généralisées). Elles nécessitent aussi de maintenir la qualité de service, en cas de pannes à grande échelle. Alors que la complexité et la dynamicité des infrastructures numériques s’accroît, il est essentiel de développer des stratégies robustes de provisionnement de services réseaux virtualisés. L’objectif est de garantir la continuité opérationnelle du réseau et la fiabilité des services supportés, en particulier dans des conditions critiques. Par ailleurs, l’optimisation et la disponibilité des ressources, telles que la bande passante, la capacité de traitement, de stockage mais aussi les coûts opérationnels, constituent des éléments critiques, dans les environnements réseaux dynamiques. Dans ce contexte, les architectures réseaux doivent être capables, conjointement, de fournir un haut niveau de résilience, satisfaire les contraintes de qualité de service, tout en minimisant l’usage des ressources disponibles. Pour adresser ce triple défi, nous proposons des stratégies de provisionnement de chaînes de fonctions de service réseau (Service Function Chains – SFC) résilientes, tout en préservant l’efficacité et l’usage des ressources disponibles. Dans une première contribution, nous proposons un routage multi-chemins adaptatifs pour la protection multi-chemins (MP). Cette protection MP réduit significativement les ressources réservées pour le chemin de secours à travers une répartition pertinente du trafic SFC sur plusieurs chemins primaires « DZ-disjoints ». Pour optimiser le placement des VNF, le routage des requêtes SFC avec protection, nous proposons un modèle de programme linéaire en nombres entiers (ILP) adaptatif. Deux heuristiques sont aussi proposées pour fournir des solutions quasi optimales, qui réduisent significativement le temps de calcul. Dans la seconde contribution, un schéma d’optimisation des ressources est proposé pour le chaînage de fonctions service réseau hybride résilient (R-HSF CRO). Ce schéma prend en compte des exigences distinctes pour le trafic bidirectionnel et une mutualisation des VNFs. Les solutions exactes sont formulées à l’aide de la programmation linéaire en nombres entiers mixtes (MILP) et de la programmation par contraintes (CP). Pour pallier aux limitations de MILP et CP (passage à l’échelle) deux heuristiques basées sur un routage de plus court chemin multi-contraint dans un graphe multipartie sont proposés. Le routage DZ-disjoint que nous proposons permet de tenir compte de la cartographie réseau des zones sinistrées, pour minimiser en parallèle l’usage des ressources disponibles (sur les liens actifs mais aussi de secours) et satisfaire les contraintes de qualité de service (ex. latence). Les résultats obtenus montrent l’efficacité, la pertinence et le passage à l’échelle des algorithmes, heuristiques proposés pour des scénarios réseaux de petite, moyenne et grande dimension. Les évaluations numériques confirment que les stratégies proposées réduisent significativement l’utilisation des ressources nécessaires ou disponibles (de 20 à 50 % pour certains scénarios) tout en garantissant une protection totale contre des pannes affectant une seule disaster zone. Les résultats obtenus montrent également que les solutions proposées offrent un équilibre judicieux entre un niveau de résilience garanti et une allocation optimale des ressources disponibles, dans les environnements réseaux virtualisés NFV<br>The increasing programmability and virtualization of network architectures require new approaches to ensure resilience against disaster zones (DZs) implying large-scale failures while maintaining quality of service. As the complexity and dynamicity of digital infrastructures increase, it is essential to develop robust strategies for provisioning virtualized network services. The objective is to guarantee the operational continuity of the network and the reliability of the supported services, especially in critical conditions. In addition, the optimization and availability of resources such as bandwidth, processing capacity, storage, but also operational costs, constitue critical elements in dynamic network environments. In this context, network architectures must be able, jointly, to provide a high level of resilience, satisfy quality of service constraints, while minimizing the use of available resources. To address this triple challenge, we propose novel cost-efficient strategies for provisioning Service Function Chains (SFCs), while guaranteeing full disaster resilience. First, we introduce a Multi-path Protection (MP) approach employing adaptive multi path routing. MP significantly reduces the resources reserved for backup paths through a relevant distribution of SFC traffic over multiple « DZ-disjoint » working paths. To optimize VNFs placement, SFC requests routing, and implement protection mechanisms, we propose a path-adaptive and flow-based Integer Linear Program (ILP) model. Additionally, two heuristic algorithms are also proposed to provide near-optimal solutions that significantly reduce computation time. Second, we propose the Resilient Hybrid Service Function Chain Resource Optimization (R-HSFCRO) framework for hybrid SFC provisioning, where forward and backward traffic exhibit distinct requirements. Our approach optimizes resource usage by sharing common VNFs while ensuring DZ-disjoint paths. We formulate exact solutions using Mixed-Integer Linear Programming (MILP) and Constraint Programming (CP). To overcome the limits of MILP and CP, two heuristics based on a multi-partite graph and multi-constraint shortest-path are proposed. The proposed « DZ-disjoint » routing takes into account the network mapping of disaster areas, to minimize in parallel the use of available resources (on active links but also backup links) and satisfy quality of service constraints (e.g., latency). The results obtained show the efficiency, relevance, and scalability of the proposed algorithms and heuristics for « small », « medium » and « large » dimensional network scenarios. Numerical evaluations confirm that the proposed strategies significantly reduce the use of necessary or available resource (by 20 to 50% for some scenarios) while ensuring full protection against failures affecting a single « disaster zone ». The results obtained also showed that the proposed solutions offer a judicious balance between a guaranted level of resilience and an optimal allocation of available resources in NFV virtualized network environments

Software Defined Networking (SDN) has become increasingly popular in combination with Network Function Virtualization (NFV). SDN is a way to make a network more programmable and dynamic. However, in order to create a homogeneous network using this concept, legacy equipment will have to be substituted by SDN equipment, which is costly. To close the gap between the legacy world and SDN, we introduce the concept of a legacy Network Management System (NMS) that is connected to an SDN controller to perform service provisioning. This way, the NMS is capable of configuring both legacy as well as SDN networks to provide customers with the services that they have ordered, while still allowing for new SDN features in the SDN domain of the network. The main service we wish to provide using SDN is Service Function Chaining (SFC). Service provisioning consists of dynamically constructing a path through the ordered network services, in this case Virtual Network Functions (VNFs). This thesis focuses on the SDN controller and its interaction with the NMS. This project aims at configuring OpenFlow rules in the network using an SDN controller to perform SFC. Moreover, the focus will be on how to represent an SDN element and a service function chain in the legacy network NMS. The thesis also contains a discussion on what information should be exchanged between the management software and the controller. The management software used is called BECS, a system developed by Packetfront Software. Integrating SDN in BECS is done by creating a proof of concept, containing a full environment from the low level network elements to the NMS. By using a bottom-up approach for creating this proof of concept, the information that BECS is required to send to the SDN controller can be identified before designing and implementing the connection between these two entities. When sending the information, the NMS should be able to receive acknowledgement of successful information exchange or an error. However, when the proof of concept was created a problem arose on how to test and troubleshoot it. For this reason, a web Graphical User Interface (GUI) was created. This GUI shows the number of packets that have gone through a VNF. Because it is possible to see how many packets go through a VNF, one can see where a network issue occurs. The subsequent analysis investigates the impact of making such a GUI available for a network administrator and finds that the part of the network where the configuration error occurs can be narrowed down significantly.<br>Software Defined Networking (SDN) har blivit mer och mer populärt i kombination med Network Function Virtualization (NFV). SDN är en sätt för att göra ett nätverk mer programmerbart och dynamiskt. För att skapa ett homogent nätverk med detta koncept, behöver man dock ersätta traditionell utrustning med SDN utrustning som är dyr. För att stänga gapet mellan traditionella nätverk och SDN-världen, introducerar vi ett koncept med ett traditionell Network Management System (NMS) som är anslutet till en SDN-styrenhet för att utföra tjänsteprovisionering. På detta sätt kan NMS:et konfigurera både traditionella och SDN-nätverk, samt provisionera tjänster för kunderna medan nya SDN-funktioner möjliggörs i SDN-delen av nätverket. Den huvudsakliga tjänsten som vi vill lansera genom SDN är Service Function Chaining (SFC). Tjänsteprovisionering består av att konstruera en väg genom beställda tjänster, i detta fall Virtual Network Functions (VNFs). Detta examensarbete fokuserar huvusakligen på SDN-styrenheten och dess interaktion med NMS:et. Projektet syftar till att konfigurera OpenFlow regler i SDN-styrenheten för att utföra SFC. Dessutom fokuserar arbetet på hur man kan representera SDN-element och SFCs i ett traditionellt NMS. Vidare diskuteras vilken information som ska utbytas mellan NMS:et och SDNstyrenheten. NMS:et som ska vara användas är BECS, ett system utvecklat av Packetfront Software. Uppgiften löses genom att skapa ett proof of concept, som innehåller ett komplett system med alla komponenter från nätverkselement till NMS:et. Genom att använda en bottom-up-strategi för detta proof of concept kan informationen som BECS måste skicka till SDN styrenheten indentifieras, innan design och implementation av förbindelsen mellan enheterna kan utföras. När informationen är skickad ska NMS:et kunna hämta information om huruvida styrenheten fick informationen utan fel. Dock uppstår ett problem gällande hur man testar och felsöker detta proof of concept. Av denna anledning skapades ett web Graphical User Interface (GUI). Användargränssnittet visar antalet paket som går genom varje VNF, samt var i nätverket fel uppstår. Analysen undersöker hur stor effekten är för en nätverkadministrator och visar att området där fel kan uppstå begränsas avsevärt.

Geoinformatics field of science becomes more and more important nowadays. This is not only because it is crucial for industry, but it also plays more important role in consumer electronics than ever before. The ongoing demand for complex solutions gave a rise to SOA1 architecture in enterprise and geographical field. The topic that is currently being studied is interoperability between different geospatial services. This paper makes a proposal for a master thesis that tries to add another way of chaining different geospatial services. It describes the current state of knowledge, possible research gap and then goes into the details on design and execution part. Final stage is the summary of expected outcomes. The result of this proposal is a clearly defined need for a research in the outlined area of knowledge.<br>Contact details: email: dawidnejman@gmail.com phone: +48 511-139-190

A Virtualização de Funções de Rede (NFV – Network Function Virtualization) é um novo conceito arquitetural que está remodelando a operação de funções de rede (e.g., firewall, gateways e proxies). O conceito principal de NFV consiste em desacoplar a lógica de funções de rede dos dispositivos de hardware especializados e, desta forma, permite a execução de imagens de software sobre hardware de prateleira (COTS – Commercial Off-The-Shelf). NFV tem o potencial para tornar a operação das funções de rede mais flexíveis e econômicas, primordiais em ambientes onde o número de funções implantadas pode chegar facilmente à ordem de centenas. Apesar da intensa atividade de pesquisa na área, o problema de posicionar e encadear funções de rede virtuais (VNF – Virtual Network Functions) de maneira escalável e com baixo custo ainda apresenta uma série de limitações. Mais especificamente, as estratégias existentes na literatura negligenciam o aspecto de encadeamento de VNFs (i.e., objetivam sobretudo o posicionamento), não escalam para o tamanho das infraestruturas NFV (i.e., milhares de nós com capacidade de computação) e, por último, baseiam a qualidade das soluções obtidas em custos operacionais não representativos. Nesta tese, aborda-se o posicionamento e o encadeamento de funções de rede virtualizadas (VNFPC – Virtual Network Function Placement and Chaining) como um problema de otimização no contexto intra- e inter-datacenter. Primeiro, formaliza-se o problema VNFPC e propõe-se um modelo de Programação Linear Inteira (ILP) para resolvêlo. O objetivo consiste em minimizar a alocação de recursos, ao mesmo tempo que atende aos requisitos e restrições de fluxo de rede. Segundo, aborda-se a escalabilidade do problema VNFPC para resolver grandes instâncias do problema (i.e., milhares de nós NFV). Propõe-se um um algoritmo heurístico baseado em fix-and-optimize que incorpora a meta-heurística Variable Neighborhood Search (VNS) para explorar eficientemente o espaço de solução do problema VNFPC. Terceiro, avalia-se as limitações de desempenho e os custos operacionais de estratégias típicas de aprovisionamento ambientes reais de NFV. Com base nos resultados empíricos coletados, propõe-se um modelo analítico que estima com alta precisão os custos operacionais para requisitos de VNFs arbitrários. Quarto, desenvolve-se um mecanismo para a implantação de encadeamentos de VNFs no contexto intra-datacenter. O algoritmo proposto (OCM – Operational Cost Minimization) baseia-se em uma extensão da redução bem conhecida do problema de emparelhamento ponderado (i.e., weighted perfect matching problem) para o problema de fluxo de custo mínimo (i.e., min-cost flow problem) e considera o desempenho das VNFs (e.g., requisitos de CPU), bem como os custos operacionais estimados. Os resultados alcaçados mostram que o modelo ILP proposto para o problema VNFPC reduz em até 25% nos atrasos fim-a-fim (em comparação com os encadeamentos observados nas infra-estruturas tradicionais) com um excesso de provisionamento de recursos aceitável – limitado a 4%. Além disso, os resultados evidenciam que a heurística proposta (baseada em fix-and-optimize) é capaz de encontrar soluções factíveis de alta qualidade de forma eficiente, mesmo em cenários com milhares de VNFs. Além disso, provê-se um melhor entendimento sobre as métricas de desempenho de rede (e.g., vazão, consumo de CPU e capacidade de processamento de pacotes) para as estratégias típicas de implantação de VNFs adotadas infraestruturas NFV. Por último, o algoritmo proposto no contexto intra-datacenter (i.e. OCM) reduz significativamente os custos operacionais quando comparado aos mecanismos de posicionamento típicos uti<br>Network Function Virtualization (NFV) is a novel concept that is reshaping the middlebox arena, shifting network functions (e.g. firewall, gateways, proxies) from specialized hardware appliances to software images running on commodity hardware. This concept has potential to make network function provision and operation more flexible and cost-effective, paramount in a world where deployed middleboxes may easily reach the order of hundreds. Despite recent research activity in the field, little has been done towards scalable and cost-efficient placement & chaining of virtual network functions (VNFs) – a key feature for the effective success of NFV. More specifically, existing strategies have neglected the chaining aspect of NFV (focusing on efficient placement only), failed to scale to hundreds of network functions and relied on unrealistic operational costs. In this thesis, we approach VNF placement and chaining as an optimization problem in the context of Inter- and Intra-datacenter. First, we formalize the Virtual Network Function Placement and Chaining (VNFPC) problem and propose an Integer Linear Programming (ILP) model to solve it. The goal is to minimize required resource allocation, while meeting network flow requirements and constraints. Then, we address scalability of VNFPC problem to solve large instances (i.e., thousands of NFV nodes) by proposing a fixand- optimize-based heuristic algorithm for tackling it. Our algorithm incorporates a Variable Neighborhood Search (VNS) meta-heuristic, for efficiently exploring the placement and chaining solution space. Further, we assess the performance limitations of typical NFV-based deployments and the incurred operational costs of commodity servers and propose an analytical model that accurately predict the operational costs for arbitrary service chain requirements. Then, we develop a general service chain intra-datacenter deployment mechanism (named OCM – Operational Cost Minimization) that considers both the actual performance of the service chains (e.g., CPU requirements) as well as the operational incurred cost. Our novel algorithm is based on an extension of the well-known reduction from weighted matching to min-cost flow problem. Finally, we tackle the problem of monitoring service chains in NFV-based environments. For that, we introduce the DNM (Distributed Network Monitoring) problem and propose an optimization model to solve it. DNM allows service chain segments to be independently monitored, which allows specialized network monitoring requirements to be met in a efficient and coordinated way. Results show that the proposed ILP model for the VNFPC problem leads to a reduction of up to 25% in end-to-end delays (in comparison to chainings observed in traditional infrastructures) and an acceptable resource over-provisioning limited to 4%. Also, we provide strong evidences that our fix-and-optimize based heuristic is able to find feasible, high-quality solutions efficiently, even in scenarios scaling to thousands of VNFs. Further, we provide indepth insights on network performance metrics (such as throughput, CPU utilization and packet processing) and its current limitations while considering typical deployment strategies. Our OCM algorithm reduces significantly operational costs when compared to the de-facto standard placement mechanisms used in Cloud systems. Last, our DNM model allows finer grained network monitoring with limited overheads. By coordinating the placement of monitoring sinks and the forwarding of network monitoring traffic, DNM can reduce the number of monitoring sinks and the network resource consumption (54% lower than a traditional method).

Service Function Chaining (SFC) enriches the network functionalities to fulfill the increasing demand of value-added services. By leveraging SDN and NFV for SFC, it becomes possible to meet the demand fluctuation and construct a dynamic SFc. However, the integration of SDN with NFV requires packet header modifications, generates excessive network traffics, and induces additional I/O overheads for packet processing. These additional overheads result in a lower system performance, scalability, and agility. To improve the system performance, a co-optimized solution is proposed to implemented NF to achieve a better performance for software-based network functions. To improve the system scalability, a many-field packet classification is proposed to support a more complex ruleset. To improve the system agility, a network function-enabled switch is proposed to lower the network function content switching time. The experiment results show that the performance of a network function is improved by 8 times by leveraging GPU as a parallel computation platform. Moreover, the matching speed to steer network traffics with many-field ruleset is improved by 4 times with the proposed many-field packet classification algorithm. Finally, the proposed system is able to improve system bandwidth 5 times better compared the native solution and maintain the content switch time with the proposed SFC implementation using SDN and NFV.

Questo documento si interroga sulle nuove possibilità offerte agli operatori del mondo delle Reti di Telecomunicazioni dai paradigmi di Network Functions Virtualization, Cloud Computing e Software Defined Networking: questi sono nuovi approcci che permettono la creazione di reti dinamiche e altamente programmabili, senza disdegnare troppo il lato prestazionale. L'intento finale è valutare se con un approccio di questo genere si possano implementare dinamicamente delle concatenazioni di servizi di rete e se le prestazioni finali rispecchiano ciò che viene teorizzato dai suddetti paradigmi. Tutto ciò viene valutato per cercare una soluzione efficace al problema dell'ossificazione di Internet: infatti le applicazioni di rete, dette middle-boxes, comportano costi elevati, situazioni di dipendenza dal vendor e staticità delle reti stesse, portando all'impossibilità per i providers di sviluppare nuovi servizi. Il caso di studio si basa proprio su una rete che implementa questi nuovi paradigmi: si farà infatti riferimento a due diverse topologie, una relativa al Livello L2 del modello OSI (cioè lo strato di collegamento) e una al Livello L3 (strato di rete). Le misure effettuate infine mostrano come le potenzialità teorizzate siano decisamente interessanti e innovative, aprendo un ventaglio di infinite possibilità per il futuro sviluppo di questo settore.

Doutoramento em Engenharia Informática<br>The proliferation of Internet access allows that users have the possibility to use services available directly through the Internet, which translates in a change of the paradigm of using applications and in the way of communicating, popularizing in this way the so-called cloud computing paradigm. Cloud computing brings with it requirements at two different levels: at the cloud level, usually relying in centralized data centers, where information technology and network resources must be able to guarantee the demand of such services; and at the access level, i.e., depending on the service being consumed, different quality of service is required in the access network, which is a Network Operator (NO) domain. In summary, there is an obvious network dependency. However, the network has been playing a relatively minor role, mostly as a provider of (best-effort) connectivity within the cloud and in the access network. The work developed in this Thesis enables for the effective integration of cloud and NO domains, allowing the required network support for cloud. We propose a framework and a set of associated mechanisms for the integrated management and control of cloud computing and NO domains to provide endto- end services. Moreover, we elaborate a thorough study on the embedding of virtual resources in this integrated environment. The study focuses on maximizing the host of virtual resources on the physical infrastructure through optimal embedding strategies (considering the initial allocation of resources as well as adaptations through time), while at the same time minimizing the costs associated to energy consumption, in single and multiple domains. Furthermore, we explore how the NO can take advantage of the integrated environment to host traditional network functions. In this sense, we study how virtual network Service Functions (SFs) should be modelled and managed in a cloud environment and enhance the framework accordingly. A thorough evaluation of the proposed solutions was performed in the scope of this Thesis, assessing their benefits. We implemented proof of concepts to prove the added value, feasibility and easy deployment characteristics of the proposed framework. Furthermore, the embedding strategies evaluation has been performed through simulation and Integer Linear Programming (ILP) solving tools, and it showed that it is possible to reduce the physical infrastructure energy consumption without jeopardizing the virtual resources acceptance. This fact can be further increased by allowing virtual resource adaptation through time. However, one should have in mind the costs associated to adaptation processes. The costs can be minimized, but the virtual resource acceptance can be also reduced. This tradeoff has also been subject of the work in this Thesis.<br>A proliferação do acesso à Internet permite aos utilizadores usar serviços disponibilizados diretamente através da Internet, o que se traduz numa mudança de paradigma na forma de usar aplicações e na forma de comunicar, popularizando desta forma o conceito denominado de cloud computing. Cloud computing traz consigo requisitos a dois níveis: ao nível da própria cloud, geralmente dependente de centros de dados centralizados, onde as tecnologias de informação e recursos de rede têm que ser capazes de garantir as exigências destes serviços; e ao nível do acesso, ou seja, dependendo do serviço que esteja a ser consumido, são necessários diferentes níveis de qualidade de serviço na rede de acesso, um domínio do operador de rede. Em síntese, existe uma clara dependência da cloud na rede. No entanto, o papel que a rede tem vindo a desempenhar neste âmbito é reduzido, sendo principalmente um fornecedor de conectividade (best-effort) tanto no dominio da cloud como no da rede de acesso. O trabalho desenvolvido nesta Tese permite uma integração efetiva dos domínios de cloud e operador de rede, dando assim à cloud o efetivo suporte da rede. Para tal, apresentamos uma plataforma e um conjunto de mecanismos associados para gestão e controlo integrado de domínios cloud computing e operador de rede por forma a fornecer serviços fim-a-fim. Além disso, elaboramos um estudo aprofundado sobre o mapeamento de recursos virtuais neste ambiente integrado. O estudo centra-se na maximização da incorporação de recursos virtuais na infraestrutura física por meio de estratégias de mapeamento ótimas (considerando a alocação inicial de recursos, bem como adaptações ao longo do tempo), enquanto que se minimizam os custos associados ao consumo de energia. Este estudo é feito para cenários de apenas um domínio e para cenários com múltiplos domínios. Além disso, exploramos como o operador de rede pode aproveitar o referido ambiente integrado para suportar funções de rede tradicionais. Neste sentido, estudamos como as funções de rede virtualizadas devem ser modeladas e geridas num ambiente cloud e estendemos a plataforma de acordo com este conceito. No âmbito desta Tese foi feita uma avaliação extensa das soluções propostas, avaliando os seus benefícios. Implementámos provas de conceito por forma a demonstrar as mais-valias, viabilidade e fácil implantação das soluções propostas. Além disso, a avaliação das estratégias de mapeamento foi realizada através de ferramentas de simulação e de programação linear inteira, mostrando que é possível reduzir o consumo de energia da infraestrutura física, sem comprometer a aceitação de recursos virtuais. Este aspeto pode ser melhorado através da adaptação de recursos virtuais ao longo do tempo. No entanto, deve-se ter em mente os custos associados aos processos de adaptação. Os custos podem ser minimizados, mas isso implica uma redução na aceitação de recursos virtuais. Esta compensação foi também um tema abordado nesta Tese.

A datacenter hosts hundreds of thousands of servers and a huge amount of bandwidth is required to accommodate communication between thousands of servers. Several packet switched based datacenter architectures are proposed to cater the high bandwidth requirement using multilayer network topologies, however at the cost of increased network complexity and high power consumption. In recent years, the focus has shifted from packet switching to optical circuit switching to build the data center networks as it can support on demand connectivity and high bit rates with low power consumption. On the other hand, with the advent of Software Defined Networking (SDN) and Network Function Virtualization (NFV), the role of datacenters has become more crucial. It has increased the need of dynamicity and flexibility within a datacenter adding more complexity to datacenter networking. With NFV, service chaining can be achieved in a datacenter where virtualized network functions (VNFs) running on commodity servers in a datacenter are instantiated/terminated dynamically. A datacenter also needs to cater large capacity requirement as service chaining involves steering of large aggregated flows. Use of optical circuit switching in data center networks is quite promising to meet such dynamic and high capacity traffic requirements. In this thesis work, a novel and modular optical data center network (DCN) architecture that uses multi-directional wavelength switches (MD-WSS) is introduced. VNF service chaining use case is considered for evaluation of this DCN and the end-to-end service chaining problem is formulated as three inter-connected sub-problems: multiplexing of VNF service chains, VNFs placement in the datacenter and routing and wavelength assignment. This thesis presents integer linear programming (ILP) formulation and heuristics for solving these problems, and numerically evaluate them.<br>Ett datacenter inrymmer hundratusentals servrar och en stor mängd bandbredd krävs för att skicka data mellan tusentals servrar. Flera datacenter baserade på paketförmedlande arkitekturer föreslås för att tillgodose kravet på hög bandbredd med hjälp av flerskiktsnätverkstopologier, men på bekostnad av ökad komplexitet i nätverken och hög energiförbrukning. Under de senaste åren har fokus skiftat från paketförmedling till optisk kretsomkoppling for att bygga datacenternätverk som kan stödja på-begäran-anslutningar och höga bithastigheter med låg strömförbrukning. Å andra sidan, med tillkomsten av Software Defined Networking (SDN) och nätverksfunktionen Virtualisering (NFV), har betydelsen av datacenter blivit mer avgörande. Det har ökat behovet av dynamik och flexibilitet inom ett datacenter, vilket leder till storre komplexitet i datacenternätverken. Med NFV kan tjänstekedjor åstadkommas i ett datacenter, där virtualiserade nätverksfunktioner (VNFs) som körs på servrar i ett datacenter kan instansieras och avslutas dynamiskt. Ett datacenter måste också tillgodose kravet på stor kapacitet eftersom tjänstekedjan innebär styrning av stora aggregerade flöden. Användningen av optisk kretsomkoppling i datacenternätverk ser ganska lovande ut for att uppfylla sådana trafikkrav dynamik och hög kapacitet. I detta examensarbete, har en ny och modulär optisk datacenternätverksarkitektur (DCN) som använder flerriktningvåglängdsswitchar (MD-WSS) införs. Ett användningsfall av VNF-tjänstekedjor noga övervägd för utvärdering av denna DCN och end-to-end-servicekedjans problem formuleras som tre sammankopplade delproblem: multiplexering av VNF-servicekedjor, VNF placering i datacentret och routing och våglängd uppdrag. Denna avhandling presenterar heltalsprogrammering (ILP) formulering och heuristik för att lösa dessa problem och numeriskt utvärdera dem.