Dissertations / Theses: 'Network Function Virtualization (NFV)'

1

Cho, Daewoong. "Network Function Virtualization (NFV) Resource Management For Low Network Latency." Thesis, The University of Sydney, 2017. http://hdl.handle.net/2123/17256.

Full text

Abstract:

NFV is an emerging network architecture to increase flexibility and agility within operator's networks by placing virtualized services on demand in Cloud data centers (CDCs). One of the main challenges for the NFV environment is how to efficiently allocate Virtual Network Functions (VNFs) to Virtual Machines (VMs) and how to minimize network latency in the rapidly changing network environments. Although a significant amount of work/research has been already conducted for the generic VNF placement problem and VM migration for efficient resource management in CDCs, network latency among various network components and VNF migration problem have not been comprehensively considered yet to the best of our knowledge. Firstly, to address VNF placement problem, we design a more comprehensive model based on real measurements to capture network latency among VNFs with more granularity to optimize placement of VNFs in CDCs. We consider resource demand of VNFs, resource capacity of VMs and network latency among various network components. Our objectives are to minimize both network latency and lead time (the time to find a VM to host a VNF). Experimental results are promising and indicate that our approach, namely VNF Low-Latency Placement (VNF-LLP), can reduce network latency by up to 64.24% compared with two generic algorithms. Furthermore, it has a lower lead time as compared with the VNF Best-Fit Placement algorithm. Secondly, to address VNF migration problem, we i) formulate the VNF migration problem and ii) develop a novel VNF migration algorithm called VNF Real-time Migration (VNF-RM) for lower network latency in dynamically changing resource availability. As a result of experiments, the effectiveness of our algorithm is demonstrated by reducing network latency by up to 59.45% after latency-aware VNF migrations.

APA, Harvard, Vancouver, ISO, and other styles

2

Gao, Meihui. "Models and Methods for Network Function Virtualization (NFV) Architectures." Thesis, Université de Lorraine, 2019. http://www.theses.fr/2019LORR0025/document.

Full text

Abstract:

Avec la croissance exponentielle des demandes de service, les opérateurs ont déployé de nombreux équipements, et par conséquent, la gestion du réseau est devenue de plus en plus difficile et coûteuse. La virtualisation des fonctions réseau (NFV) a été proposée comme un nouveau paradigme pour réduire les coûts liés à l’acquisition et à la maintenance pour les réseaux de télécommunications. Dans ce travail de thèse, nous nous intéressons aux problèmes du chaînage des fonctions virtuelles (VNFs) qui combinent des décisions de localisation des VNFs et de routage des demandes. D'un point de vue d'optimisation, ce problème est une combinaison des problèmes de localisation (pour la partie d'installation des VNFs) et de conception de réseaux (pour la partie de routage). Ces deux problèmes ont été largement étudié dans la littérature. Cependant, leur combinaison représente des divers challenges en termes de modélisation et de résolution. Dans la première partie de cette thèse, nous considérons une version réaliste du problème du chaînage des VNFs (VNF-PR) afin de comprendre l'impact des différents aspects sur les coûts et les performances de gestion du réseau. Dans ce but, nous étendons le travail dans~\cite{Addis2015} en considérant des caractéristiques et des contraintes plus réalistes des infrastructures NFV et nous proposons un modèle de programmation linéaire et une heuristique mathématique pour le résoudre. Dans le but de mieux comprendre la structure du problème et ses propriétés, la deuxième partie de la thèse est orientée vers l'étude théorique du problème, où nous avons étudié une version compacte du problème du chaînage des VNFs. Nous fournissons des résultats sur la complexité de calcul sous divers cas de topologie et de capacité. Ensuite, nous proposons deux modèles et nous les testons sur un testbed avec plus de 100 instances différentes avec différents cas de capacité. Au final, nous abordons la scalabilité du problème en proposant des méthodes constructives et des méthodes heuristiques basées sur la programmation linéaire entière pour traiter efficacement des instances de taille grande (jusqu'à 60 nœuds et 1800 demandes). Nous montrons que les heuristiques proposées sont capables de résoudre efficacement des instances de taille moyenne (avec jusqu'à 30 nœuds et 1 000 demandes) de cas de capacité difficiles et de trouver de bonnes solutions pour les instances dures, où le modèle ne peut fournir aucune solution avec un temps de calcul limité
Due to the exponential growth of service demands, telecommunication networks are populated with a large and increasing variety of proprietary hardware appliances, and this leads to an increase in the cost and the complexity of the network management. To overcome this issue, the NFV paradigm is proposed, which allows dynamically allocating the Virtual Network Functions (VNFs) and therefore obtaining flexible network services provision, thus reducing the capital and operating costs. In this thesis, we focus on the VNF Placement and Routing (VNF-PR) problem, which aims to find the location of the VNFs to allocate optimally resources to serve the demands. From an optimization point of view, the problem can be modeled as the combination of a facility location problem (for the VNF location and server dimensioning) and a network design problem (for the demands routing). Both problems are widely studied in the literature, but their combination represents, to the best of our knowledge, a new challenge. We start working on a realistic VNF-PR problem to understand the impact of different policies on the overall network management cost and performance. To this end, we extend the work in [1] by considering more realistic features and constraints of NFV infrastructures and we propose a linear programming model and a math-heuristic to solve it. In order to better understand the problem structure and its properties, in the second part of our work, we focus on the theoretical study of the problem by extracting a simplified, yet significant variant. We provide results on the computational complexity under different graph topology and capacity cases. Then, we propose two mathematical programming formulations and we test them on a common testbed with more than 100 different test instances under different capacity settings. Finally, we address the scalability issue by proposing ILP-based constructive methods and heuristics to efficiently deal with large size instances (with up to 60 nodes and 1800 demands). We show that our proposed heuristics can efficiently solve medium size instances (with up to 30 nodes and 1000 demands) of challenging capacity cases and provide feasible solutions for large size instances of the most difficult capacity cases, for which the models cannot find any solution even with a significant computational time

APA, Harvard, Vancouver, ISO, and other styles

3

Gao, Meihui. "Models and Methods for Network Function Virtualization (NFV) Architectures." Electronic Thesis or Diss., Université de Lorraine, 2019. http://www.theses.fr/2019LORR0025.

Full text

Abstract:

Avec la croissance exponentielle des demandes de service, les opérateurs ont déployé de nombreux équipements, et par conséquent, la gestion du réseau est devenue de plus en plus difficile et coûteuse. La virtualisation des fonctions réseau (NFV) a été proposée comme un nouveau paradigme pour réduire les coûts liés à l’acquisition et à la maintenance pour les réseaux de télécommunications. Dans ce travail de thèse, nous nous intéressons aux problèmes du chaînage des fonctions virtuelles (VNFs) qui combinent des décisions de localisation des VNFs et de routage des demandes. D'un point de vue d'optimisation, ce problème est une combinaison des problèmes de localisation (pour la partie d'installation des VNFs) et de conception de réseaux (pour la partie de routage). Ces deux problèmes ont été largement étudié dans la littérature. Cependant, leur combinaison représente des divers challenges en termes de modélisation et de résolution. Dans la première partie de cette thèse, nous considérons une version réaliste du problème du chaînage des VNFs (VNF-PR) afin de comprendre l'impact des différents aspects sur les coûts et les performances de gestion du réseau. Dans ce but, nous étendons le travail dans~\cite{Addis2015} en considérant des caractéristiques et des contraintes plus réalistes des infrastructures NFV et nous proposons un modèle de programmation linéaire et une heuristique mathématique pour le résoudre. Dans le but de mieux comprendre la structure du problème et ses propriétés, la deuxième partie de la thèse est orientée vers l'étude théorique du problème, où nous avons étudié une version compacte du problème du chaînage des VNFs. Nous fournissons des résultats sur la complexité de calcul sous divers cas de topologie et de capacité. Ensuite, nous proposons deux modèles et nous les testons sur un testbed avec plus de 100 instances différentes avec différents cas de capacité. Au final, nous abordons la scalabilité du problème en proposant des méthodes constructives et des méthodes heuristiques basées sur la programmation linéaire entière pour traiter efficacement des instances de taille grande (jusqu'à 60 nœuds et 1800 demandes). Nous montrons que les heuristiques proposées sont capables de résoudre efficacement des instances de taille moyenne (avec jusqu'à 30 nœuds et 1 000 demandes) de cas de capacité difficiles et de trouver de bonnes solutions pour les instances dures, où le modèle ne peut fournir aucune solution avec un temps de calcul limité
Due to the exponential growth of service demands, telecommunication networks are populated with a large and increasing variety of proprietary hardware appliances, and this leads to an increase in the cost and the complexity of the network management. To overcome this issue, the NFV paradigm is proposed, which allows dynamically allocating the Virtual Network Functions (VNFs) and therefore obtaining flexible network services provision, thus reducing the capital and operating costs. In this thesis, we focus on the VNF Placement and Routing (VNF-PR) problem, which aims to find the location of the VNFs to allocate optimally resources to serve the demands. From an optimization point of view, the problem can be modeled as the combination of a facility location problem (for the VNF location and server dimensioning) and a network design problem (for the demands routing). Both problems are widely studied in the literature, but their combination represents, to the best of our knowledge, a new challenge. We start working on a realistic VNF-PR problem to understand the impact of different policies on the overall network management cost and performance. To this end, we extend the work in [1] by considering more realistic features and constraints of NFV infrastructures and we propose a linear programming model and a math-heuristic to solve it. In order to better understand the problem structure and its properties, in the second part of our work, we focus on the theoretical study of the problem by extracting a simplified, yet significant variant. We provide results on the computational complexity under different graph topology and capacity cases. Then, we propose two mathematical programming formulations and we test them on a common testbed with more than 100 different test instances under different capacity settings. Finally, we address the scalability issue by proposing ILP-based constructive methods and heuristics to efficiently deal with large size instances (with up to 60 nodes and 1800 demands). We show that our proposed heuristics can efficiently solve medium size instances (with up to 30 nodes and 1000 demands) of challenging capacity cases and provide feasible solutions for large size instances of the most difficult capacity cases, for which the models cannot find any solution even with a significant computational time

APA, Harvard, Vancouver, ISO, and other styles

4

Sällberg, Kristian. "A Data Model Driven Approach to Managing Network Functions Virtualization : Aiding Network Operators in Provisioning and Configuring Network Functions." Thesis, KTH, Radio Systems Laboratory (RS Lab), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-171233.

Full text

Abstract:

This master’s thesis explains why certain network services are difficult to provision and configure using IT automation and cloud orchestration software. An improvement is proposed and motivated. This proposed improvement enables network operators to define a set of data models describing how to provision and interconnect a set of Virtual Network Functions (VNFs) (and possibly existing physical network functions) to form networks. Moreover, the proposed solution enables network operators to change the configuration at runtime. The work can be seen as a step towards self managing and auto scaling networks. The proposed approach is compared to a well known cloud management system (OpenStack) in order to evaluate if the proposed approach decreases the amount of time needed for network operators to design network topologies and services containing VNFs. Data is collected through observations of network operators, interviews, and experiment. Analysis of this data shows that the proposed approach can decrease the amount of time required for network operators to design network topologies and services. This applies if the network operators are already acquainted with the data modeling language YANG. The amount of time required to provision VNFs so that they respond to connections can also be decreased using the proposed approach. The proposed approach does not offer as much functionality as OpenStack, as it is limited to VNF scenarios.
Denna masteruppsats förklarar varför vissa nätverkstjänster är svåra att skapa och konfigurera med IT-automationsverktyg och mjukvara för molnorkestrering. En förbättring föreslås och motiveras. Den föreslagna förbättringen tillåter nätverksoperatörer att definiera en mängd datamodeller, för att beskriva hur Virtuella Nätverksfunktioner (VNF:er) skall instantieras och kopplas ihop till nätverkstjänster. Dessutom tillåter lösningen nätverksoperatörer att ändra konfiguration under tiden nätverken hanterar trafik. Arbetet kan ses som ett steg mot självhanterande och automatiskt skalande nätverk. Den föreslagna lösningen jämförs med ett välkänt molnorkestreringsverktyg (OpenStack) för att utvärdera om den föreslagna lösningen sänker mängden tid som nätverksoperatörer behöver för att designa nätverkstopologier och tjänster som innehåller VNF:er. Data samlas in genom observationer av nätverksoperatörer, intervjuer, och experiment. Analys av datan visar att den föreslagna lösningen kan minska tiden som behövs för att designa nätverkstopologier och tjänster. Fallen där detta är applicerbart, är när VNF:er närvarar i nätverk. Dessa är enklare att skapa, konfigurera, och ändra under tiden de exekverar, med den föreslagna metoden. Detta kräver också att nätverksoperatören är bekant med datamodelleringsspråket YANG. Tiden det tar att provisionera VNF:er, tills dess att de svarar till anslutningar, kan sänkas med hjälp av den föreslagna metoden. Den förslagna metoden erbjuder väsentligt begränsad funktionalitet jämfört med OpenStack, den fokuserar på att hantera VNF:er.

APA, Harvard, Vancouver, ISO, and other styles

5

Cilloni, Marco. "Design and Implementation of an ETSI Network Function Virtualization-compliant Container Orchestrator." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2017. http://amslaurea.unibo.it/13373/.

Full text

Abstract:

La Network Function Virtualisation (NFV) è la principale forza dietro la migrazione delle infrastrutture dei provider di reti verso sistemi distribuiti cloud, fornendo un innovativo approccio al design di architetture di reti di telecomunicazioni che permette un completo disaccoppiamento dei servizi offerti dalla rete dai dispositivi fisici e gli apparati su cui essi risiedono attraverso la loro completa virtualizzazione. L’uso di VNF, blocchi logici in grado di rappresentare le funzionalità e i servizi forniti dall’infrastruttura come elementi virtuali, permette alle Network Functions di essere agevolmente rilocate in data centers prossimi agli utenti finali dei servizi che offrono, evitando i pesanti costi in personale ed apparecchiature coinvolti nel caso dei dispositivi fisici. ETSI NFV fornisce linee guida ed architetture volte al supportare l’amministrazione ed orchestrazione (MANO) di apparati virtualizzati, sfruttando le infrastrutture fornite da Virtual Infrastructure Managers (VIM). Questa tesi ha affrontato le modalità con cui un framework NFV esistente, come Open Baton, possa essere esteso per sfruttare appieno le capacità fornite da sistemi di containerizzazione come Docker, realizzando i componenti e concetti necessari per offrire una infrastruttura NFV (NFVI) altamente scalabile e cloud-ready. Il prototipo di VIM basato su Docker e i relativi componenti MANO sviluppati durante questa tesi sono stati pensati per essere il più possibile indipendenti fra loro, per mantenere il sistema riusabile ed aperto ad estensioni future. L’analisi compiuta sulla soluzione per l’orchestrazione di container NFV basata su Docker creata durante lo step implementativo della tesi ha mostrato risultati molto positivi riguardo l’overhead sull’utilizzo di risorse di memoria e di storage da parte delle istanze di VNF basate su container.

APA, Harvard, Vancouver, ISO, and other styles

6

Miotto, Gustavo. "NFV-PEAR : posicionamento e encadeamento adaptativo de funções virtuais de rede." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2018. http://hdl.handle.net/10183/178675.

Full text

Abstract:

O projeto de mecanismos flexíveis e eficientes para o posicionamento e encadeamento de funções virtualizadas de rede (VNFs) é essencial para o sucesso de Virtualização de Funções de Rede (Network Function Virtualization, NFV). A maioria das soluções existentes, no entanto, considera custos fixos (e imutáveis) de processamento de fluxos e de largura de banda ao posicionar as VNFs em Pontos de Presença da Rede (N-PoPs). Essa limitação torna-se crítica em redes NFV com fluxos cujos comportamentos são altamente dinâmicos e nas quais os requisitos de processamento e os recursos disponíveis nos NPoPs mudam constantemente. Para preencher essa lacuna, propõe-se o NFV-PEAR, uma plataforma para o posicionamento e encadeamento adaptativo de VNFs. O NFV-PEAR visa (re)organizar periodicamente os posicionamentos e encadeamentos de VNFs previamente determinados, objetivando-se manter um desempenho fim-a-fim aceitável mesmo durante flutuações nos custos de processamento e nos requisitos dos fluxos. Paralelamente, busca-se minimizar as mudanças na rede (por exemplo, a realocação de VNFs ou de fluxos) realizadas para cumprir esse objetivo. Os resultados obtidos, a partir de uma avaliação experimental, mostram que o NFV-PEAR tem potencial para reduzir significativamente o número de mudanças na rede necessárias para assegurar o desempenho fim-a-fim esperado para os fluxos, garantindo assim o funcionamento estável dos serviços.
The design of flexible and efficient mechanisms for proper placement and chaining of virtual network functions (VNFs) is key for the success of Network Function Virtualization (NFV). Most state-of-the-art solutions, however, consider fixed (and immutable) flow processing and bandwidth requirements when placing VNFs in the Network Points of Presence (N-PoPs). This limitation becomes critical in NFV-enabled networks having highly dynamic flow behavior, and in which flow processing requirements and available N-PoP resources change constantly. To bridge this gap, we present NFV-PEAR, a platform for adaptive VNF placement and chaining. In NFV-PEAR, network operators may periodically (re)arrange previously determined placement and chaining of VNFs, with the goal of maintaining acceptable end-to-end flow performance despite fluctuations of flow processing costs and requirements. In parallel, NFV-PEAR seeks to minimize network changes (e.g., reallocation of VNFs or network flows). The results obtained from an experimental evaluation provide evidence that NFV-PEAR has potential to deliver more stable operation of network services, while significantly reducing the number of network changes required to ensure end-to-end flow performance.

APA, Harvard, Vancouver, ISO, and other styles

7

Car, Mario. "OpenStack service function chaining interface." Master's thesis, Universidade de Aveiro, 2015. http://hdl.handle.net/10773/18737.

Full text

Abstract:

Mestrado em Engenharia Eletrónica e Telecomunicações
OpenStack is a free and open-source cloud computing software platform. It is seen as a major technology enabler for the future of telecommunications. OpenStack eases the creation of virtualization environments, and is seen as a major technology for the development of network function virtualization (NFV). Currently, OpenStack is developing the use cases and the code for service function virtualization, but the higher layer management aspects are not being considered. This dissertation will address this challenge, and will work on the creation of an interface for a simple usage of the NFV functions, enabling the network manager to build services by concatenation of graphical elements. The Application Programming Interfaces that are currently being developed will be analyzed and a simple web interface to explore theirs potentialities will be created.
O OpenStack é uma plataforma livre e open-source de cloud computing. É visto como uma importante tecnologia no futuro das telecomunicações. O OpenStack facilita a criação de ambientes de virtualização e é visto como uma grande tecnologia para o desenvolvimento da virtualização de funções de rede (NFV). Atualmente, a fundacão OpenStack está a desenvolver os casos de uso e o código para a virtualização funções de serviço, mas os aspectos das camadas mais elevadas de gestão não estão a ser considerados. Esta dissertação vai enfrentar este desafio, e vai trabalhar na criação de uma interface para um uso simples do NFV, permitindo que o operador de rede construa serviços por concatenação de elementos gráficos. As interfaces de programação de aplicações que estão actualmente a ser desenvolvidas serão analisadas e uma interface web simples para explorar potencialidades das mesmas será criada.

APA, Harvard, Vancouver, ISO, and other styles

8

Franco, Muriel Figueredo. "Interactive visualizations for management of NFV-enabled networks." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2017. http://hdl.handle.net/10183/158202.

Full text

Abstract:

A Virtualização de Funções de Rede (Network Functions Virtualization - NFV) está mudando o paradigma das redes de telecomunicações. Esta nova tecnologia permite diversas oportunidades de inovações e possibilita o desenvolvimento de novos modelos de negócio. Em relação às redes NFV, os provedores de serviços têm a oportunidade de criar modelos de negócio que permitam aos clientes contratarem Funções de Rede Virtualizadas (Virtual Network Functions - VNFs) que proveem diferentes serviços de rede (e.g., Firewall, NAT e transcoders). Porém, nestes modelos, a quantidade de informações a serem gerenciadas cresce rapidamente. Baseado nisso, os operadores de rede devem ser capazes de entender e manipular uma grande quantidade de informação para gerenciar, de forma efetiva, as redes NFV. Para enfrentar esse problema, introduzimos uma plataforma de visualização denominada VISION, a qual tem como principal objetivo ajudar os operadores de rede na identificação da causa raiz de problemas em NFV. Para isso, propusemos: (i) uma abordagem para coleta e organização de dados do ambiente NFV gerenciado; (ii) cinco diferentes visualizações que auxiliam nas tarefas de gerenciamento de NFV como, por exemplo, no processo de identificação de problemas em VNFs e no planejamento de negócios e (iii) um modelo baseado em templates que suporta o desenvolvimento e o reuso de visualizações. Para fins de avaliação desta dissertação, foi desenvolvido um protótipo da plataforma VISION e de todas as visualizações propostas. Após, conduzimos um conjunto de casos de estudo para prover evidências sobre a viabilidade e utilidade de nossas visualizações. Os diferentes casos analisados, abordam por exemplo, a identificação de problemas na alocação de VNFs que estão impactando no desempenho do serviço oferecido e também na investigação de prioridades de investimento para suprir as demandas dos clientes da rede. Por fim, apresentamos uma avaliação de usabilidade realizada juntamente a especialistas em redes de computadores para avaliar os recursos e benefícios da plataforma VISION. Os resultados obtidos demonstram que nossas visualizações possibilitam ao operador de rede um rápido e fácil acesso às informações importantes para o gerenciamento de redes NFV, assim facilitando a obtenção de insights para a identificação de problemas complexos no contexto de redes NFV. Além disso, os resultados demonstram uma avaliação positiva por especialistas sobre os aspectos gerais de usabilidade do protótipo desenvolvido.
Network Functions Virtualization (NFV) is driving a paradigm shift in telecommunications networks and computer networks, by fostering new business models and creating innovation opportunities. In NFV-enabled networks, service providers have the opportunity to build a business model where tenants can purchase Virtual Network Functions (VNFs) that provide distinct network services and functions (e.g., Firewall, NAT, and transcoders). However, the amount of managed data grows in a fast pace. The network operator must understand and manipulate many data to effectively manage the network. To tackle this problem, we introduce VISION, a platform based on visualizations techniques to help network operators to determine the cause of not obvious problems. For this, we provide: (i) an approach to collect and organize data from the NFV environments; (ii) five distinct visualizations that can aid in NFV management tasks, such as in the process of identifying VNFs problems and planning of NFV-enabled businesses; and (iii) a template model that supports new visualization applications. To evaluate our work, we implemented a prototype of VISION platform and each of the proposed visualizations. We then conducted distinct case studies to provide evidence of the feasibility of our visualizations. These case studies cover different scenarios, such as the identification of misplacement of VNFs that are generating bottlenecks in a forwarding graph and the investigation of investment priorities to supply tenants demands. Finally, we present a usability evaluation with network operators to indicate the benefits of the VISION platform. The results obtained show that our visualizations allow the operator to access relevant information and have insights to identify not obvious problems in the context of NFV-enabled networks. In addition, we received positive feedback about general usability aspects related to our prototype.

APA, Harvard, Vancouver, ISO, and other styles

9

Aimi, Leonardo. "Orchestrazione di Risorse Distribuite in Scenari Network Function Virtualization e Software Defined Networking Integrati." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2018.

Find full text

Abstract:

Software-defined Networking (SDN) e Network Function Virtualization (NFV) sono due modelli che negli ultimi anni hanno contribuito a rivoluzionare il modo con cui gli operatori di rete organizzano le proprie architetture. SDN propone una separazione del livello di controllo da quello architetturale avvalendosi di protocolli aperti e standard, come OpenFlow, per permettere la comunicazione tra i dispositivi di rete, privati di logica e intelligenza, con un controller di più alto livello, arricchito di funzionalità e con una visione globale della topologia di rete. NFV si basa sul concetto di virtualizzazione permettendo un completo disaccoppiamento tra i servizi di rete offerti da un operatore ed i dispositivi hardware su cui questi vengono installati ed eseguiti. L'obiettivo di questa tesi è quello di delineare un modello di integrazione tra SDN e NFV per l'orchestrazione di risorse di rete distribuite. Si vuole così creare un testbed architetturale mediante software open source come ONOS e Mininet tenendo in considerazione i limiti ed i requisiti di SDN e NFV all'interno di uno scenario di rete simulato.

APA, Harvard, Vancouver, ISO, and other styles

10

AVINO, GIUSEPPE. "Development and Performance Evaluation of Network Function Virtualization Services in 5G Multi-Access Edge Computing." Doctoral thesis, Politecnico di Torino, 2021. http://hdl.handle.net/11583/2875737.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Kolluri, Saiphani Krishna Priyanka Kolluri. "APPLYING LEAN PRINCIPLES FOR PERFORMANCE ORIENTED SERVICE DESIGN OF VIRTUAL NETWORK FUNCTIONS FOR NFV INFRASTRUCTURE : Roles and Relationships." Thesis, Blekinge Tekniska Högskola, Institutionen för kommunikationssystem, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-13357.

Full text

Abstract:

Context. Network Function Virtualization was recently proposed by European Telecommunications Standards Institute (ETSI) to improve the network service flexibility by virtualization of network services and applications that run on hardware. To virtualize network functions, the software is decoupled from underlying physical hardware. NFV aims to transform industries by reducing capital investments on hardware by using commercial-of-the-shelf (COTS) hardware. NFV makes rapid innovative growth in telecom services through software based service deployment. Objectives. This thesis work aims to investigate how business organizations function and the roles in defining a service relationship model. The work also aims to define a service relationship model and to validate it via proof of concept using network function virtualization as a service. For this thesis, we finally apply lean principles for the defined service relationship model to reduce waste and investigate how lean benefits the model to be proven as performance service oriented. Methods. The essence of this work is to make a business organization lean by investigating its actions and applying lean principles. To elaborate, this thesis work involves in a research of papers from IEEE, TMF, IETF and Ericsson. It results in modelling of a PoC by following requirement analysis methodology and by applying lean principles to eliminate unnecessary processes which doesn’t add any value. Results. The results of the work include a full-fledged service relationship model that include three service levels with roles that can fit in to requirement specifications of NFV infrastructure. The results also show the service levels functionalities and their relationships between the roles. It has also been observed that the services that are needed to be standardized are defined with syntax for ways to describe network functions. It is observed that lean principles benefit the service relationship model from reducing waste factors and hereby providing a PoC which is performance service oriented. Conclusions. We conclude that roles defined are fit for the service relationship model designed. Moreover, we conclude that the model can hence contain the flow of service by standardizing the subservices and reducing waste interpreted with lean principles and there is a need for further use case proof of the model in full scale industry trials. It also concludes the ways to describe network functions syntax which follows lean principles that are essential to have them for the sub-services standardization. However, PoC defined can be an assurance to the NFV infrastructure.

APA, Harvard, Vancouver, ISO, and other styles

12

Adapa, Sasank Sai Sujan. "APPLYING LEAN PRINCIPLES FOR PERFORMANCE ORIENTED SERVICE DESIGN OF VIRTUAL NETWORK FUNCTIONS FOR NFV INFRASTRUCTURE : Concepts of Lean." Thesis, Blekinge Tekniska Högskola, Institutionen för kommunikationssystem, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-13358.

Full text

Abstract:

Context. Network Function Virtualization was recently proposed by European Telecommunications Standards Institute (ETSI) to improve the network service flexibility by virtualization of network services and applications that run on hardware. To virtualize network functions, the software is decoupled from underlying physical hardware. NFV aims to transform industries by reducing capital investments on hardware by using commercial-of-the-shelf (COTS) hardware. NFV makes rapid innovative growth in telecom services through software based service deployment. Objectives. This thesis work aims to investigate how business organizations function and the roles in defining a service relationship model. The work also aims to define a service relationship model and to validate it via proof of concept using network function virtualization as a service. For this thesis, we finally apply lean principles for the defined service relationship model to reduce waste and investigate how lean benefits the model to be proven as performance service oriented. Methods. The essence of this work is to make a business organization lean by investigating its actions and applying lean principles. To elaborate, this thesis work involves in a research of papers from IEEE, TMF, IETF and Ericsson. It results in modelling of a PoC by following requirement analysis methodology and by applying lean principles to eliminate unnecessary processes which doesn’t add any value. Results. The results of the work include a full-fledged service relationship model that include three service levels with roles that can fit in to requirement specifications of NFV infrastructure. The results also show the service levels functionalities and their relationships between the roles. It has also been observed that the services that are needed to be standardized are defined with syntax for ways to describe network functions. It is observed that lean principles benefit the service relationship model from reducing waste factors and hereby providing a PoC which is performance service oriented. Conclusions. We conclude that roles defined are fit for the service relationship model designed. Moreover, we conclude that the model can hence contain the flow of service by standardizing the subservices and reducing waste interpreted with lean principles and there is a need for further use case proof of the model in full scale industry trials. It also concludes the ways to describe network functions syntax which follows lean principles that are essential to have them for the sub-services standardization. However, PoC defined can be an assurance to the NFV infrastructure.

APA, Harvard, Vancouver, ISO, and other styles

13

Zhao, Yimeng. "Déploiement du switch logiciel dans SDN-enabled Réseau environnement de virtualisation." Electronic Thesis or Diss., Paris, ENST, 2016. http://www.theses.fr/2016ENST0029.

Full text

Abstract:

Avec la prévalence de logicielisation, virtualisation est devenue une technologie dominante dans des data-centres et clouds. Deux aspects principaux de la logicielisation de réseaux sont Software Defined Network (SDN) et Network Function Virtualization (NFV), dont un des outils essentiel sont les switches logiciels, à l’opposition des switches matériaux. Les switches logiciels sont également indispensables pour le succès de NFV. Cette thèse vise à relever des défis principaux dans la logicielisation de réseaux. Spécifiquement, elle porte sur le déploiement des switches logiciels dans un réseau virtuel avec SDN
Due to the growing trend of “Softwarization”, virtualization is becoming the dominating technology in data center and cloud environment. Software Defined Network (SDN) and Network Function Virtualization (NFV) are different expressions of “Network Softwarization”. Software switch is exactly the suitable and powerful tool to support network softwarization, which is also indispensable to the success of network virtualization. Regarding the challenges and opportunities in network softwarization, this thesis aims to investigate the deployment of software switch in a SDN-enabled network virtualization environment

APA, Harvard, Vancouver, ISO, and other styles

14

Tomassilli, Andrea. "Vers les réseaux de nouvelle génération avec SDN et NFV." Thesis, Université Côte d'Azur (ComUE), 2019. http://www.theses.fr/2019AZUR4044.

Full text

Abstract:

Les progrès récents dans le domaine des réseaux, tels que les réseaux logiciel (SDN) et la virtualisation des fonctions réseaux (NFV), modifient la façon dont les opérateurs de réseaux déploient et gèrent les services Internet. D'une part, SDN introduit un contrôleur logiquement centralisé avec une vue globale de l'état du réseau. D'autre part, NFV permet le découplage complet des fonctions réseaux des appareils propriétaires et les exécute en tant qu'applications logicielles sur des serveurs génériques. De cette façon, les opérateurs de réseaux peuvent déployer dynamiquement des fonctions réseaux virtuelles (VNF). SDN et NFV, tous deux séparément, offrent aux opérateurs de nouvelles opportunités pour réduire les coûts, améliorer la flexibilité et le passage à l'échelle des réseaux et réduire les délais de mise sur le marché des nouveaux services et applications. De plus, le modèle de routage centralisé du SDN, associé à la possibilité d'instancier les VNF à la demande, peut ouvrir la voie à une gestion encore plus efficace des ressources réseaux. Par exemple, un réseau SDN/NFV peut simplifier le déploiement des chaînes de fonctions de services (SFC) en rendant le processus plus facile et moins coûteux. Dans cette thèse, notre objectif était d'examiner comment tirer parti des avantages potentiels de combiner SDN et NFV. En particulier, nous avons étudié les nouvelles possibilités offertes en matière de conception de réseau, de résilience et d'économies d'énergie, ainsi que les nouveaux problèmes qui surgissent dans ce nouveau contexte, comme l'emplacement optimal des fonctions réseaux. Nous montrons qu'une symbiose entre le SDN et le NFV peut améliorer la performance des réseaux et réduire considérablement les dépenses d'investissement (CapEx) et les dépenses opérationnelles (OpEx) du réseau
Recent advances in networks, such as Software Defined Networking (SDN) and Network Function Virtualization (NFV), are changing the way network operators deploy and manage Internet services. On one hand, SDN introduces a logically centralized controller with a global view of the network state. On the other hand, NFV enables the complete decoupling of network functions from proprietary appliances and runs them as software applications on general–purpose servers. In such a way, network operators can dynamically deploy Virtual Network Functions (VNFs). SDN and NFV benefit network operators by providing new opportunities for reducing costs, enhancing network flexibility and scalability, and shortening the time-to-market of new applications and services. Moreover, the centralized routing model of SDN jointly with the possibility of instantiating VNFs on–demand, may open the way for an even more efficient operation and resource management of networks. For instance, an SDN/NFV-enabled network may simplify the Service Function Chain (SFC) deployment and provisioning by making the process easier and cheaper. In this study, we aim at investigating how to leverage both SDN and NFV in order to exploit their potential benefits. We took steps to address the new opportunities offered in terms of network design, network resilience, and energy savings, and the new problems that arise in this new context, such as the optimal network function placement in the network. We show that a symbiosis between SDN and NFV can improve network performance and significantly reduce the network's Capital Expenditure (CapEx) and Operational Expenditure (OpEx)

APA, Harvard, Vancouver, ISO, and other styles

15

Nguyen, Thi Minh. "Optimisation de l'allocation des ressources dans les réseaux d'infrastructure basés sur la virtualisation des fonctions réseau." Thesis, Paris 6, 2017. http://www.theses.fr/2017PA066626/document.

Full text

Abstract:

Les prestataires de service réseau doivent faire face à la demande croissante des besoins des utilisateurs, en particulier vers une plus grande flexibilité et toujours plus de capacité. La "softwerisation" et la "cloudification" des composants du réseau offrent une solution prometteuse pour obtenir l'agilité nécessaire afin de répondre dynamiquement à l'exigence au niveau de la consommation des ressources. Cette vision se traduit par le déploiement de la Virtualisation des Fonctions Réseau (NFV) où les Fonctions de Réseau Virtuels (VNFs) peuvent être associées pour créer des services réseau. Cette thèse étudie la problématique de l'allocation de ressources dans un système NFV afin de minimiser son coût sous contraintes sur l'interconnectivité entre les VNF, les ressources du système et les exigences de service. La principale considération est la réduction du coût global du déploiement en ressources informatiques. Nous étudions également d'autres objectifs à satisfaire tels que la migration des fonctions réseau et la gestion de la congestion. Notre premier objectif est d'augmenter notre compréhension de la performance d'un système NFV en étudiant le placement et le routage des fonctions réseau. Nous formalisons le problème dans une approche globale en tenant compte d'un large ensemble de paramètres pertinents. Nous prendrons en compte les cas statiques (Hors Ligne) et dynamiques (En Ligne) du problème. Nous proposons et analysons trois algorithmes heuristiques: deux sont conçus pour traiter de grandes dimensions du scenario "Hors Ligne" et le dernier est conçu pour résoudre le scénario "En Ligne". Les résultats montrent que notre solution surpasse l'état de l'art par rapport à l'indicateur de performance critique. Nous évaluons également l'impact de la migration d'une série de demandes simultanées et proposons une technique de migration simple pour ce système dynamique. A la lumière de ces premiers résultats, nous étendons notre étude afin d'améliorer l'efficacité de notre solution en proposant un modèle plus simple. La seconde partie de notre étude se concentre sur l'optimisation de l'utilisation des ressources d'un système NFV. La principale distinction est que nous pouvons appliquer le modèle à un système dynamique avec de grandes instances. De plus, nous fournissons également une méthode originale pour engendrer de fortes inégalités afin d'améliorer la résolution de la programmation linéaire (LP) dans un espace de dimension supérieur. Les résultats obtenus n'améliorent pas seulement le modèle, mais promettent aussi de pouvoir être utiliser efficacement dans d'autres modèles. Une troisième contribution de notre travail concerne le problème de routage dans NFV. En effet, une évolution importante des besoins des utilisateurs est représentée par la demande d'accès croissante aux ressources réseau, de stockage et de calcul afin de combiner dynamiquement le niveau de consommation de ressources avec leurs besoins de service. Par conséquent, nous nous intéressons au routage efficace d'une demande utilisateur à travers les noeuds qui traitent les fonctions impliquées dans une chaîne de services donnée. Nous proposons une formulation originale de ce problème basée sur la construction d'un réseau étendu. Nous formulons une solution mathématique exacte et proposons plusieurs algorithmes approximatifs tenant compte les principaux paramètres du système. Nous conclurons en soulignant les contributions principales de notre travail et proposons quelques pistes pour des travaux futurs
Network service providers have to cope with the growing on-demand need from end-users as well as the diversity of usage. The "softwerization" and "loudification" of the network components offer a promising solution to achieve the agility necessary to dynamically match the servcice requirements with the level of resource consumption. Cloud-based solutions promises an economy of scale and simpler management. Virtualizing the many network appliances offers the flexibility to adapt to the varying service demand. This materializes with the deployment of Network Functions Virtualization (NFV) where Virtual Network Functions (VNFs) may be chained together to create network services. This dissertation studies the resource allocation problem in an NFV system for minimizing its cost under constraints on interconnectivity among VNFs, system resources, and service requirements. The main consideration is the reduction of the overall deployment cost while efficiently utilizing the available resources. In addition, a number of other important constraints are considered such as migration and congestion. Our first goal is to increase our understanding of the performance of an NFV system with respect to network functions placement and routing. We formalize the problem in a comprehensive maner taking into account a broad set of relevant parameters. The static (OFFLINE) and dynamic (ONLINE) cases are considered. We propose and analyze three heuristic algorithms: two for handling large dimensions of the OFFLINE problem and one designed to address the ONLINE scenario. The results show that our solution outperforms the state of the art with respect to critical performance index. We also evaluate the impact of migrating a set of running demands, and propose a simple migration technique for the dynamic system. We extend this work by proposing a simpler model to improve the performance of our solution. The second part of our work focuses on minimizing the resource utilization of an NFV system. The main distinctive point is that we can apply the model to a dynamic system with large instances. Moreover, we also provide an interesting method for generating some strong inequalities to improve the Linear Programming (LP) solving in a higher dimensional space. The obtained results are not only making the model easier but also can be used efficiently in other models. A third contribution focuses specifically on the routing problem in NFV. An important evolution of the users’ needs is represented by the dynamic on-demand access to network, vstorage and compute resources. Therefore, routing efficiently a demand across nodes handling the functions involved in a given service chain constitutes the a novel problem that we address in this last section. We provide an original formulation of this problem based on the construction of an expanded network. We derive the exact mathematical formulation and propose several approximate algorithms taking into account the main system’s parameters. We conclude by deriving some interesting insights both about the algorithms and the network performance. We finally conclude with our main findings and highlight many avenues for future work

APA, Harvard, Vancouver, ISO, and other styles

16

Salhab, Nazih. "Resource provisioning and dynamic optimization of Network Slices in an SDN/NFV environment." Thesis, Paris Est, 2020. http://www.theses.fr/2020PESC2019.

Full text

Abstract:

Pour offrir le haut débit mobile amélioré, les communications massives et critiques pour l'Internet des objets, la cinquième génération (5G) des réseaux mobiles est déployée à nos jours, en se basant sur plusieurs catalyseurs: le réseau d'accès radio nuagique (C-RAN), les réseaux programmables (SDN), et la virtualisation des fonctions réseaux (NFV). Le C-RAN décompose la nouvelle génération Node-B (gNB) en: i) tête radio distante (RRH), ii) unité digitale (DU), et iii) unité centrale (CU), appelée aussi unité cloud ou collaborative. Les DU et CU implémentent la base bande (BBU) tout en utilisant les huit options du split du front-haul pour une performance affinée. La RRH implémente la circuiterie extérieure pour la radio. Le SDN permet la programmation du comportement du réseau en découplant le plan de contrôle du plan utilisateur tout en centralisant la gestion des flux en un nœud de contrôle dédié. La NFV, d'autre part, utilise les technologies de virtualisation pour lancer les fonctions réseaux virtualisées (FRV) sur des serveurs conventionnels du marché. SDN et NFV permettent la partition du C-RAN, réseaux de transport et cœur en tant que tranches définies comme des réseaux virtuels et isolés de bout en bout conçus pour couvrir des exigences spécifiques aux différentes cas d’utilisations. L'objectif principal de cette thèse est de développer des algorithmes de provisionnement des ressources (unité de traitement centrale (CPU), mémoire, énergie, et spectre) pour la 5G, tout en garantissant un emplacement optimal des FRV dans une infrastructure nuagique. Pour achever ce but ultime, on adresse l'optimisation des ressources et d'infrastructure dans les trois domaines des réseaux mobiles: le cœur de réseau 5G (5GC), le C-RAN et les contrôleurs SDN. En tant qu’une première contribution, nous formulons la décharge du 5GC en tant qu'une optimisation sous contraintes ciblant plusieurs objectifs (coût de virtualisation, puissance de traitement, et charge du réseau) pour faire les décisions optimales et avec la plus faible latence. On optimise l'utilisation de l'infrastructure réseau en termes de capacité de traitement, consommation d'énergie et de débit, tout en respectant les exigences par tranche (latence, fiabilité, et capacité, etc.). Sachant que l'infrastructure est assujettie à des évènements fréquents tels que l'arrivée et le départ des utilisateurs/dispositifs, les changements continuels du réseau (reconfigurations, et défauts inévitables), nous proposons l'optimisation dynamique moyennant la technique de Branch, Cut and Price (BCP), en discutant les effets de ces objectifs sur plusieurs métriques. Notre 2ème contribution consiste à optimiser le C-RAN par un regroupement dynamique des RRH aux BBU (DU, CU). D’une part, nous proposons ce regroupement pour optimiser le débit en down-link. D’autre part, nous proposons la prédiction du power Head-room (PHR), sur le lien hertzien pour optimiser le débit en up-link. Dans notre troisième contribution, nous adressons l'orchestration des tranches réseaux 5G à travers le contrôleur C-RAN défini par logiciel en utilisant des approches de ML pour: la classification des exigences de performance, la prédiction des ratios de tranchage, le contrôle d'admission, le séquencement, et la gestion adaptative des ressources. En se basant sur des évaluations exhaustives moyennant notre prototype 5G basé sur OpenAirInterface, et en utilisant une pile de performance intégrée, nous montrons que nos propositions dépassent les stratégies connexes en termes de rapidité d'optimisation, des coûts de virtualisation et de débit
To address the enhanced mobile broadband, massive and critical communications for the Internet of things, Fifth Generation (5G) of mobile communications is being deployed, nowadays, relying on multiple enablers, namely: Cloud Radio Access Network (C-RAN), Software-Defined Networking (SDN) and Network Function Virtualization (NFV).C-RAN decomposes the new generation Node-B into: i) Remote Radio Head (RRH), ii) Digital Unit (DU), and iii) Central Unit (CU), also known as Cloud or Collaborative Unit.DUs and CUs are the two blocks that implement the former 4G Baseband Unit (BBU) while leveraging eight options of functional splits of the front-haul for a fine-tuned performance. The RRH implements the radio frequency outdoor circuitry. SDN allows programming network's behavior by decoupling the control plane from the user plane and centralizing the flow management in a dedicated controller node. NFV, on the other hand, uses virtualization technology to run Virtualized Network Functions (VNFs) on commodity servers. SDN and NFV allow the partitioning of the C-RAN, transport and core networks as network slices defined as isolated and virtual end-to-end networks tailored to fulfill diverse requirements requested by a particular application. The main objective of this thesis is to develop resource-provisioning algorithms (Central Processing Unit (CPU), memory, energy, and spectrum) for 5G networks while guaranteeing optimal provisioning of VNFs for a cloud-based infrastructure. To achieve this ultimate goal, we address the optimization of both resources and infrastructure within three network domains: 5G Core Network (5GC), C-RAN and the SDN controllers. We, first formulate the 5GC offloading problem as a constrained-optimization to meet multiple objectives (virtualization cost, processing power and network load) by making optimal decisions with minimum latency. We optimize the usage of the network infrastructure in terms of computing capabilities, power consumption, and bitrate, while meeting the needs per slice (latency, reliability, efficiency, etc.). Knowing that the infrastructure is subject to frequent and massive events such as the arrival/departure of users/devices, continuous network evolution (reconfigurations, and inevitable failures), we propose a dynamic optimization using Branch, Cut and Price, while discussing objectives effects on multiple metrics.Our second contribution consists of optimizing the C-RAN by proposing a dynamic mapping of RRHs to BBUs (DUs and CUs). On first hand, we propose clustering the RRHs in an aim to optimize the downlink throughput. On second hand, we propose the prediction of the Power Headroom (PHR), to optimize the throughput on the uplink.We formulate our RRHs clustering problem as k-dimensional multiple Knapsacks and the prediction of PHR using different Machine Learning (ML) approaches to minimize the interference and maximize the throughput.Finally, we address the orchestration of 5G network slices through the software defined C-RAN controller using ML-based approaches, for all of: classification of performance requirements, forecasting of slicing ratios, admission controlling, scheduling and adaptive resource management.Based on extensive evaluations conducted in our 5G experimental prototype based on OpenAirInterface, and using an integrated performance management stack, we show that our proposals outperform the prominent related strategies in terms of optimization speed, computing cost, and achieved throughput

APA, Harvard, Vancouver, ISO, and other styles

17

Luizelli, Marcelo Caggiani. "Scalable cost-efficient placement and chaining of virtual network functions." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2017. http://hdl.handle.net/10183/169337.

Full text

Abstract:

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
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).

APA, Harvard, Vancouver, ISO, and other styles

18

Baranda, Hortigüela Jorge. "End-to-end network service orchestration in heterogeneous domains for next-generation mobile networks." Doctoral thesis, Universitat Politècnica de Catalunya, 2021. http://hdl.handle.net/10803/672782.

Full text

Abstract:

5G marks the beginning of a deep revolution in the mobile network ecosystem, transitioning to a network of services to satisfy the demands of new players, the vertical industries. This revolution implies a redesign of the overall mobile network architecture where complexity, heterogeneity, dynamicity, and flexibility will be the rule. Under such context, automation and programmability are essential to support this vision and overcome current rigid network operation processes. Software Defined Networking (SDN), Network Function Virtualization (NFV) and Network slicing are key enabling techniques to provide such capabilities. They are complementary, but they are still in its infancy and the synergies between them must be exploited to realise the mentioned vision. The aim of this thesis is to further contribute to its development and integration in next generation mobile networks by designing an end-to-end (E2E) network service orchestration (NSO) architecture, which aligned with some guidelines and specifications provided by main standardization bodies, goes beyond current management and orchestration (MANO) platforms to fulfil network service lifetime requirements in heterogeneous multi-technology/administrative network infrastructures shared by concurrent instances of diverse network services. Following a bottom-up approach, we start studying some SDN aspects related to the management of wireless network elements and its integration into hierarchical control architectures orchestrating networking resources in a multi-technology (wireless, optical, packet) infrastructure. Then, this work is integrated in an infrastructure manager module executing the joint resource abstraction and allocation of network and compute resources in distributed points of presence (PoPs) connected by a transport network, aspect which is not (or lightly) handled by current MANO platforms. This is the module where the integration between NFV and SDN techniques is executed. This integration is commanded by a Service Orchestrator module, in charge of automating the E2E lifecycle management of network services implementing network slices (NS) based on the vertical requirements, the available infrastructure resources, and, while fulfilling service level agreement (SLA) also during run-time operation. This architecture, focused on single administrative domain (AD) scenarios, constitutes the first group of contributions of this thesis. The second group of contributions evolves this initial architecture to deal with the orchestration and sharing of NS and its network slice subnet instances (NSSIs) involving multiple ADs. The main differential aspect with current state-of-the-art solutions is the consideration of resource orchestration aspects during the whole orchestration process. This is fundamental to achieve the interconnection of NSSIs, hence making the E2E multi-domain orchestration and network slicing a reality in practice. Additionally, this work also considers SLA management aspects by means of scaling actions during run-time operation in such complex scenarios. The third group of contributions demonstrate the validity and applicability of the resulting architectures, workflows, and interfaces by implementing and evaluating them in real experimental infrastructures featuring multiple ADs and transport technologies interconnecting distributed computing PoPs. The performed experimentation considers network service definitions close to real vertical use cases, namely automotive and eHealth, which help bridging the gap between network providers and vertical industries stakeholders. Experimental results show that network service creation and scaling times in the order of minutes can be achieved for single and multi-AD scenarios, in line with 5G network targets. Moreover, these measurements serve as a reference for benchmarking the different operations involved during the network service deployment. Such analysis are limited in current literature.
5G marca el inicio de una gran revolución en las redes móviles, convirtiéndose en redes orientadas a servicios para satisfacer las demandas de nuevos actores, las industrias verticales. Esta revolución supone un rediseño total de la arquitectura de red donde la complejidad, heterogeneidad, dinamicidad y flexibilidad serán la norma. En este contexto, la automatización y programabilidad serán esenciales para superar los rígidos procesos actuales de operación de red. Las redes definidas por software (SDN), la virtualización de funciones de red (NFV) y el particionamiento de redes son técnicas clave para proporcionar dichas capacidades. Éstas son complementarias, pero aún recientes y sus sinergias se deben explotar para realizar la nueva visión. El objetivo de esta tesis es contribuir a su desarrollo e integración en la nuevas generaciones de redes móviles mediante el diseño de una arquitectura de orquestación de servicios de red (NSO) extremo a extremo (E2E), que alineada con algunas pautas y especificaciones de los principales organismos de estandarización, va más allá de los actuales sistemas de gestión y orquestación (MANO) para instanciar y garantizar los requisitos de los diversos servicios de red desplegados concurrentemente en infraestructuras heterogéneas compartidas que combinan múltiples tecnologías y dominios administrativos (AD). Siguiendo un enfoque ascendente, comenzamos a estudiar aspectos de SDN relacionados con la gestión de elementos de red inalámbricos y su integración en arquitecturas jerárquicas de orquestación de recursos de red en infraestructuras multi tecnología (inalámbrica, óptica, paquetes). Luego, este trabajo se integra en un módulo de administración de infraestructura que ejecuta de forma conjunta la abstracción y la asignación de recursos de red y computación en múltiples puntos de presencia (PoP) distribuidos conectados por una red de transporte, aspecto que no está (o ligeramente) considerado por los actuales sistemas MANO. Este módulo ejecuta la integración de las técnicas NFV y SDN. Esta integración está dirigida por el módulo Orquestador de Servicios, que automatiza la gestión E2E del ciclo de vida de los servicios de red implementando las diferentes particiones de red en base a los requisitos de los verticales, los recursos de infraestructura disponibles y mientras cumple los acuerdos de nivel de servicio (SLA) durante la operación del servicio. Esta arquitectura, centrada en escenarios con un único AD, forma el primer grupo de contribuciones de esta tesis. El segundo grupo de contribuciones evoluciona esta arquitectura abordando la orquestación y compartición de particiones de red y sus componentes (NSSIs) en escenarios con múltiples AD. La consideración detallada de aspectos de orquestación de recursos es el principal aspecto diferencial con la literatura. Esto es fundamental para la interconexión de NSSIs, haciendo realidad la orquestación E2E y el particionamiento de red en escenarios con múltiples AD. Además, se considera la gestión de SLA mediante acciones de escalado durante la operación del servicio en los escenarios mencionados. El tercer grupo de contribuciones valida las arquitecturas, procedimientos e interfaces resultantes pues se han implementado y evaluado sobre infraestructuras experimentales reales que presentan múltiples AD y tecnologías de transporte interconectando PoP distribuidos. Esta experimentación considera definiciones de servicios de red cercanos a casos de uso de verticales reales, como automoción y eHealth, ayudando a cubrir la brecha entre los proveedores de red y los verticales. Los resultados experimentales muestran que la creación y el escalado de servicios de red se pueden realizar en pocos minutos en escenarios con un único o múltiples ADs, en línea con los indicadores de red objetivos de 5G. Estas medidas, escasas en la literatura actual, sirven como referencia para caracterizar las diferentes operaciones involucradas durante el despliegue de servicios.
Arquitectura de computadors

APA, Harvard, Vancouver, ISO, and other styles

19

Farshin, Alireza. "Realizing Low-Latency Internet Services via Low-Level Optimization of NFV Service Chains : Every nanosecond counts!" Licentiate thesis, KTH, Network Systems Laboratory (NS Lab), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-249664.

Full text

Abstract:

By virtue of the recent technological developments in cloud computing, more applications are deployed in a cloud. Among these modern cloud-based applications, some require bounded and predictable low-latency responses. However, the current cloud infrastructure is unsuitable as it cannot satisfy these requirements, due to many limitations in both hardware and software. This licentiate thesis describes attempts to reduce the latency of Internet services by carefully studying the currently available infrastructure, optimizing it, and improving its performance. The focus is to optimize the performance of network functions deployed on commodity hardware, known as network function virtualization (NFV). The performance of NFV is one of the major sources of latency for Internet services. The first contribution is related to optimizing the software. This project began by investigating the possibility of superoptimizing virtualized network functions(VNFs). This began with a literature review of available superoptimization techniques, then one of the state-of-the-art superoptimization tools was selected to analyze the crucial metrics affecting application performance. The result of our analysis demonstrated that having better cache metrics could potentially improve the performance of all applications. The second contribution of this thesis employs the results of the first part by taking a step toward optimizing cache performance of time-critical NFV service chains. By doing so, we reduced the tail latencies of such systems running at 100Gbps. This is an important achievement as it increases the probability of realizing bounded and predictable latency for Internet services.
Tack vare den senaste tekniska utvecklingen inom beräkningar i molnet(“cloud computing”) används allt fler tillämpningar i molnlösningar. Flera avdessa moderna molnbaserade tillämpningar kräver korta svarstider är låga ochatt dessa ska vara förutsägbara och ligga inom givna gränser. Den nuvarandemolninfrastrukturen är dock otillräcklig eftersom den inte kan uppfylla dessa krav,på grund av olika typer av begränsningar i både hårdvara och mjukvara. I denna licentiatavhandling beskrivs försök att minska fördröjningen iinternettjänster genom att noggrant studera den nuvarande tillgängligainfrastrukturen, optimera den och förbättra dess prestanda. Fokus ligger påatt optimera prestanda för nätverksfunktioner som realiseras med hjälp avstandardhårdvara, känt som nätverksfunktionsvirtualisering (NFV). Prestanda hosNFV är en av de viktigaste källorna till fördröjning i internettjänster. Det första bidraget är relaterat till att optimera mjukvaran. Detta projektbörjade med att undersöka möjligheten att “superoptimera” virtualiseradenätverksfunktioner (VNF). Detta inleddes med en litteraturöversikt av tillgängligasuperoptimeringstekniker, och sedan valdes ett av de toppmodernasuperoptimeringsverktygen för att analysera de viktiga mätvärden som påverkartillämpningssprestanda. Resultatet av vår analys visade att bättre cache-mätningar potentiellt skulle kunna förbättra prestanda för alla tillämpningar. Det andra bidraget i denna avhandling utnyttjar resultaten från den förstadelen genom att ta ett steg mot att optimera cache-prestanda för tidskritiskakedjor av NFV-tjänster. Genom att göra så reducerade vi de långa fördröjningarnahos sådana system som kördes vid 100 Gbps. Detta är en viktig bedrift eftersomdetta ökar sannolikheten för att uppnå en begränsad och förutsägbar fördrörninghos internettjänster.

QC 20190415

Time-Critical Clouds
ULTRA

APA, Harvard, Vancouver, ISO, and other styles

20

D'Oro, Salvatore. "User-Centric resource allocation through a power-efficient jamming-proof RAN on top of a multi-tenant backhaul." Doctoral thesis, Università di Catania, 2016. http://hdl.handle.net/10761/3856.

Full text

Abstract:

The exponential growth in the number of communicating devices and the increasing demand for better and high-performance communications have made allocation of network resources an issue of extreme importance. The problem is further exacerbated if we consider that, while the number of deployed devices is massive, the amount of network resources is still limited. In this thesis, we aim at providing a holistic approach for resource allocation in modern telecommunication networks. Specifically, we consider a network consisting of a backhaul interconnecting a Radio Access Network (RAN) that provides mobile users with wireless access to a Core Network (CN). The CN allows access to the Internet and enables end-to-end communications by routing users data and calls. We take both energy and security aspects into account, by proposing a power-efficient and jamming-proof resource allocation scheme for the RAN. Furthermore, we consider the relevant and emerging case where the backhaul is shared among different tenants. Accordingly, we exploit Software Defined Networks (SDNs) and Network Function Virtualization (NFV) paradigms to provide dynamic and flexible network and service management in the multi-tenant backhaul and CN, respectively. We formulate the resource allocation problem through both centralized and distributed approaches, we discuss the existence and uniqueness of efficient resource allocation solutions and we provide distributed privacy-preserving algorithms that provably converge allow to the optimal resource allocation policy by exploiting only local or shared information.

APA, Harvard, Vancouver, ISO, and other styles

21

Nguyen, Thi Minh. "Optimisation de l'allocation des ressources dans les réseaux d'infrastructure basés sur la virtualisation des fonctions réseau." Electronic Thesis or Diss., Paris 6, 2017. https://accesdistant.sorbonne-universite.fr/login?url=https://theses-intra.sorbonne-universite.fr/2017PA066626.pdf.

Full text

Abstract:

Les prestataires de service réseau doivent faire face à la demande croissante des besoins des utilisateurs, en particulier vers une plus grande flexibilité et toujours plus de capacité. La "softwerisation" et la "cloudification" des composants du réseau offrent une solution prometteuse pour obtenir l'agilité nécessaire afin de répondre dynamiquement à l'exigence au niveau de la consommation des ressources. Cette vision se traduit par le déploiement de la Virtualisation des Fonctions Réseau (NFV) où les Fonctions de Réseau Virtuels (VNFs) peuvent être associées pour créer des services réseau. Cette thèse étudie la problématique de l'allocation de ressources dans un système NFV afin de minimiser son coût sous contraintes sur l'interconnectivité entre les VNF, les ressources du système et les exigences de service. La principale considération est la réduction du coût global du déploiement en ressources informatiques. Nous étudions également d'autres objectifs à satisfaire tels que la migration des fonctions réseau et la gestion de la congestion. Notre premier objectif est d'augmenter notre compréhension de la performance d'un système NFV en étudiant le placement et le routage des fonctions réseau. Nous formalisons le problème dans une approche globale en tenant compte d'un large ensemble de paramètres pertinents. Nous prendrons en compte les cas statiques (Hors Ligne) et dynamiques (En Ligne) du problème. Nous proposons et analysons trois algorithmes heuristiques: deux sont conçus pour traiter de grandes dimensions du scenario "Hors Ligne" et le dernier est conçu pour résoudre le scénario "En Ligne". Les résultats montrent que notre solution surpasse l'état de l'art par rapport à l'indicateur de performance critique. Nous évaluons également l'impact de la migration d'une série de demandes simultanées et proposons une technique de migration simple pour ce système dynamique. A la lumière de ces premiers résultats, nous étendons notre étude afin d'améliorer l'efficacité de notre solution en proposant un modèle plus simple. La seconde partie de notre étude se concentre sur l'optimisation de l'utilisation des ressources d'un système NFV. La principale distinction est que nous pouvons appliquer le modèle à un système dynamique avec de grandes instances. De plus, nous fournissons également une méthode originale pour engendrer de fortes inégalités afin d'améliorer la résolution de la programmation linéaire (LP) dans un espace de dimension supérieur. Les résultats obtenus n'améliorent pas seulement le modèle, mais promettent aussi de pouvoir être utiliser efficacement dans d'autres modèles. Une troisième contribution de notre travail concerne le problème de routage dans NFV. En effet, une évolution importante des besoins des utilisateurs est représentée par la demande d'accès croissante aux ressources réseau, de stockage et de calcul afin de combiner dynamiquement le niveau de consommation de ressources avec leurs besoins de service. Par conséquent, nous nous intéressons au routage efficace d'une demande utilisateur à travers les noeuds qui traitent les fonctions impliquées dans une chaîne de services donnée. Nous proposons une formulation originale de ce problème basée sur la construction d'un réseau étendu. Nous formulons une solution mathématique exacte et proposons plusieurs algorithmes approximatifs tenant compte les principaux paramètres du système. Nous conclurons en soulignant les contributions principales de notre travail et proposons quelques pistes pour des travaux futurs
Network service providers have to cope with the growing on-demand need from end-users as well as the diversity of usage. The "softwerization" and "loudification" of the network components offer a promising solution to achieve the agility necessary to dynamically match the servcice requirements with the level of resource consumption. Cloud-based solutions promises an economy of scale and simpler management. Virtualizing the many network appliances offers the flexibility to adapt to the varying service demand. This materializes with the deployment of Network Functions Virtualization (NFV) where Virtual Network Functions (VNFs) may be chained together to create network services. This dissertation studies the resource allocation problem in an NFV system for minimizing its cost under constraints on interconnectivity among VNFs, system resources, and service requirements. The main consideration is the reduction of the overall deployment cost while efficiently utilizing the available resources. In addition, a number of other important constraints are considered such as migration and congestion. Our first goal is to increase our understanding of the performance of an NFV system with respect to network functions placement and routing. We formalize the problem in a comprehensive maner taking into account a broad set of relevant parameters. The static (OFFLINE) and dynamic (ONLINE) cases are considered. We propose and analyze three heuristic algorithms: two for handling large dimensions of the OFFLINE problem and one designed to address the ONLINE scenario. The results show that our solution outperforms the state of the art with respect to critical performance index. We also evaluate the impact of migrating a set of running demands, and propose a simple migration technique for the dynamic system. We extend this work by proposing a simpler model to improve the performance of our solution. The second part of our work focuses on minimizing the resource utilization of an NFV system. The main distinctive point is that we can apply the model to a dynamic system with large instances. Moreover, we also provide an interesting method for generating some strong inequalities to improve the Linear Programming (LP) solving in a higher dimensional space. The obtained results are not only making the model easier but also can be used efficiently in other models. A third contribution focuses specifically on the routing problem in NFV. An important evolution of the users’ needs is represented by the dynamic on-demand access to network, vstorage and compute resources. Therefore, routing efficiently a demand across nodes handling the functions involved in a given service chain constitutes the a novel problem that we address in this last section. We provide an original formulation of this problem based on the construction of an expanded network. We derive the exact mathematical formulation and propose several approximate algorithms taking into account the main system’s parameters. We conclude by deriving some interesting insights both about the algorithms and the network performance. We finally conclude with our main findings and highlight many avenues for future work

APA, Harvard, Vancouver, ISO, and other styles

22

Pitzus, Antonio. "SDN : Software Defined Networking." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2017. http://amslaurea.unibo.it/14006/.

Full text

Abstract:

In un periodo in cui tutto si evolve rapidamente, il settore delle telecomunicazioni sta assistendo alla crescita esponenziale del numero di dispositivi mobili costantemente connessi alla rete; ciò richiede la necessità di un nuovo modo di gestire le reti. La nuova visione che sta maturando in questi ultimi tempi è quella di adottare un modello di rete dinamico, flessibile e soprattutto affidabile e che non richieda grossi sforzi di manutenzione o l’installazione di ulteriori hardware da parte degli operatori. Una rete con queste caratteristiche può essere sviluppata grazie ad un modello architetturale innovativo come il Software Defined Networking (SDN) e ad un nuovo modo di sfruttare le funzionalità degli apparati di rete come la Network Function Virtualization (NFV), la quale è a sua volta un processo di virtualizzazione delle funzionalità di rete svolte da apparati di telecomunicazione fisici. Questi due concetti sono strettamente legati tra loro e possono comportare particolari vantaggi se applicati contemporaneamente, ma sono di per sè indipendenti. Software Defined Networking (SDN) è un’ architettura utilizzata per la realizzazione di reti di telecomunicazione nelle quali il piano di controllo della rete e quello del trasporto dei dati sono separati logicamente. La Network Function Virtualization (NFV) è il processo di virtualizzazione delle funzionalità di rete svolte da apparati di telecomunicazione fisici. Un ultimo aspetto da trattare riguarda la comunicazione del controller SDN di alto e basso livello. La comunicazione di alto livello, ovvero quella con i software applicativi è consentita grazie alle NBI (North-Bound Interfaces), mentre quella di basso livello, ovvero con i dispositivi hardware è consentita grazie alle SBI (South-Bound Interfaces). Queste due interfacce riescono a soddisfare le richieste del controller SDN grazie all' applicazione del paradigma Intent NBI, di tipo dichiarativo, non prescrittivo e indipendente dal fornitore.

APA, Harvard, Vancouver, ISO, and other styles

23

Biallach, Hanane. "Optimization of VNF reconfiguration problem for 5G network slicing." Electronic Thesis or Diss., Compiègne, 2022. http://www.theses.fr/2022COMP2707.

Full text

Abstract:

Ces dernières années, en raison de la croissance sans précédent du nombre d'appareils connectés et de données mobiles, et des développements continus des technologies pour répondre à cette énorme demande de données, le réseau de cinquième génération (5G) a émergé. La future architecture 5G sera essentiellement basée sur le Network Slicing (NS), qui permet de fournir une approche flexible pour réaliser la vision 5G. Grâce au concept émergent de virtualisation des fonctions réseau (NFV), les fonctions réseau sont découplées des matériels physiques dédiés et réalisées sous forme de logiciel. Cela offre plus de flexibilité et d'agilité dans les opérations commerciales. Malgré les avantages qu'il apporte, NFV soulève quelques défis techniques, le problème de reconfiguration étant l'un d'entre eux. Ce problème, qui est NP-difficile, consiste à réaffecter les fonctions de réseau virtuel (VNFs) pour s'adapter aux changements du réseau, en transformant l'état courant des services déployés, on peut illustrer cela par la migration des machines virtuelles (VM) qui hébergent les VNF, à un autre état qui répond aux objectives des opérateurs. Cette thèse de doctorat étudie comment reconfigurer les VNFs en les migrant vers un état optimal qui pourrait être calculé en avance ou inconnu. Dans cette thèse, nous avons étudié les deux cas en minimisant la durée d'interruption de service et la durée de migration des VNFs. Nous avons proposé des méthodes exactes et approchées. Parmi les méthodes exactes, nous citons deux modèles PLNE. Nous avons également proposé deux approches heuristiques, l'une basée sur la génération de colonnes et la deuxième utilisant la notion de “feedback arc set". L'objectif global de ce travail est donc de définir et d'étudier le problème de reconfiguration des VNFs dans le contexte du 5G network slicing, et de proposer des modèles mathématiques et des algorithmes efficaces pour résoudre les problèmes d'optimisation sous-jacents
In recent years, because of the unprecedented growth in the number of connected devices and mobile data, and the ongoing developments in technologies to address this enormous data demand, the fifth generation (5G) network has emerged. The forthcoming 5G architecture will be essentially based on Network Slicing (NS), which enables provide a flexible approach to realize the 5G vision. Thanks to the emerging Network Function Virtualization (NFV) concept, the network functions are decoupled from dedicated hardware devices and realized in the form of software. This offers more flexibility and agility in business operations. Despite the advantages it brings, NFV raises some technical challenges, the reconfiguration problem is one of them. This problem, which is NP-Hard, consists in reallocating the Virtual Network Functions (VNFs) to fit the network changes, by transforming the current state of deployed services, e.g., the current placement of Virtual Machines (VM) that host VNFs, to another state that updates providers’ objectives. This PhD thesis investigates how to reconfigure the VNFs by migrating them to an optimal state that could be computed in advance or free placement. In this thesis, we studied both cases while minimizing the service interruption duration and the VNF migration duration. We have proposed exact and approximate methods. Among the exact methods, we cite two ILP models. We also proposed two heuristic approaches, one based on column generation and the second using the concept of “arc set feedback”. The overall objective of this work is therefore to define and study the problem of VNF reconfiguration problem in the context of 5G network slicing, and propose mathematical models and efficient algorithms to solve the underlying optimization problems

APA, Harvard, Vancouver, ISO, and other styles

24

Hummel, Václav. "Framework pro hardwarovou akceleraci 400Gb sítí." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2017. http://www.nusl.cz/ntk/nusl-363862.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

25

Foresta, Francesco. "Integration of SDN frameworks and Cloud Computing platforms: an Open Source approach." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2017. http://amslaurea.unibo.it/14271/.

Full text

Abstract:

As a result of the explosion in the number of services offered over the Internet, network traffic has experienced a remarkable increment and is supposed to increase even more in the few next years. Therefore, Telco operators are investigating new solutions aiming at managing this traffic efficiently and transparently to guarantee the users the needed Quality of Service. The most viable solution is to have a paradigm shift in the networking field: the old and legacy routing will be indeed replaced by something more dynamic, through the use of Software Defined Networking. In addition to it, Network Functions Virtualization will play a key role making possible to virtualize the intermediate nodes implementing network functions, also called middle-boxes, on general purpose hardware. The most suitable environment to understand their potentiality is the Cloud, where resources, as computational power, storage, development platforms, etc. are outsourced and provided to the user as a service on a pay-per-use model. All of this is done in a complete dynamic way, as a result of the presence of the implementation of the above cited paradigms. However, whenever it comes to strict requirements, Telecommunication Networks are still underperforming: one of the cause is the weak integration among these paradigms to reactively intervene to the users' need. It is therefore remarkably important to properly evaluate solutions where SDN and NFV are cooperating actively inside the Cloud, leading to more adaptive systems. In this document, after the description of the state of the art in networking, the deployment of an OpenStack Cloud platform on an outperforming cluster will be shown. In addition, its networking capabilities will be improved via a careful cloud firewalling configuration; moreover, this cluster will be integrated with Open Source SDN frameworks to enhance its services. Finally, some measurements showing how much this approach could be interesting will be provided.

APA, Harvard, Vancouver, ISO, and other styles

26

Moreira, Rodrigo. "Um orquestrador flexível de recursos de rede e computação para o aprimoramento de qualidade de serviço (QoS) em aplicações multimídia baseadas em funções virtualizadas de rede (NFV)." Universidade Federal de Uberlândia, 2017. https://repositorio.ufu.br/handle/123456789/19743.

Full text

Abstract:

Pessoas e organizações ao redor do globo utilizam aplicações multimídia para interação e comunicação. Existe notável crescimento de tráfego característico dessas aplicações, uma vez que há convergência de voz e dados para um modelo único de transporte. As redes de computadores, por suportar tais aplicações cadenciam desafios e oportunidades de negócios que os operadores têm aproveitado. Por outro lado, os usuários experimentam serviços com qualidades cada vez mais refinados, mesmo assim, existem aspectos que devem ser tratados para elevar a qualidade de experiência percebida pelos usuários ao consumir serviços ofertados sobre a internet. Métricas de QoS usualmente são baseadas nos usuários ou na rede, por isso, conceitos como NFV e SDN permitem aprimorar e expandir a perspectiva de oferta de uma camada de abstração para desenvolvimento de soluções flexíveis, que visam lidar com aplicações multimídia ofertadas em nuvem. Não obstante, a construção dessas soluções deve ser calcada em aspectos intrínsecos ao conceito de Internet do Futuro que preconiza soluções virtualizadas, flexíveis, convergentes, escaláveis, orientadas a contexto, seguras e melhor gerenciadas. Este trabalho propõe uma abordagem para mitigar a distância das aplicações com os recursos de rede e computação. Usualmente as aplicações desconhecem características de hardware sobre o qual elas operam; quanto a rede, mesmo com esforços em vários níveis da pilha de protocolos, desconhece especificidades das aplicações em execução. Há também dificuldade de gerenciamento global de recursos, integração de políticas e acordos de serviço entre operadores. O trabalho visa adicionar uma camada de gerenciamento para elevar os níveis de QoS para aplicações multimídia baseadas em NFV. Para realizar isso, é proposto uma entidade que atua no plano de dados e controle, capaz de orquestrar recursos de rede e de computação simultaneamente para aprimorar QoS em aplicações multimídia. A incorporação dessa entidade conquista melhoramento de QoS por meio da oferta de resiliência na comunicação fim-a-fim de entidades consumidoras dessas aplicações, provê um balanceamento de carga adequado a fim de não comprometer parâmetros de QoS como tempo de resposta, provê escalabilidade sob demanda, promove o conceito de inspeção de pacotes para segmentação de políticas de rede orientada à aplicação, finalmente realiza a separação de plano de dados e controle. A construção e experimentação da solução permitiu diminuir tempos de resposta nas aplicações multimídia; a solução reagiu adequadamente frente a cargas de trabalho heterogêneas no sentido de prover confiabilidade para garantia de QoS; também, o conceito de inspeção de pacotes foi capaz de atuar para diminuir a distância que as aplicações possuem da rede e o hardware sobre o qual elas operam.
People and organizations around the globe use multimedia applications for interaction and communication. There is notable traffic growth characteristic of these applications since there is a convergence of voice and data for a single transport model. Computer networks, because they support such applications, meet the challenges and business opportunities that operators have taken advantage of. On the other hand, users use services with increasingly refined qualities, nevertheless, there are aspects that must be addressed to raise the quality of experience for users when consuming services offered over the internet. QoS metrics are usually user-based or network-based, hence concepts such as NFV and SDN allow to improve and expand the perspective of offering an abstraction layer for the development of flexible solutions that deal with multimedia applications offered in the cloud. Nevertheless, the construction of these solutions must be based on intrinsic aspects to the Future Internet concept that advocates virtualized solutions, flexible, convergent, scalable, context-aware, secure and better managed. This dissertation proposes an approach to mitigate the distance of the applications with the resources of compute and network. Usually, the applications are unaware of the hardware characteristics on which they operate, as for the network, even with several efforts at various levels of the protocol stack, the specificities of running applications are unknown. There is also challenges of managing global resources, integrating policies and service agreements between operators. This work aims to add a management layer to raise the levels of QoS for multimedia applications based on NFV. To accomplish this, an entity that acts on the data and control plane is proposed, capable of orchestrating network and computing resources simultaneously to enhance QoS in multimedia applications. The incorporation of this entity achieves QoS improvement through resiliency in the end-to-end communication of the consumer entity of these applications, provides adequate load balancing in order to avoid compromising QoS parameters such as response time, provides on-demand scalability, improves the concept of package inspection for the segmentation of application-oriented network policies, and finally performs the separation of data and control plane. The construction and experimentation of the solution allowed to reduce response times in the multimedia applications. The solution reacted adequately to heterogeneous workloads in order to provide reliability for QoS guarantee. Furthermore, the concept of packet inspection was able to act to decrease the distance that the applications have from the network and the hardware on which they operate.
Dissertação (Mestrado)

APA, Harvard, Vancouver, ISO, and other styles

27

BARRETO, Jymmy Paul Souza. "Composição de serviços em network function virtualization." Universidade Federal de Pernambuco, 2016. https://repositorio.ufpe.br/handle/123456789/25845.

Full text

Abstract:

Submitted by Pedro Barros (pedro.silvabarros@ufpe.br) on 2018-08-15T19:52:51Z No. of bitstreams: 2 license_rdf: 811 bytes, checksum: e39d27027a6cc9cb039ad269a5db8e34 (MD5) DISSERTAÇÃO Jymmy Paul Souza Barreto.pdf: 1650520 bytes, checksum: 9b58d6df9ea35f93b7083597ff86ca77 (MD5)
Approved for entry into archive by Alice Araujo (alice.caraujo@ufpe.br) on 2018-08-24T18:49:13Z (GMT) No. of bitstreams: 2 license_rdf: 811 bytes, checksum: e39d27027a6cc9cb039ad269a5db8e34 (MD5) DISSERTAÇÃO Jymmy Paul Souza Barreto.pdf: 1650520 bytes, checksum: 9b58d6df9ea35f93b7083597ff86ca77 (MD5)
Made available in DSpace on 2018-08-24T18:49:13Z (GMT). No. of bitstreams: 2 license_rdf: 811 bytes, checksum: e39d27027a6cc9cb039ad269a5db8e34 (MD5) DISSERTAÇÃO Jymmy Paul Souza Barreto.pdf: 1650520 bytes, checksum: 9b58d6df9ea35f93b7083597ff86ca77 (MD5) Previous issue date: 2016-09-14
O paradigma Virtualização de Funções de Rede (NFV) atraiu rapidamente o interesse dos provedores de serviços de comunicações como um meio de acelerar a entrega dos serviços e, ao mesmo tempo, reduzir os custos associados. Inúmeros fatores trouxeram boas razões para esta causa, tais como: baixo custo de operação e energia, menor tempo de implementação de novas tecnologias para o mercado, gerenciamento escalável e dinâmico de serviços de rede e disponibilidade de compartilhamento de recursos de rede por meio de serviços e diferentes plataformas. Complementar à promessa das Redes Definidas por Software (SDN) de automatizar a orquestração e configuração da rede, NFV propõe automatizar a implantação e controle de funções de rede, as quais serão executadas em plataformas com servidores virtualizados. No mundo da SDN e da NVF, pode-se ter milhares de instâncias de um elemento, juntas, formando os componentes da rede. Se um deles falhar, perde-se um pouco da capacidade mas não se perde o elemento inteiro e pode-se recriar esse componente. A nova arquitetura pressupõe a criação de uma cadeia de serviço, ou seja, um conjunto de máquinas virtuais alinhadas para criar um serviço. Tanto pode ser de firewall como de detecção de intrusões, ou de outros elementos da rede. Neste contexto, desafios se tornam inerentes a esta proposta, os quais abordam tópicos como interoperabilidade de plataformas de rede, perda ou ganho de desempenho, segurança e resiliência. Assim, esse trabalho propõe avaliar o desempenho de composição de serviços utilizando um ambiente de NFV. Para isso, foram construídos vários cenários e usadas diferentes topologias a fim de validar um simulador que possa ser usado posteriormente por outros usuários como uma ferramenta útil para a composição de serviços em ambiente de NFV.
The Network Functions Virtualization (NFV) paradigm quickly attracted the interest of communications service providers as a means to accelerate the delivery of services and at the same time reducing the associated costs. Several factors have brought good reasons for this cause, such as operating and energy costs, implementation time of new technologies to market, scalable and dynamic management of network services and network resource sharing availability through different services and platforms. Complementary to the promise of Software-Defined Networking (SDN) to automate the orchestration and network configuration, NFV proposes automate the deployment and control of network functions, which will be run on platforms with virtualized servers. In the world of SDN and NVF, can have thousands of instances of an element, together forming network components. If one fails, you lose some of the ability but do not lose the whole element and can recreate this component. The new architecture involves creating a service string, i.e., a set of virtual machines aligned to create a service. Both can be firewall or intrusion detection, or other network elements. In this context, challenges become inherent in this proposal, which address topics such as interoperability of network platforms, trade-offs of performance, security and resilience. Thus, this work proposes to evaluate the performance of service composition using a NFV. For this, they were built several scenarios and used different topologies to validate a simulator that can later be used by other users as a useful tool for service composition in NFV.

APA, Harvard, Vancouver, ISO, and other styles

28

Alleg, Abdelhamid. "Service Function Placement and Chaining in Network Function Virtualization Environments." Thesis, Bordeaux, 2019. http://www.theses.fr/2019BORD0117.

Full text

Abstract:

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
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

APA, Harvard, Vancouver, ISO, and other styles

29

Cunha, Vítor António Gonçalves Ribeiro da. "Service function chaining for NFV in cloud environments." Master's thesis, Universidade de Aveiro, 2015. http://hdl.handle.net/10773/21133.

Full text

Abstract:

Mestrado em Engenharia de Computadores e Telemática
Service Function Chaining, Virtual Network Functions e Cloud Computing são os conceitos chave para resolver (em “grande plano”) uma necessidade actual dos operadores de telecomunicações: a virtualização dos equipamentos na casa dos consumidores, particularmente o Home Gateway. Dentro deste contexto, o objetivo desta dissertação será providenciar as Funções Virtuais de Rede (tais como um vDHCP, Classificador de Tráfego e Shaper) assim como respectivas APIs necessárias para se atingir essa solução de “grande plano”. A solução utilizará tecnologias Open Source como OpenStack, OpenVSwitch e OpenDaylight (assim como contribuições anteriores do Instituto de Telecomunicações) para concretizar uma Prova-de-Conceito do Home Gateway virtual. Após o sucesso da primeira PdC iniciar-se-á a construção da próxima prova, delineando um caminho claro para trabalho futuro.
Service Function Chaining, Network Function Virtualization and Cloud Computing are the key concepts to solve (in “big-picture”) one of today’s operator’s needs: virtual Customer Premises Equipments, namely the virtualization of the Home Gateway. Within this realm, it will be the purpose of this dissertation to provide the required Virtual Network Functions (such as a vDHCP, Traffic Classifier and Traffic Shaper) as well as their respective APIs to build that “big-picture” solution. Open Source technologies such as OpenStack, OpenVSwitch and OpenDaylight (along with prior work from Instituto de Telecomunicações) will be used to make a working Proof-of-Concept of the Virtual Home Gateway. After the success of the first PoC, starts the construction of the next PoC and a path for future work is laid-down.

APA, Harvard, Vancouver, ISO, and other styles

30

Pedro, Rui Filipe. "Performance management in virtualized and programmable network environments (NFV and SDN)." Master's thesis, Universidade de Aveiro, 2017. http://hdl.handle.net/10773/23472.

Full text

Abstract:

Mestrado em Engenharia de Computadores e Telemática
More than tendencies and exploratory knowledge domains, there is a strong conviction in the industry that network function virtualization (NFV) and software-de ned network (SDN) paradigms came here to stay in the telecommunication services world. So that operators can surf the waves of change, they will have to signi cantly change their network architecture, their management mechanisms, and, simultaneously , their business model. This Master Thesis intends to contribute to the operators operation management mechanisms evolution, namely in the supervision/monitoring domains. More concretely, the work to be developed in this Master Thesis, will have as its main objective the evolution of the performance management platform (Altaia) from Altice Labs to the new networking paradigm based on the NFV and SDN concepts. It is also important to outline that the activities to be developed in the scope of this work, will be aligned in an international R&D project, nanced by the European Commission, covered by the H2020 5G-PPP program, that is SELFNET (A Framework for Self-Organized Network Management in Virtualized and Software De ned Networks). Altice Labs is one the participants in the SELFNET consortium, together with 10 more international partners. The project was a vast scope and intends to address Self-Organizing Network (SON) scenarios, and prediction over potential network and services prediction. It is in this context that the evolved version of Altaia will be introduced to the SELFNET project. This thesis proposes to develop the necessary tools to model, persist and perform real-time processing over network infrastructure data. More speci cally, this thesis developed: rstly the Raw and Aggregation Data Model, that uni ed both raw and aggregated data under a single model, secondly the Raw Data Loader, a component that receives network sensed data and transforms it so it can be persisted, lastly the Complex Event Processing Framework, a real-time processing framework for processing data using a dynamic rule-based approach. Out of what it was proposed no objective was left behind, all components were successful developed. The Raw and Aggregation Data Model, together with the Raw Data Loader, enforced SELFNET sensors to follow this model, thus unifying all sensed data under a known model. Moreover, the Complex Event Processing Framework was put into to place, with aggregation rules relative to the SELFNET Self- Protection use case, and is able to provide, in real-time, information about detected botnets around the underlying network. From the development of this framework a new component emerged, a Con guration Manager that manages data to be shared using distributed coordination services, used to apply dynamic rules over the Complex Event Processing Framework. This component is not only a contribution for SELFNET but as well as for Altice Labs. In a more high-level point-of-view, this task brought a new understanding about the role of network management tools for network operators and next-generation networks.
Mais do que tendências e domínios de conhecimento exploratórios, existe a forte convicção na industria de que os paradigmas da virtualizaçao das funções de rede (NFV Network Functions Virtualization) e das redes programáveis (SDN Software Defined Networking) vieram para ficar no mundo dos serviços de telecomunicações. Para que possam navegar esta onda de mudança, os operadores terão que evoluir significativamente a arquitectura da sua rede, os seus mecanismos de gestão e, simultaneamente, o seu negocio. Esta Dissertação de Mestrado pretende contribuir para a evolução dos mecanismos de gestão operacional dos operadores, nomeadamente no domínio da supervisão/monitoria. Em concreto, o trabalho a desenvolver no âmbito desta Dissertação de Mestrado terão como principal objectivo a evolução da plataforma de performance management (Altaia) da Altice Labs para o novo paradigma de rede baseado nos conceitos de virtualizaçao (NFV) e programabilidade (SDN). Importa ainda salientar que as actividades desenvolvidas no âmbito deste trabalho estarão enquadradas num projeto de I&D internacional financiado pela Comissão Europeia no âmbito do programa H2020 5G-PPP designado SELFNET (A Framework for Self-Organized Network Management in Virtualized and Software De- fined Networks). A Altice Labs e um dos participantes no consorcio do SELFNET juntamente com outros 10 parceiros internacionais. O projeto tem um âmbito bastante abrangente e pretende endereçar cenarios de Self- Organizing Networks (SON) em contexto NFV/SDN. Uma das ferramentas essenciais para cenários SON é a detecção e predição de potenciais anomalias da rede e dos serviços. E neste contexto que a versão evolução da da plataforma Altaia ser a utilizada no projeto SELFNET. Esta dissertação propõem o desenvolvimento das ferramentas necessárias para modelar, persistir, e realizar processamento de dados provenientes da infraestrutura de rede em tempo real. Mais especificamente, esta dissertação desenvolveu: primeiramente o Raw and Aggregation Data Model, que unificou ambos dados brutos e agregados num único modelo, em segundo o Raw Data Loader, o componente que recebe dados da rede monitorizada e os transforma de forma a serem persistidos, finalmente a Complex Event Processing Framework, uma estrutura de processamento em tempo real para processar dados usando uma abordagem dinâmica baseada em regras. Dos objectivos propostos todos foram desenvolvidos com sucesso. O Raw and Aggregation Data Model, juntamente com o Raw Data Loader, garantem que os sensors do SELFNET cumprem a especificação do modelo, unificando todos os dados de monitoria num único modelo. Alem disso, a Complex Event Processing Framework foi posta em execução, carregada com regras de agregação relativas ao use case Self-Protection do SELFNET, e e capaz de providenciar, em tempo real, informação sobre botnets detectadas na rede. Do processo de desenvolvimento desta framework, surgiu um novo componente denominado de Con guration Manager, que gere dados que são partilhados usando serviços distribudos de coordenação, usado para aplicar regras dinâmicas sobre a Complex Event Processing Framework. Este componente não foi apenas uma contribuição para o SELFNET mas também para a Altice Labs. Esta tarefa levou a que se percebesse qual e o papel das ferramentas de gestão de rede para as operadoras e para as novas gerações de rede.

APA, Harvard, Vancouver, ISO, and other styles

31

Montanari, Luca. "A Network Function Virtualization Architecture for Distributed IoT Gateways." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2017. http://amslaurea.unibo.it/13345/.

Full text

Abstract:

La virtualizzazione permette a diverse applicazioni di condividere lo stesso dispositivo IoT. Tuttavia, in ambienti eterogenei, reti di dispositivi IoT virtualizzati fanno emergere nuove sfide, come la necessità di fornire on-the-fly e in maniera dinamica, elastica e scalabile, gateway. NFV è un paradigma progettato per affrontare queste nuove sfide. Esso sfrutta tecnologie di virtualizzazione standard per consolidare specifici elementi di rete su generico hardware commerciale. Questa tesi presenta un'architettura NFV per gateway IoT distribuiti, nella quale istanze software dei moduli dei gateway sono ospitate su un'infrastruttura NFV distribuita, la quale è operata e gestita da un IoT gateway Provider. Considereremo diversi IoT Provider, ciascuno con le proprie marche, o loro combinazioni, di sensori e attuatori/robot. Ipotizzeremo che gli ambienti dei provider siano geograficamente distribuiti, per un'efficiente copertura di regioni estese. I sensori e gli attuatori possono essere utilizzati da una varietà di applicazioni, ciascuna delle quali può avere diversi requisiti per interfacce e QoS (latenza, throughput, consumi, ecc...). L'infrastruttura NFV consente di effettuare un deployment elastico, dinamico e scalabile dei moduli gateway in questo ambiente eterogeneo e distribuito. Inoltre, l'architettura proposta è in grado di riutilizzare moduli il cui deployment è stato precedentemente compiuto. Ciò è ottenuto attraverso Service Function Chaining e un'orchestrazione dinamica a runtime. Infine, presenteremo un prototipo basato sulla piattaforma OpenStack.

APA, Harvard, Vancouver, ISO, and other styles

32

Oliveira, Diogo. "Multi-Objective Resource Provisioning in Network Function Virtualization Infrastructures." Scholar Commons, 2018. http://scholarcommons.usf.edu/etd/7206.

Full text

Abstract:

Network function virtualization (NFV) and software-dened networking (SDN) are two recent networking paradigms that strive to increase manageability, scalability, pro- grammability and dynamism. The former decouples network functions and hosting devices, while the latter decouples the data and control planes. As more and more service providers adopt these new paradigms, there is a growing need to address multi-failure conditions, particularly those arising from large-scale disaster events. Overall, addressing the virtual network function (VNF) placement and routing problem is crucial to deploy NFV surviv- ability. In particular, many studies have inspected non-survivable VNF provisioning, however no known work have proposed survivable/resilient solutions for multi-failure scenarios. In light of the above, this work proposes and deploys a survivable multi-objective provisioning solution for NFV infrastructures. Overall, this study initially proposes multi- objective solutions to eciently solve the VNF mapping/placement and routing problem. In particular, a integer linear programming (ILP) optimization and a greedy heuristic meth- ods try to maximize the requests acceptance rate while minimizing costs and implementing trac engineering (TE) load-balancing. Next, these schemes are expanded to perform \risk- aware" virtual function mapping and trac routing in order to improve the reliability of user services. Furthermore, additionally to the ILP optimization and greedy heuristic schemes, a metaheuristic genetic algorithm (GA) is also introduced, which is more suitable for large- scale networks. Overall, these solutions are then tested in idealistic and realistic stressor scenarios in order to evaluate their performance, accuracy and reliability.

APA, Harvard, Vancouver, ISO, and other styles

33

CERRATO, IVANO. "High performance network function virtualization for user-oriented services." Doctoral thesis, Politecnico di Torino, 2016. http://hdl.handle.net/11583/2643656.

Full text

Abstract:

The Network Function Virtualization (NFV) paradigm proposes to transform those network functions today running on dedicated and often closed appliances (e.g., firewall, wan accelerator) into pure software images, called Virtual Network Functions (VNFs), which can be consolidated and executed on high-volume standard servers. In this context, this dissertation focuses on the possibility of enabling each single end user (and not only network operators) to set up network services by means of NFV, allowing him to custoimize the set of services that are active on his Internet connection. This goal mainly requires to address flexibility and performance issues. Regarding to the former, it is important: (i) to support services including both network (e.g., firewall) and cloud (e.g., storage server) applications; (ii) to allow the user to define the service with an intuitive and high-level abstraction, hiding infrastructure-layer details. Instead, with respect to performance, multiple software-based services operating on the user's traffic should not introduce penalties in the user’s Internet experience. This dissertation solves the above issues by proposing a number of improvements in the context of Network Function Virtualization, both in terms of high level models and architectures to define and instantiate network services, and in terms of mechanisms to efficiently interconnect VNFs. Experimental results demonstrate that the goal of allowing end users to deploy services operating on their own traffic is feasible without impacting the Internet experience.

APA, Harvard, Vancouver, ISO, and other styles

34

Oljira, Dejene Boru. "Telecom Networks Virtualization : Overcoming the Latency Challenge." Licentiate thesis, Karlstads universitet, Institutionen för matematik och datavetenskap (from 2013), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-67243.

Full text

Abstract:

Telecom service providers are adopting a Network Functions Virtualization (NFV) based service delivery model, in response to the unprecedented traffic growth and an increasing customers demand for new high-quality network services. In NFV, telecom network functions are virtualized and run on top of commodity servers. Ensuring network performance equivalent to the legacy non-virtualized system is a determining factor for the success of telecom networks virtualization. Whereas in virtualized systems, achieving carrier-grade network performance such as low latency, high throughput, and high availability to guarantee the quality of experience (QoE) for customer is challenging. In this thesis, we focus on addressing the latency challenge. We investigate the delay overhead of virtualization by comprehensive network performance measurements and analysis in a controlled virtualized environment. With this, a break-down of the latency incurred by the virtualization and the impact of co-locating virtual machines (VMs) of different workloads on the end-to-end latency is provided. We exploit this result to develop an optimization model for placement and provisioning of the virtualized telecom network functions to ensure both the latency and cost-efficiency requirements. To further alleviate the latency challenge, we propose a multipath transport protocol MDTCP, that leverage Explicit Congestion Notification (ECN) to quickly detect and react to an incipient congestion to minimize queuing delays, and achieve high network utilization in telecom datacenters.
HITS, 4707

APA, Harvard, Vancouver, ISO, and other styles

35

Östermark, Filip. "Performance Optimization of Virtualized Packet Processing Function for 5G RAN." Thesis, KTH, Radio Systems Laboratory (RS Lab), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-218090.

Full text

Abstract:

The advent of the fifth generation mobile networks (5G) presents many new challenges to satisfy the requirements of the upcoming standards. The 5G Radio Access Network (RAN) has several functions which must be highly optimized to keep up with increasing performance requirements. One such function is the Packet Processing Function (PPF) which must process network packets with high throughput and low latency. A major factor in the pursuit of higher throughput and lower latency is adaptability of 5G technology. For this reason, Ericsson has developed a prototype 5G RAN PPF as a Virtualized Network Function (VNF) using an extended version of the Data Plane Development Kit’s Eventdev framework, which can be run on a general purpose computer. This thesis project optimizes the throughput and latency of a 5G RAN PPF prototype using a set of benchmarking and code profiling tools to find bottlenecks within the packet processing path, and then mitigates the effects of these bottlenecks by changing the configuration of the PPF. Experiments were performed using IxNetwork to generate 2 flows with GTP-u/UDP/IPv4 packets for the PPF to process. IxNetwork was also used to measure throughput and latency of the PPF. The results show that the maximum throughput of the PPF prototype could be increased by 40.52% with an average cut-through latency of 97.59% compared to the default configuration in the evaluated test case, by reassigning the CPU cores, performing the packet processing work in fewer pipeline stages, and patching the RSS function of the packet reception (Rx) driver.
Med den annalkande femte generationen av mobila nätverk (5G) följer en rad utmaningar för att uppnå de krav som ställs av kommande standarder. Den femte generationens Radioaccessnätverk (RAN) har flera funktioner som måste vara väloptimerade för att prestera enligt ökade krav. En sådan funktion är Packet Processing-funktionen (PPF), vilken måste kunna bearbeta paket med hög genomströmning och låg latens. En avgörande faktor i jakten på högre genomströmning och lägre latens är anpassningsbarhet hos 5Gteknologin. Ericsson har därför utvecklat en prototyp av en PPF för 5G RAN som en virtuell nätverksfunktion (VNF) med hjälp av DPDK:s Eventdev-ramverk, som kan köras på en dator avsedd för allmän användning. I detta projekt optimeras genomströmningen och latensen hos Ericssons 5G RAN PPF-prototyp med hjälp av ett antal verktyg för prestandamätning och kodprofilering för att hitta flaskhalsar i pakethanteringsvägen, och därefter minska flaskhalsarnas negativa effekt på PPFens prestanda genom att ändra dess konfiguration. I experimenten användes IxNetwork för att generera 2 flöden med GTP-u/UDP/IPv4-paket som bearbetades av PPFen. IxNetwork användes även för att mäta genomströmning och latens. Resultaten visade att den maximala genomströmningen kunde ökas med 40.52% med en genomsnittlig latens på 97.59% jämfört med den ursprungliga PPF-prototypkonfigurationen i testfallet, genom att omfördela processorkärnor, sammanslå paketbearbetningssteg, och att patcha RSS-funktionen hos mottagardrivaren.

APA, Harvard, Vancouver, ISO, and other styles

36

HE, FUJUN. "Reliable Resource Allocation Models in Network Virtualization." Doctoral thesis, Kyoto University, 2020. http://hdl.handle.net/2433/259077.

Full text

Abstract:

京都大学
0048
新制・課程博士
博士(情報学)
甲第22809号
情博第739号
新制||情||126(附属図書館)
京都大学大学院情報学研究科通信情報システム専攻
(主査)教授大木英司, 教授守倉正博, 教授原田博司
学位規則第4条第1項該当
Doctor of Informatics
Kyoto University
DFAM

APA, Harvard, Vancouver, ISO, and other styles

37

Maiorano, Picone Pasquale Carlo. "A QoS Controller Framework Compliant with the ETSI Network Function Virtualization Specification." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2016. http://amslaurea.unibo.it/10406/.

Full text

Abstract:

The 5th generation of mobile networking introduces the concept of “Network slicing”, the network will be “sliced” horizontally, each slice will be compliant with different requirements in terms of network parameters such as bandwidth, latency. This technology is built on logical instead of physical resources, relies on virtual network as main concept to retrieve a logical resource. The Network Function Virtualisation provides the concept of logical resources for a virtual network function, enabling the concept virtual network; it relies on the Software Defined Networking as main technology to realize the virtual network as resource, it also define the concept of virtual network infrastructure with all components needed to enable the network slicing requirements. SDN itself uses cloud computing technology to realize the virtual network infrastructure, NFV uses also the virtual computing resources to enable the deployment of virtual network function instead of having custom hardware and software for each network function. The key of network slicing is the differentiation of slice in terms of Quality of Services parameters, which relies on the possibility to enable QoS management in cloud computing environment. The QoS in cloud computing denotes level of performances, reliability and availability offered. QoS is fundamental for cloud users, who expect providers to deliver the advertised quality characteristics, and for cloud providers, who need to find the right tradeoff between QoS levels that has possible to offer and operational costs. While QoS properties has received constant attention before the advent of cloud computing, performance heterogeneity and resource isolation mechanisms of cloud platforms have significantly complicated QoS analysis and deploying, prediction, and assurance. This is prompting several researchers to investigate automated QoS management methods that can leverage the high programmability of hardware and software resources in the cloud.

APA, Harvard, Vancouver, ISO, and other styles

38

Heideker, Alexandre. "Gerenciamento flexível de infraestrutura de acesso público à internet com NFV." reponame:Repositório Institucional da UFABC, 2016.

Find full text

Abstract:

Orientador: Prof. Dr. Carlos Alberto Kamienski
Dissertação (mestrado) - Universidade Federal do ABC, Programa de Pós-Graduação em Engenharia da Informação, 2016.
O conceito de Cidades Inteligentes, com a rápida urbanização e adoção de tecnologias como Internet das Coisas (IoT), smartphones e outras tecnologias de computação pervasiva, já é realidade. Esse cenário apresenta uma nova classe de problemas computacionais e de infraestrutura de telecomunicações, exigindo o equacionamento das variáveis flexibilidade, qualidade de serviço e custo, tanto financeiro como ambiental. Tecnologias como Virtualização de Funções de Rede (NFV), Computação em Nuvem e Redes Definidas por Software (SDN) estão em evidência nos últimos anos como promessa para solucionar essas demandas. Este trabalho utiliza a abordagem NFV para solucionar o problema de fornecimento dinâmico e elástico de acesso público à internet nas grandes cidades. Os resultados obtidos demonstram níveis significativos de desempenho e flexibilidade, além da escolha de métricas e comparação de desempenho do KVM, XEN e containers LXC na virtualização de funções de rede.
The concept of Smart Cities is already a reality with rapid urbanization and adoption of technologies like Internet of Things (IoT), smartphones and other pervasive computing technologies. This scenario presents a new class of computational and telecom infrastructure problems, requiring match flexibility, quality of service and cost, both financial and environmental. Technologies like Network Functions Virtualization (NFV), Cloud Computing and Software Defined Networks (SDN) are in evidence in recent years as a promise to address these demands. This paper uses the NFV approach to solving the problem of dynamic and elastic supply of public Internet access in major cities. The results show significant levels of performance and flexibility in addition to the choice of metrics and KVM, XEN and LXC container performance comparison in NFV.

APA, Harvard, Vancouver, ISO, and other styles

39

Kamaruddin, Amalina Farhan. "Experimentation on dynamic congestion control in Software Defined Networking (SDN) and Network Function Virtualisation (NFV)." Thesis, Brunel University, 2017. http://bura.brunel.ac.uk/handle/2438/16917.

Full text

Abstract:

In this thesis, a novel framework for dynamic congestion control has been proposed. The study is about the congestion control in broadband communication networks. Congestion results when demand temporarily exceeds capacity and leads to severe degradation of Quality of Service (QoS) and possibly loss of traffic. Since traffic is stochastic in nature, high demand may arise anywhere in a network and possibly causing congestion. There are different ways to mitigate the effects of congestion, by rerouting, by aggregation to take advantage of statistical multiplexing, and by discarding too demanding traffic, which is known as admission control. This thesis will try to accommodate as much traffic as possible, and study the effect of routing and aggregation on a rather general mix of traffic types. Software Defined Networking (SDN) and Network Function Virtualization (NFV) are concepts that allow for dynamic configuration of network resources by decoupling control from payload data and allocation of network functions to the most suitable physical node. This allows implementation of a centralised control that takes the state of the entire network into account and configures nodes dynamically to avoid congestion. Assumes that node controls can be expressed in commands supported by OpenFlow v1.3. Due to state dependencies in space and time, the network dynamics are very complex, and resort to a simulation approach. The load in the network depends on many factors, such as traffic characteristics and the traffic matrix, topology and node capacities. To be able to study the impact of control functions, some parts of the environment is fixed, such as the topology and the node capacities, and statistically average the traffic distribution in the network by randomly generated traffic matrices. The traffic consists of approximately equal intensity of smooth, bursty and long memory traffic. By designing an algorithm that route traffic and configure queue resources so that delay is minimised, this thesis chooses the delay to be the optimisation parameter because it is additive and real-time applications are delay sensitive. The optimisation being studied both with respect to total end-to-end delay and maximum end-to-end delay. The delay is used as link weights and paths are determined by Dijkstra's algorithm. Furthermore, nodes are configured to serve the traffic optimally which in turn depends on the routing. The proposed algorithm is a fixed-point system of equations that iteratively evaluates routing - aggregation - delay until an equilibrium point is found. Three strategies are compared: static node configuration where each queue is allocated 1/3 of the node resources and no aggregation, aggregation of real-time (taken as smooth and bursty) traffic onto the same queue, and dynamic aggregation based on the entropy of the traffic streams and their aggregates. The results of the simulation study show good results, with gains of 10-40% in the QoS parameters. By simulation, the positive effects of the proposed routing and aggregation strategy and the usefulness of the algorithm. The proposed algorithm constitutes the central control logic, and the resulting control actions are realisable through the SDN/NFV architecture.

APA, Harvard, Vancouver, ISO, and other styles

40

Cardoso, Igor Duarte. "Network infrastructure control for virtual campuses." Master's thesis, Universidade de Aveiro, 2014. http://hdl.handle.net/10773/14707.

Full text

Abstract:

Mestrado em Engenharia de Computadores e Telemática
This dissertation provides a way to merge Cloud Computing infrastructures with traditional or legacy network deployments, leveraging the best in both worlds and enabling a logically centralized control for it. A design/architecture is proposed to extend existing Cloud Computing software stacks so they are able to manage networks outside the Cloud Computing infrastructure, by extending the internal, virtualized network segments. This is useful in a variety of use cases such as incremental Legacy to Cloud network migration, hybrid virtual/ traditional networking, centralized control of existing networks, bare metal provisioning and even offloading of advanced services from typical home gateways into the operator, improving control and reducing maintenance costs. An implementation is presented and tested on top of OpenStack, the principal Open-Source Cloud Computing software stack available. It includes changes to the API, command line interface and existing mechanisms which previously only supported homogeneous vendor equipment, such that they support any hardware and be able to automate their provisioning. By using what is called External Drivers, any organization (an hardware vendor, a Cloud provider or even a telecommunications operator) can develop their own driver to support new, specific networking equipment. Besides this ease of development and extensibility, two drivers are already developed in the context of this work: one for OpenWrt switches/routers and one for Cisco EtherSwitch IOS switching modules. Test results indicate that there are low penalties on latency and throughput, and that provisioning times (for setting up or tearing down networks) are reduced in comparison with similar maintenance operations on traditional computer networks.
Esta dissertação apresenta uma forma de juntar infrastruturas Cloud Computing com redes tradicionais ou legadas, trazendo o melhor de ambos os mundos e possibilitando um controlo logicamente centralizado. Uma arquitetura é proposta com o intuito de extender implementações de Cloud Computing para que possam gerir também redes fora da infrastrutura de Cloud Computing, extendendo os segmentos de rede internos, virtualizados. Isto é útil para um variado conjunto de casos de uso, tais como migração incremental de redes legadas para a Cloud, redes híbridas virtuais/tradicionais, controlo centralizado de redes já existentes, aprovisionamento de bare metal e até mesmo a passagem de serviços tipicamente fornecidos por um home gateway para o lado do operador, melhorando o controlo e reduzindo custos de manutenção. Uma implementação da solução é apresentada e testada em cima do OpenStack, a principal solução Open-Source de Cloud Computing disponível. A implementação inclui alterações à API, à interface de linha de comandos e aos mecanismos já existentes, que apenas suportam implementações homogéneas, para que possam suportar qualquer equipamento e automatizar o aprovisionamento dos mesmos. Através daquilo que se chamam drivers externos, qualquer organização (seja um fabricante de equipamentos de rede, um fornecedor de Cloud ou uma operadora de telecomunicações) pode desenvolver o seu próprio drivers para suportar novos, específicos equipamentos de hardware. Para além da facilidade de desenvolvimento e extensibilidade, dois drivers são também fruto deste trabalho: um para switches/routers OpenWrt e outro para os módulos de switching Cisco EtherSwitch, sistema operativo IOS. Testes efetuados indicam que há baixas penalizações na latência e largura de banda, e ainda que os tempos de aprovisionamento são reduzidos em comparação com semelhantes operações de manutenção em redes informáticas tradicionais.

APA, Harvard, Vancouver, ISO, and other styles

41

Hsieh, Cheng-Liang. "Design and Implementation of Scalable High-Performance Network Functions." OpenSIUC, 2017. https://opensiuc.lib.siu.edu/dissertations/1416.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

42

Al-Kaseem, Bilal R. "Optimised cloud-based 6LoWPAN network using SDN/NFV concepts for energy-aware IoT applications." Thesis, Brunel University, 2017. http://bura.brunel.ac.uk/handle/2438/15642.

Full text

Abstract:

The Internet of Things (IoT) concept has been realised with the advent of Machineto-Machine (M2M) communication through which the vision of future Internet has been revolutionised. IPv6 over Low power Wireless Personal Area Networks (6LoWPAN) provides feasible IPv6 connectivity to previously isolated environments, e.g. wireless M2M sensors and actuator networks. This thesis's contributions include a novel mathematical model, energy-efficient algorithms, and a centralised software controller for dynamic consolidation of programmability features in cloud-based M2M networks. A new generalised joint mathematical model has been proposed for performance analysis of the 6LoWPAN MAC and PHY layers. The proposed model differs from existing analytical models as it precisely adopts the 6LoWPAN specifications introduced by the Internet Engineering Task Force (IETF) working group. The proposed approach is based on Markov chain modelling and validated through Monte-Carlo simulation. In addition, an intelligent mechanism has been proposed for optimal 6LoWPAN MAC layer parameters set selection. The proposed mechanism depends on Artificial Neural Network (ANN), Genetic Algorithm (GA), and Particles Swarm Optimisation (PSO). Simulation results show that utilising the optimal MAC parameters improve the 6LoWPAN network throughput by 52-63% and reduce end-to-end delay by 54-65%. This thesis focuses on energy-efficient data extraction and dissemination in a wireless M2M sensor network based on 6LoWPAN. A new scalable and self-organised clustering technique with a smart sleep scheduler has been proposed for prolonging M2M network's lifetime and enhancing network connectivity. These solutions succeed in overcoming performance degradation and unbalanced energy consumption problems in homogeneous and heterogeneous sensor networks. Simulation results show that by adopting the proposed schemes in multiple mobile sink sensory field will improve the total aggregated packets by 38-167% and extend network lifetime by 30-78%. Proof-of-concept real-time hardware testbed experiments are used to verify the effectiveness of Software-Defined Networking (SDN), Network Function Virtualisation (NFV) and cloud computing on a 6LoWPAN network. The implemented testbed is based on open standards development boards (i.e. Arduino), with one sink, which is the M2M 6LoWPAN gateway, where the network coordinator and the customised SDN controller operated. Experimental results indicate that the proposed approach reduces network discovery time by 60% and extends the node lifetime by 65% in comparison with the traditional 6LoWPAN network. Finally, the thesis is concluded with an overall picture of the research conducted and some suggestions for future work.

APA, Harvard, Vancouver, ISO, and other styles

43

Raza, Muhammad Rehan. "Flexible and Programmable 5G Transport Networks." Licentiate thesis, KTH, Optical Network Laboratory (ON Lab), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-196525.

Full text

Abstract:

The advent of 5th generation of mobile networks (5G) will introduce some new challenges for the transport network. Different strategies can be employed by the network providers to address these challenges with the aim to achieve an efficient utilization of network resources. The most feasible option to achieve this goal is to introduce intelligence in the transport infrastructure by designing a flexible and programmable transport network. Network function virtualization (NFV) and dynamic resource sharing (DRS) are two possible techniques for realizing a flexible transport network. NFV allows to dynamically push network functions to different locations in the network, while DRS allows for sharing transport resources in a flexible manner. Both of these strategies can be realized by employing a programmable control framework based on software defined networking (SDN), which has implications on both the network data and control planes. However, this thesis specifically focuses on the data plane aspects of NFV and the control plane aspects of DRS. Considering the network caching as a specific example of network function, the data plane aspects of NFV are studied in terms of different architectural options for cache placement in order to see which options are the most efficient in terms of network power consumption and cost. The results presented in this thesis show that placing large-sized caches farther in the network for a large group of users is the most efficient approach. The control plane aspects of DRS are analyzed in terms of which provisioning strategy should be used for sharing a limited amount of transport resources. The analysis is presented for both a single-tenant case (i.e., where the role of service and network provider is played by the same entity), and a multi-tenant case (i.e., where a network provider manages the resources assigned to different service providers in an intelligent way). The results show that DRS performs much better than the conventional static approach (i.e., without sharing of resources), which translates into significant cost savings for the network providers.

QC 20161115

APA, Harvard, Vancouver, ISO, and other styles

44

van, 't Hof David M. "Service Provisioning in SDN using a Legacy Network Management System." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-204957.

Full text

Abstract:

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.
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.

APA, Harvard, Vancouver, ISO, and other styles

45

Di, Santi Silvio. "5G Network Architecture." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2020. http://amslaurea.unibo.it/20432/.

Full text

Abstract:

In this work the 5G core network architecture has been explored: starting from the enabling technologies that are supporting the "revolution" and looking in depth at the current 4G LTE network architecture, we tried to find a solution to bridge the gap between these two totally different architecture. Once the solution has been found, we used a simulation platform provided by the ONF (Open Networking Foundation) that demonstrates the feasibility of such approach.

APA, Harvard, Vancouver, ISO, and other styles

46

Remeš, Jan. "Virtualizace vstupních a výstupních operací v počítačových sítích." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2017. http://www.nusl.cz/ntk/nusl-363900.

Full text

Abstract:

This work deals with virtualization of computer systems and network cards in high-speed computer networks, and describes implementation of the SR-IOV virtualization technology support in the COMBO network card platform. Various approaches towards network card virtualization are compared, and the benefits of the SR-IOV technology for high performance applications are described. The work gives overview of the COMBO platform and describes design and implementation of the SR-IOV technology support for the COMBO platform. The work concludes with measurement and analysis of the implemented technology performance in virtual machines. The result of this work is the COMBO cards' support for the SR-IOV technology, which makes it possible to use them in virtual machines with wire-speed performance preserved. This allows future COMBO cards to be used as accelerators in the networks utilizing the Network Function Virtualization.

APA, Harvard, Vancouver, ISO, and other styles

47

SPINOSO, SERENA. "Verification and Configuration of Software-based Networks." Doctoral thesis, Politecnico di Torino, 2017. http://hdl.handle.net/11583/2676611.

Full text

Abstract:

The innovative trends of Network Function Virtualization (NFV) and Software Defined Networking (SDN) have posed never experienced opportunities in productive environments, like data centers. While NFV decouples software implementation of the network functions (e.g., DPI and NAT) from their physical counterparts, SDN is in charge of dynamically changing those functions to create network paths. One new opportunity of such Software-based networks is to make the network service-provisioning models more flexible, by enabling users to build their own service graphs: users can select the Virtual Network Functions (VNFs) to use and can specify how packets have to be processed and forwarded in their networks. In particular, this PhD thesis spans mostly topics related to the verification and configuration of service graphs. For what concerns the challenges of network verification, our aim is to explore strategies that overcome the limitations of traditional techniques, which generally exploit complex modelling approaches and takes considerable verification times. Thus we envision for verification techniques that are based on non-complex modelling approaches in order to be much more efficient than existing proposals. Under these conditions, such novel approaches may work at run-time and, in particular, may be performed before deploying the service graphs, in order to avoid unexpected network behaviours and detect errors as early as possible. Another requirement is that verification should take a reasonable amount of time from a VNF Orchestrator point of view, with fair processing resources (e.g. CPU, memory and so on). This is because we are in the context of flexible services, where the reconfiguration of network functions can be frequently triggered, both in case of user request and in case of management events. The first contribution of this thesis lays on the service graphs specification by means of forwarding policies (i.e, a high-level specification of how packet flows are forwarded). While the majority of the SDN verification tools operate on OpenFlow configurations, we have defined a formal model to detect a set of anomalies in forwarding policies (i.e., erroneous specifications that may cause misleading network conditions and states). The key factors that distinguish our work from existing approaches are both an early detection of policies anomalies (i.e., before translating such policies into OpenFlow entries), in order to speed up the fixing phase, without even starting service deployment, and a scalable approach that achieves verification times in the order of milliseconds for medium- large- sized networks. Another advancement in network verification has been the possibility to verify networks including stateful VNFs, which are functions that may dynamically change the forwarding path of a traffic flow according to their local algorithms and states (e.g., IDSs). Our second contribution is thus a verification approach that models the network and the involved (possibly stateful) VNFs as a set of FOL formulas. Those formulas are passed to the off-the-shelf SMT (Satisfiability Modulo Theory) solver Z3 in order to verify some reachability-based properties. In particular, the proposed solution has been implemented in a tool released under the AGPLv3 license, named VeriGraph, which takes the functional configurations of all deployed VNFs (e.g., filtering rules on firewalls) into account to check the network. The adopted approach achieves verification times in the order of milliseconds, which is compliant with the timing limitations needed by a VNF Orchestrator. Finally, for what concerns the configuration of VNFs, service graph deployment should include a strategy to deploy VNF configurations in order to fix bugs in case of verification failures. Here, we have to face several challenges like the different ways a network function may require for being configured (REST API, CLI, etc...) and the configuration semantic that depends on the function itself (e.g., router parameters are clearly different from firewall ones). We conclude this thesis by proposing a model-based configuration approach, which means defining a representation of the main configuration parameters of a VNF. This VNF model is then automatically processed by further software modules in the VNF architecture to translate the configuration parameters into a particular format required by a VNF and to deliver the produced configuration into the VNF following one of the configuration strategies (e.g., REST, configuration file, etc.) already supported by the function. The achieved results of this last work, w.r.t. the current state of the art, are the exploitation of a model-driven approach that achieves a higher flexibility and the insertion of non-VNF-specific software modules to avoid changes in the VNF implementation.

APA, Harvard, Vancouver, ISO, and other styles

48

Xirouchakis, Michail. "Traffic Load Predictions Using Machine Learning : Scale your Appliances a priori." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-254906.

Full text

Abstract:

Layer 4-7 network functions (NF), such as Firewall or NAPT, have traditionally been implemented in specialized hardware with little to no programmability and extensibility. The scientific community has focused on realizing this functionality in software running on commodity servers instead. Despite the many advancements over the years (e.g., network I/O accelerations), software-based NFs are still unable to guarantee some key service-level objectives (e.g., bounded latency) for the customer due to their reactive approach to workload changes. This thesis argues that Machine Learning techniques can be utilized to forecast how traffic patterns change over time. A network orchestrator can then use this information to allocate resources (network, compute, memory) in a timely fashion and more precisely. To this end, we have developed Mantis, a control plane network application which (i) monitors all forwarding devices (e.g., Firewalls) to generate performance-related metrics and (ii) applies predictors (moving average, autoregression, wavelets, etc.) to predict future values for these metrics. Choosing the appropriate forecasting technique for each traffic workload is a challenging task. This is why we developed several different predictors. Moreover, each predictor has several configuration parameters which can all be set by the administrator during runtime. In order to evaluate the predictive capabilities of Mantis, we set up a test-bed, consisting of the state-of-the-art network controller Metron [16], a NAPT NF realized in FastClick [6] and two hosts. While the source host was replaying real-world internet traces (provided by CAIDA [33]), our Mantis application was performing predictions in real time, using a rolling window for training. Visual inspection of the results indicates that all our predictors have good accuracy, excluding (i) the beginning of the trace where models are still being initialized and (ii) instances of abrupt change. Moreover, applying the discrete wavelet transform before we perform predictions can improve the accuracy further.
Nätverksfunktioner i lager 4-7 som t.ex. brandväggar eller NAPT har traditionellt implementeras på specialdesignad hårdvara med väldigt få programeringsegenskaper. Forskning inom datakomunikation har fokuserat på att istället möjliggöra dessa funktioner i mjukvara på standardhårdvara. Trots att många framsteg har gjorts inom området under de senaste åren (t.ex. nätverks I/O accelerering), kan inte mjukvarubaserade nätverksfunktioner garantera önskad tjänstenivå för kunderna (t.ex. begränsade latensvärden) p.g.a. det reaktiva tillvägagångsättet när arbetslasten ändras. Den här avhandlingen visar att med hjälp av maskininlärning så går det att förutse hur trafikflöden ändras över tid. Nätverksorkestrering kan sedan användas för att allokera resurser (bandbredd, beräkning, minne) i förväg samt mer precist. För detta ändamål har vi utvecklat Mantis, en nätverksapplikation i kontrolplanet som övervakar alla nätverksenheter för att generera prestandabaserade mätvärden och använder matematiska prediktorer (moving average, autoregression, wavelets, o.s.v.) för att förutse kommande ändringar i dessa värden. Det är en utmaning att välja rätt metod för att skapa prognosen för varje resurs. Därför har vi utvecklat flera olika prediktorer. Dessutom har varje prediktor flera konfigurationsvärden som kan ändras av administratören. För att utvärdera Mantis prognoser har vi satt upp ett testnätverk med en av marknadens ledande nätverkskontrollers, Metron [16], en NAPT nätverksfunktion implementerad med FastClick [6] och två testnoder. Den ena noden skickar data hämtad från verklig Internettrafik (erhållen från CAIDA [33]) samtidigt som vår applikation, Mantis, skapar prognoser i realtid. Manuell inspektion av resultaten tyder på att alla våra prediktorer har god precision, förutom början av en spårning då modellerna byggs upp eller vid abrupt ändring. Dessutom kan precisionen ökas ytterligare genom att använda diskret wavelet transformering av värdena innan prognosen görs.

APA, Harvard, Vancouver, ISO, and other styles

49

Banik, Pushpanjali. "Software defined virtualized cloud radio access network (SD-vCRAN) and programmable EPC for 5G." Thesis, Brunel University, 2018. http://bura.brunel.ac.uk/handle/2438/16225.

Full text

Abstract:

This thesis focuses on proposing a Software Defined Network (SDN) based programmable and capacity optimized backhaul and core network which is critical for 5G network design. Cloud Radio Access networks (CRAN) which is key enabler of 5G networks can address a number of challenges that mobile operators face while trying to support ever-growing end-users' needs towards 5th generation of mobile networks (5G). A novel layered and modular programmable CRAN architecture called Software Defined Virtualised Cloud Radio Access Network (SD-vCRAN) is introduced with Network Function Virtualization (NFV) and Software Defined Network (SDN) capabilities. The SDN-Base Band Unit (BBU) pool is shifted to the programmable core network site, where a centralised SDN controller manages the network servers and virtualised network function entities - Mobile Management Entity (MME), Serving/Packet Data Network Data plane (S/PGW-D), Serving/Packet Data Network Control plane (S/PGW-C), Software Network Defined Baseband Unit (SDN-BBU) and Local controllers (LC) via OpenFlow (OF) protocol. This approach simplifies network operations, improve traffic management, enable system-wide optimisation of Quality of Service (QoS) and network-aware application development. The control plane (excluding the preserved 3GPP standard interfaces: S1-MME, S6a, Gx) managed by the network servers provides load balancing, traffic management and optimisation tools for the data plane. The proposed work starts by reviewing the requirements of 5G networks, followed by discussion on 5G backhaul and core challenge. Then, an overview of CRAN, Evolved Programmable Core (EPC), SDN, NFV and related works. The simulation details of the proposed architecture are discussed along with the challenges faced by adopting SDN and NFV in mobile core. A thorough assessment of the interfaces and protocols that should be conserved or enhanced on both data and control plane is conducted. The result enables an architecture where the SDN-BBU pool shares a single cloud with the programmable EPC and the control plane is migrated from the network elements to a centralized controller, running on a virtual machine in the mobile core. The data and control plane separation removes overlaps and provides better signalling, as well as efficient network functioning to comply with latency demands. The proposed system performance is validated in terms of throughput, datagram loss, and packet delay variation under three scenarios: 1. single policy installation, 2. multiple policy installation and 3. load balancing. The load balancing performance of proposed system is validated comparing the performance of two different SDN controllers: Floodlight and OpenDaylight, where the later performs better in terms of throughput (no bandwidth restriction), packet loss (below 0.3%) and jitter (below 0.2ms). Furthermore, a detailed comparison of two SDN controller's - Floodlight and OpenDaylight performances is presented, which shows that OpenDaylight performs better only for less dense networks which needs less processing of messages without being blocked, and the Floodlight performs better in ultra-dense network. Some directions and preliminary thoughts for future work and necessary information to operators for building their roadmap to the upcoming technologies is presented.

APA, Harvard, Vancouver, ISO, and other styles

50

VIRGILIO, MATTEO. "Study and analysis of innovative network protocols and architectures." Doctoral thesis, Politecnico di Torino, 2016. http://hdl.handle.net/11583/2643655.

Full text

Abstract:

In the last years, some new paradigms are emerging in the networking area as inspiring models for the definition of future communications networks. A key example is certainly the Content Centric Networking (CCN) protocol suite, namely a novel network architecture that aims to supersede the current TCP/IP stack in favor of a name based routing algorithm, also introducing in-network caching capabilities. On the other hand, much interest has been placed on Software Defined Networking (SDN), namely the set of protocols and architectures designed to make network devices more dynamic and programmable. Given this complex arena, the thesis focuses on the analysis of these innovative network protocols, with the aim of exploring possible design flaws and hence guaranteeing their proper operation when actually deployed in the network. Particular emphasis is given to the security of these protocols, for its essential role in every wide scale application. Some work has been done in this direction, but all these solutions are far to be considered fully investigated. In the CCN case, a closer investigation on problems related to possible DDoS attacks due to the stateful nature of the protocol, is presented along with a full-fledged proposal to support scalable PUSH application on top of CCN. Concerning SDN, instead, we present a tool for the verification of network policies in complex graphs containing dynamic network functions. In order to obtain significant results, we leverage different tools and methodologies: on the one hand, we assess simulation software as very useful tools for representing the most common use cases for the various technologies. On the other hand, we exploit more sophisticated formal methods to ensure a higher level of confidence for the obtained results.

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic 'Network Function Virtualization (NFV)'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles