Dissertations / Theses on the topic 'Virtualization of network functions'
To see the other types of publications on this topic, follow the link: Virtualization of network functions.
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Virtualization of network functions.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
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 textAbstract:
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.
2
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 textAbstract:
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.
3
HE, FUJUN. "Reliable Resource Allocation Models in Network Virtualization." Doctoral thesis, Kyoto University, 2020. http://hdl.handle.net/2433/259077.
Full textAbstract:
京都大学0048
新制・課程博士
博士(情報学)
甲第22809号
情博第739号
新制||情||126(附属図書館)
京都大学大学院情報学研究科通信情報システム専攻
(主査)教授 大木 英司, 教授 守倉 正博, 教授 原田 博司
学位規則第4条第1項該当
Doctor of Informatics
Kyoto University
DFAM
4
Hsieh, Cheng-Liang. "Design and Implementation of Scalable High-Performance Network Functions." OpenSIUC, 2017. https://opensiuc.lib.siu.edu/dissertations/1416.
Full textAbstract:
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.
5
Nobach, Leonhard [Verfasser], Ralf [Akademischer Betreuer] Steinmetz, and Wolfgang [Akademischer Betreuer] Kellerer. "Seamless Flexibility in High-Performance Network Functions Virtualization / Leonhard Nobach ; Ralf Steinmetz, Wolfgang Kellerer." Darmstadt : Universitäts- und Landesbibliothek Darmstadt, 2018. http://d-nb.info/117198815X/34.
Full text
6
Alleg, Abdelhamid. "Service Function Placement and Chaining in Network Function Virtualization Environments." Thesis, Bordeaux, 2019. http://www.theses.fr/2019BORD0117.
Full textAbstract:
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’usagesThe 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
7
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 textAbstract:
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.
8
Gao, Meihui. "Models and Methods for Network Function Virtualization (NFV) Architectures." Thesis, Université de Lorraine, 2019. http://www.theses.fr/2019LORR0025/document.
Full textAbstract:
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
9
Oliveira, Diogo. "Multi-Objective Resource Provisioning in Network Function Virtualization Infrastructures." Scholar Commons, 2018. http://scholarcommons.usf.edu/etd/7206.
Full textAbstract:
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.
10
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 textAbstract:
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.
11
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 textAbstract:
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.
12
Houidi, Omar. "Algorithms for Virtual Network Functions chaining." Electronic Thesis or Diss., Institut polytechnique de Paris, 2020. http://www.theses.fr/2020IPPAS005.
Full textAbstract:
Cette thèse traite du placement optimal et heuristique de fonctions réseau et de chaînes de fonction réseau dans des infrastructures cloud et réseau virtualisées. L'émergence de la virtualisation des fonctions réseau, connu sous l'acronyme NFV pour Network Function Virtualization, permet de découpler les fonctions réseau en mode logiciel du matériel d'hébergement et de s'appuyer sur des serveurs génériques et d'éviter l'usage de, et la dépendance à, des matériels dédiés voire propriétaires.Le placement de fonctions réseau virtualisées (représentées par VNF, Virtualized Network Functions) est NP-Difficile puisqu'il s'agit de projeter un petit graphe de ressources virtuelles sur un graphe plus grand (graphe de l'infrastructure d'hébergement). Les solutions optimales, en particulier la programmation linéaire en nombre entier (ILP), ne passent pas à l'échelle. Sachant que la demande est dynamique et peut varier dans le temps et que le réseau est lui même variable dans le temps, il est important de prévoir des adaptations des placements. Cela peut s'effectuer par de l'élasticité sur les ressources d'hébergement réservées à une fonction réseau virtualisée, à un graphe de service réseau et par une extension du graphe de service lui même en fonction du contexte et des exigences des utilisateurs ou tenants.La thèse propose une famille d'algorithmes pour le placement de chaînes de services (ou fonctions) réseau avec la possibilité d'étendre les ressources d'hébergement des VNFs (c'est à dire assurer l'élasticité du service d'hébergement en augmentant les ressources allouées ou en générant plusieurs instances de VNFs pour écouler le trafic et répondre à la demande) en plus du placement initial. Une solution en programmation en nombre entier est élaborée et aussi utilisée comme référence pour une comparaison avec l'état de l'art et avec les extensions proposées. L'optimisation étant effectuée en instantanée au fur à mesure de l'arrivée des demandes, une à la fois, une solution qui regroupe plusieurs demandes pour y répondre simultanément, en élaborant un graphe composite, permet d'améliorer les performances. Cette approche connue sous le nom de "batch" n'améliore que partiellement la performance, la récompense sur le long terme (en efficacité, minimisation des ressources consommées, et en équilibrage de charge) est nécessairement limitée.La thèse s'est penchée aussi sur l'extension de graphes de services réseau, de tenants, déjà déployés, en adoptant une approche de type arbre de recouvrement, Spanning Tree. Plus spécifiquement une modélisation du problème en un "Steiner Tree Problem" a conduit à des performances proches de l'optimal pour des extensions de graphes au fil des demandes, en les traitant séparément. Les travaux de thèse sont par la suite revenus sur la rentabilité sur le long terme des algorithmes, en approchant le placement de chaînes de services et fonctions réseau comme un objectif long terme via de l'apprentissage par renforcement en se souciant plus de la rentabilité et de l'efficacité long terme des algorithmes contrairement aux approches visant exclusivement l'optimalité instantanée à chaque nouvelle demande.Cette thèse a permis de faire avancer autant que faire se peut l'état de l'art du placement optimal dans les infrastructures cloud et réseau partagées. Notamment, le problème, et besoin, d'extension de graphes, de tenants, déjà déployés, sans perturber l'hébergement initial, a reçu peu d'attention. Pourtant ce besoin est essentiel pour répondre à des déploiements additionnels de nouvelles fonctions et services réseau, et pour réagir aux dégradations et à l'accroissement de la demande, aux attaques et pour assurer l'introduction de nouveaux services et fonctions de sécurité autour du graphe initial. L'approche peut aussi répondre à des modifications de graphes et d'isolations d'une partie (défectueuse ou compromise) d'un graphe et de son remplacement par d'autres services et graphes fiables et non altérésNetwork Function Virtualization (NFV) is an innovative emerging concept that decouples network functions (such as firewalls, DNS, NATs, load balancers, etc.) from dedicated hardware devices (the traditional expensive middleboxes). This decoupling enables hosting of network services, known as Virtualized Network Functions (VNFs), on commodity hardware (such as switches or servers) and thus facilitates and accelerates service deployment and management by providers, improves flexibility, leads to efficient and scalable resource usage, and reduces costs. This paradigm is a major turning point in the evolution of networking, as it introduces high expectations for enhanced economical network services, as well as major technical challenges.One of the main technical challenges in this domain is the optimal placement of the VNFs within the hosting infrastructures. This placement has a critical impact on the performance of the network, as well as on its reliability and operation cost. The VNF Placement and Chaining Problem is NP-Hard and there is a need for placement approaches that can scale with problem size and find good solutions in acceptable times. The overarching goal of this thesis is to enable dynamic virtual network resources provisioning to deal with demand fluctuation during the virtual network lifetime, and to enhance the substrate resource usage. Reserving a fixed amount of resources is inefficient to satisfy the VNF resource requirements. To cope with these problems, we propose dynamic resource management strategies.In this thesis, both exact and heuristic algorithms are designed and evaluated in terms of optimality, complexity, ability to scale, and compared with the state of the art. Elastic mechanisms and scaling algorithms are first presented to improve adaptation and deployment of virtualized network functions in NFV infrastructures to support increasing demand while increasing provider's revenue. Since network providers not only need to control, classify and steer user and application traffic flows in their dedicated slices but also want to extend their already acquired and operational virtual networks or slices with additional service graphs, the thesis proposes extension algorithms of already hosted network functions graphs without disrupting initially deployed and active service instances. The proposed algorithms extend already deployed network services and functions graphs to respond to new demands while taking into account the constraint of minimizing the impact on the original service graphs. The extension algorithms are particularly useful and suitable for situations where already deployed graphs need to be enhanced with new features and properties (adding new functions) and modified to react to degradation and attacks such as removing a fraction of the graph and replacing with new complex and composed functions into more capable and uncompromised graphs.The thesis also addresses the VNF placement and chaining problem in an online and in a batch mode to improve performance in terms of longer time reward. An enhanced Reinforcement Learning-based approach is also proposed to improve the long term reward beyond what the previous methods can achieve. This is analyzed and realized for a load balancing objective but can be adjusted for other criteria
13
Rankothge, Windhya. "Towards virtualized network functions as a service." Doctoral thesis, Universitat Pompeu Fabra, 2017. http://hdl.handle.net/10803/402892.
Full textAbstract:
Network Function Virtualization (NFV) is a promising technology that proposes to move packet processing from dedicated hardware middle-boxes to software running on commodity servers. As such, NFV brings the possibility of outsourcing enterprise Network Function (NFs) processing to the cloud.
However, for a Cloud Service Provider (CSP) to offer such services, several research problems still need to be addressed. When an enterprise outsources its NFs to a CSP, the CSP is responsible for deciding: (1) where initial Virtual NFs (VNFs) should be instantiated, and (2) what, when and where additional VNFs should be instantiated to satisfy the traffic changes (scaling), (3) how to update the network configurations with minimum impact on network performances, etc. This brings the requirement of a cloud management framework for VNFs and the cloud infrastructure related operations: provisioning, configuring, maintaining and scaling of the VNFs, as well as configuring and updating of the cloud network.
In this thesis we explore three aspects of a cloud management framework for VNF: (1) dynamic resource allocation, (2) VNFs scaling methods and (3) dynamic load balancing.
In the context of dynamic resource allocation for VNFs, we explore two resource allocation algorithms for: (1) the initial placement of VNFs, and (2) the scaling of VNFs to support traffic changes. We propose two approximation approaches (heuristic based): (1) Iterated Local Search (ILS) and (2) Genetic Programming (GP) to implement the resource allocation algorithms. We compare these heuristic based approaches with a traditional resource allocation approach: Integer Linear Programming (ILP). In the context of VNFs scaling methods, we explored three different scaling approaches: (1) vertical scaling, (2) migration and (3) horizontal. We analyse the three scaling methods in-terms of their practical implementation aspects as well as the optimization aspects with respect to the management. In the context of dynamic load balancing, we explore load balancing approaches that maintain affinity and handle states and sessions of the traffic, so that the requirement of state migration is avoided. We propose a session-aware load balancing algorithm based on consistent hashing.La virtualización de funciones de redes (NFV) es una tecnología prometedora que propone mover el procesamiento de paquetes de cajas intermedias de hardware dedicadas al procesamiento especializado de paquetes a módulos de software que se ejecuta en servidores no especializados. Como tal, NFV crea la posibilidad de externalizar de las redes empresariales el procesamiento hecho por funciones de redes (NFs) a la nube. Sin embargo, para que un Proveedor de Servicios en la Nube (CSP) ofrezca tales servicios, todavía hay que resolver varios problemas. Cuando una empresa subcontrata sus NF a un CSP, el CSP es responsable de decidir: (1) dónde deben instanciarse las NF virtuales iniciales (VNF), y (2) qué tipo, cuándo y dónde deben instanciarse VNF adicionales para satisfacer los cambios de tráfico (Escalamiento), (3) cómo actualizar las configuraciones de la red con el mínimo impacto en los rendimientos de la misma, etc. Esto requiere de un marco de gestión de la nube para VNFs y las operaciones relacionadas con la infraestructura de nube: provisiona miento, mantenimiento y escalado de les VNS. Así como la configuración y actualización de la red en la nube. En esta tesis exploramos tres aspectos de un marco de gestión de la nube para VNF: (1) asignación dinámica de recursos, (2) métodos de escalado para VNFs y (3) balanceo de carga dinámico. En el contexto de la asignación dinámica de recursos para VNFs, exploramos dos algoritmos de asignación de recursos para: (1) la ubicación inicial de VNFs, y (2) la escala de VNFs para apoyar los cambios de tráfico. Proponemos dos métodos de aproximación (basadas en heurísticas): (1) Búsqueda Local Iterada (ILS) y (2) Programación Genética (GP) para implementar los algoritmos de asignación de recursos. Comparamos estos enfoques heurísticos con en un enfoque tradicional de asignación de recursos: Programación Lineal Entera (ILP). En el contexto de los métodos de escalde VNFs, hemos explorado tres enfoques de escala diferentes: (1) escalamiento vertical, (2) la migración y (3) horizontal. Analizamos los tres métodos de escalado en términos de sus aspectos de implementación práctica, así como los aspectos de optimización con respecto a la gestión. En el contexto del balanceo de carga dinámico, exploramos enfoques de equilibrio de carga que mantienen la afinidad y manejan estados y sesiones del tráfico, de manera que se evita el la necesidad de migración del estado. Proponemos un algoritmo de equilibrio de carga que considera sesiones basado en funciones de hash consistente.
14
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 textAbstract:
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.
15
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 textAbstract:
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.
16
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 textAbstract:
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.
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 textAbstract:
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 utiNetwork 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).
18
Soares, João Monteiro. "Integration of the cloud computing paradigm with the opeerator network’s infrastructure." Doctoral thesis, Universidade de Aveiro, 2015. http://hdl.handle.net/10773/14854.
Full textAbstract:
Doutoramento em Engenharia InformáticaThe proliferation of Internet access allows that users have the possibility to use services available directly through the Internet, which translates in a change of the paradigm of using applications and in the way of communicating, popularizing in this way the so-called cloud computing paradigm. Cloud computing brings with it requirements at two different levels: at the cloud level, usually relying in centralized data centers, where information technology and network resources must be able to guarantee the demand of such services; and at the access level, i.e., depending on the service being consumed, different quality of service is required in the access network, which is a Network Operator (NO) domain. In summary, there is an obvious network dependency. However, the network has been playing a relatively minor role, mostly as a provider of (best-effort) connectivity within the cloud and in the access network. The work developed in this Thesis enables for the effective integration of cloud and NO domains, allowing the required network support for cloud. We propose a framework and a set of associated mechanisms for the integrated management and control of cloud computing and NO domains to provide endto- end services. Moreover, we elaborate a thorough study on the embedding of virtual resources in this integrated environment. The study focuses on maximizing the host of virtual resources on the physical infrastructure through optimal embedding strategies (considering the initial allocation of resources as well as adaptations through time), while at the same time minimizing the costs associated to energy consumption, in single and multiple domains. Furthermore, we explore how the NO can take advantage of the integrated environment to host traditional network functions. In this sense, we study how virtual network Service Functions (SFs) should be modelled and managed in a cloud environment and enhance the framework accordingly. A thorough evaluation of the proposed solutions was performed in the scope of this Thesis, assessing their benefits. We implemented proof of concepts to prove the added value, feasibility and easy deployment characteristics of the proposed framework. Furthermore, the embedding strategies evaluation has been performed through simulation and Integer Linear Programming (ILP) solving tools, and it showed that it is possible to reduce the physical infrastructure energy consumption without jeopardizing the virtual resources acceptance. This fact can be further increased by allowing virtual resource adaptation through time. However, one should have in mind the costs associated to adaptation processes. The costs can be minimized, but the virtual resource acceptance can be also reduced. This tradeoff has also been subject of the work in this Thesis.
A proliferação do acesso à Internet permite aos utilizadores usar serviços disponibilizados diretamente através da Internet, o que se traduz numa mudança de paradigma na forma de usar aplicações e na forma de comunicar, popularizando desta forma o conceito denominado de cloud computing. Cloud computing traz consigo requisitos a dois níveis: ao nível da própria cloud, geralmente dependente de centros de dados centralizados, onde as tecnologias de informação e recursos de rede têm que ser capazes de garantir as exigências destes serviços; e ao nível do acesso, ou seja, dependendo do serviço que esteja a ser consumido, são necessários diferentes níveis de qualidade de serviço na rede de acesso, um domínio do operador de rede. Em síntese, existe uma clara dependência da cloud na rede. No entanto, o papel que a rede tem vindo a desempenhar neste âmbito é reduzido, sendo principalmente um fornecedor de conectividade (best-effort) tanto no dominio da cloud como no da rede de acesso. O trabalho desenvolvido nesta Tese permite uma integração efetiva dos domínios de cloud e operador de rede, dando assim à cloud o efetivo suporte da rede. Para tal, apresentamos uma plataforma e um conjunto de mecanismos associados para gestão e controlo integrado de domínios cloud computing e operador de rede por forma a fornecer serviços fim-a-fim. Além disso, elaboramos um estudo aprofundado sobre o mapeamento de recursos virtuais neste ambiente integrado. O estudo centra-se na maximização da incorporação de recursos virtuais na infraestrutura física por meio de estratégias de mapeamento ótimas (considerando a alocação inicial de recursos, bem como adaptações ao longo do tempo), enquanto que se minimizam os custos associados ao consumo de energia. Este estudo é feito para cenários de apenas um domínio e para cenários com múltiplos domínios. Além disso, exploramos como o operador de rede pode aproveitar o referido ambiente integrado para suportar funções de rede tradicionais. Neste sentido, estudamos como as funções de rede virtualizadas devem ser modeladas e geridas num ambiente cloud e estendemos a plataforma de acordo com este conceito. No âmbito desta Tese foi feita uma avaliação extensa das soluções propostas, avaliando os seus benefícios. Implementámos provas de conceito por forma a demonstrar as mais-valias, viabilidade e fácil implantação das soluções propostas. Além disso, a avaliação das estratégias de mapeamento foi realizada através de ferramentas de simulação e de programação linear inteira, mostrando que é possível reduzir o consumo de energia da infraestrutura física, sem comprometer a aceitação de recursos virtuais. Este aspeto pode ser melhorado através da adaptação de recursos virtuais ao longo do tempo. No entanto, deve-se ter em mente os custos associados aos processos de adaptação. Os custos podem ser minimizados, mas isso implica uma redução na aceitação de recursos virtuais. Esta compensação foi também um tema abordado nesta Tese.
19
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 textAbstract:
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
20
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 textAbstract:
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.
21
Марчук, Олександр Олегович. "Метод управління безпекою інформаційних потоків мережі IoT за допомогою SDN." Master's thesis, КПІ ім. Ігоря Сікорського, 2020. https://ela.kpi.ua/handle/123456789/39304.
Full textAbstract:
Актуальність: Підвищення якості функціонування мереж зв'язку за рахунок поліпшення надійності є складною науково-технічною та економічною проблемою. Це обумовлено тим що до мереж з новими технологіями, таким як програмно-конфігуровані мережі (SDN) в даний час висувають високі вимоги по надійності (відмовостійкості) в тому числі до характеристик відновлення мережі після відмови. При розробці заходів, що підвищують надійність доцільна постановка задачі максимально можливого підвищення якості функціонування мережі при мінімальному часу відновлення зв'язку.
Високий рівень відмовостійкості мережі забезпечується за рахунок швидкого виявлення пошкоджень і усунення їх наслідків за короткий час. Існуючі методи забезпечення надійності в мережах SDN можна поділити на два самостійних класи: захисне перемикання (резервування) і відновлення (перемаршрутизація). Звідси випливає що для системного підходу до дослідження методів забезпечення надійності SDN доцільно використовувати засоби математичного моделювання.
Дослідження механізмів забезпечення надійності SDN розглядається в ряді робіт, як вітчизняних, так і зарубіжних. Однак в даних роботах не проводиться порівняльний аналіз використання механізмів забезпечення відмовостійкості, а також комбінації цих механізмів. Так само в ряді робіт не враховуються економічні показники використання даних механізмів.
Мета роботи: підвищити відмовостійкість при DoS-атаці системи Інтернету речей з використанням концепції SDN за рахунок премаршутизації та резервування комунікаційних ресурсів, що дозволить зменшити час до виявлення відмови методами швидкого відновлення, зменшиння відсотка навантаженості.
Задачі дослідження:
1. Проаналізувати існуючі підходи щодо управління безпекою інформаційних потоків мережі IoT за допомогою SDN .
2. Запропонувати модель управління безпекою інформаційних потоків мережі IoT при DoS-атаці, яка дозволить зменшити як ймовірність відмови, так і вплив відмови ;
3. Вдосконалити процедуру керування безпекою інформаційних потоків мережі IoT яка враховує можливості організації потоків в програмно-керованих мережах (SDN);
4. Розробити удосконалений метод управління безпекою інформаційних потоків мережі IoT з використанням концепції SDN та резервування контролера, що дозволить отримати надійну мережу, не враховуючи збільшення часу до виявлення відмови при роботі методів швидкого відновлення.
5. Розробка імітаційної моделі в середовищі MiniNet, планування та проведення експерименту з метою перевірки теоритичних положень та доведення їх ефективності.
6. Розробка стартап проекту для системи безпеки IoT.
Об’єкт дослідження: пристрої і технології організації програмно-керованого зв'язку в мережі Інтернету речей.
Предмет дослідження: моделі та методи управління безпекою інформаційних потоків мережі IoT за допомогою SDN
Методи дослідження: Проведені дослідження базуються на теорії ймовірностей, математичній статистиці, теорії телекомунікацій методах моделювання. Моделювання фрагмента мережі ІР проведено на основі пакета MiniNet.
Наукова новизна: Запропоновано удосконалений метод управління безпекою інформаційних потоків мережі IoT з використанням концепції SDN, який дозволяє підвищити відмовостійкість при DoS-атаці системи Інтернету речей, зменшити час до виявлення відмови методами швидкого відновлення, зменшити відсотка завантаженості мережі, за рахунок премаршутизації та резервування комунікаційних ресурсів.
Практична новизна: Пропонована модель PFI скорочує час на встановлення шляху, знижує час обробки контролера і зменшує трафік каналу управління при DoS-атаці на мережу шляхом використання методів резервування та відновлення зв’язку, також взаємодіє з протоколами безпеки, основним з них є OpenFlow.Relevance: Improving the quality of communication networks by improving reliability is a complex scientific, technical and economic problem. This is due to the fact that networks with new technologies, such as software-configured networks (SDN) currently have high requirements for reliability (fault tolerance), including the characteristics of network recovery after failure. When developing measures to increase reliability, it is advisable to set the task of maximizing the quality of network operation with a minimum connection recovery time. The high level of fault tolerance of the network is provided due to fast detection of damages and elimination of their consequences in a short time. Existing methods of ensuring reliability in SDN networks can be divided into two separate classes: protective switching (redundancy) and recovery (rerouting). It follows that for a systematic approach to the study of methods to ensure the reliability of SDN, it is advisable to use mathematical modeling. The study of the mechanisms of ensuring the reliability of SDN is considered in a number of works, both domestic and foreign. However, these works do not provide a comparative analysis of the use of mechanisms to ensure fault tolerance, as well as a combination of these mechanisms. Similarly, a number of works do not take into account the economic indicators of the use of these mechanisms. Purpose: to develop a method of managing the security of information flows of the IoT network using the concept of SDN and controller redundancy, which will provide a reliable network, without taking into account the increase in time to detect failure of rapid recovery methods. Research objectives: 1. to propose a model of security management of information flows of the IoT network; 2. provide an algorithm for managing the security of information flows of the IoT network using SDN; 3. to reveal the methodology for determining the effectiveness of security management of information flows of the IoT network using SDN; 4. to develop an improved method of managing the security of information flows of the IoT network using the concept of SDN and controller redundancy, which will allow to obtain a reliable network, without taking into account the increase in time to detect failure of fast recovery methods. Object of research: devices and technologies of communication organization in the Internet of Things. Subject of research: data transmission models and methods of ensuring the functioning of the Internet of Things in the face of hazards. Research methods: The research is based on probability theory, mathematical statistics, modeling methods and field experiments. The simulation of a fragment of the IP network was performed on the basis of a simulation package. Scientific novelty: An improved method of managing the security of information flows of the IoT network using the concept of SDN and controller redundancy has been proposed, which will allow to obtain a reliable network, without taking into account the increase in time to detect failure of fast recovery methods. Practical novelty: The obtained results can be implemented in a real enterprise in order to improve the quality of security management of information flows of the IoT network using SDN.
22
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 textAbstract:
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.
23
Car, Mario. "OpenStack service function chaining interface." Master's thesis, Universidade de Aveiro, 2015. http://hdl.handle.net/10773/18737.
Full textAbstract:
Mestrado em Engenharia Eletrónica e TelecomunicaçõesOpenStack 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.
24
Di, Santi Silvio. "5G Network Architecture." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2020. http://amslaurea.unibo.it/20432/.
Full textAbstract:
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.
25
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 textAbstract:
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.
26
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 textAbstract:
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.
27
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 textAbstract:
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.
28
Foresta, Francesco. "Composizione dinamica di funzioni di rete virtuali in ambienti cloud." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amslaurea.unibo.it/8381/.
Full textAbstract:
Questo documento si interroga sulle nuove possibilità offerte agli operatori del mondo delle Reti di Telecomunicazioni dai paradigmi di Network Functions Virtualization, Cloud Computing e Software Defined Networking: questi sono nuovi approcci che permettono la creazione di reti dinamiche e altamente programmabili, senza disdegnare troppo il lato prestazionale.
L'intento finale è valutare se con un approccio di questo genere si possano implementare dinamicamente delle concatenazioni di servizi di rete e se le prestazioni finali rispecchiano ciò che viene teorizzato dai suddetti paradigmi.
Tutto ciò viene valutato per cercare una soluzione efficace al problema dell'ossificazione di Internet: infatti le applicazioni di rete, dette middle-boxes, comportano costi elevati, situazioni di dipendenza dal vendor e staticità delle reti stesse, portando all'impossibilità per i providers di sviluppare nuovi servizi.
Il caso di studio si basa proprio su una rete che implementa questi nuovi paradigmi: si farà infatti riferimento a due diverse topologie, una relativa al Livello L2 del modello OSI (cioè lo strato di collegamento) e una al Livello L3 (strato di rete).
Le misure effettuate infine mostrano come le potenzialità teorizzate siano decisamente interessanti e innovative, aprendo un ventaglio di infinite possibilità per il futuro sviluppo di questo settore.
29
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 textAbstract:
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
30
Artuso, Matteo. "Controller SDN distribuiti basati su microservizi e orchestrati tramite Open Source MANO." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021.
Find full textAbstract:
Questo lavoro si pone come obiettivo quello di studiare i microservizi che compongono un controller SDN come delle Virtualized Network Functions, impiegando Open Source Mano (OSM) come orchestratore. Nella fase iniziale viene studiata la procedura per definire e istanziare dei servizi di rete che soddisfino i requisiti richiesti ad un controller per le SDN. Viene poi approfondito l’aspetto del monitoring e della replicazione dei microservizi istanziati e funzionanti attraverso gli strumenti messi a disposizione dal sistema OSM. Viene infine testato il sistema attraverso l’impiego di una rete simulata, composta da una serie di switch che impiegherà il controller SDN scomposto.
31
Gokan, Khan Michel. "Performance Modelling and Simulation of Service Chains for Telecom Clouds." Licentiate thesis, Karlstads universitet, Institutionen för matematik och datavetenskap (from 2013), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-83687.
Full textAbstract:
New services and ever increasing traffic volumes require the next generation of mobile networks, e.g. 5G, to be much more flexible and scalable. The primary enabler for its flexibility is transforming network functions from proprietary hardware to software using modern virtualization technologies, paving the way of virtual network functions (VNF). Such VNFs can then be flexibly deployed on cloud data centers while traffic is routed along a chain of VNFs through software-defined networks. However, such flexibility comes with a new challenge of allocating efficient computational resources to each VNF and optimally placing them on a cluster. In this thesis, we argue that, to achieve an autonomous and efficient performance optimization method, a solid understanding of the underlying system, service chains, and upcoming traffic is required. We, therefore, conducted a series of focused studies to address the scalability and performance issues in three stages. We first introduce an automated profiling and benchmarking framework, named NFV-Inspector to measure and collect system KPIs as well as extract various insights from the system. Then, we propose systematic methods and algorithms for performance modelling and resource recommendation of cloud native network functions and evaluate them on a real 5G testbed. Finally, we design and implement a bottom-up performance simulator named PerfSim to approximate the performance of service chains based on the nodes’ performance models and user-defined scenarios.
32
Morcos, Mira. "Auction-based dynamic resource orchestration in cloud-based radio access networks." Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLL003.
Full textAbstract:
La densification de réseau à l'aide de petites cellules massivement déployées sur les zones macro-cellules, représente une solution prometteuse pour les réseaux mobiles 5G avenir pour faire face à l'augmentation du trafic mobile. Afin de simplifier la gestion de l'hétérogène du réseau d'accès radio (Radio Access Network RAN) qui résulte du déploiement massif de petites cellules, des recherches récentes et des études industrielles ont favorisé la conception de nouvelles architectures de RAN centralisés appelés comme Cloud-RAN (C-RAN), ou RAN virtuel (V-RAN), en incorporant les avantages du cloud computing et Network Functions Virtualization (NFV). Le projet de DynaRoC vise l'élaboration d'un cadre théorique de l'orchestration de ressources pour les C-RAN et dériver les limites de performance fondamentaux ainsi que les arbitrages entre les différents paramètres du système, et la conception de mécanismes d'orchestration de ressources dynamiques sur la base des conclusions théoriques à atteindre un équilibre de performance souhaité, en tenant compte des différents défis de conception. Le doctorant va étudier les mécanismes d'optimisation des ressources novatrices pour favoriser le déploiement de C-RAN, améliorer leur performance exploitant la technologie Network Functions VirtualizationNetwork densification using small cells massively deployed over the macro-cell areas, represents a promising solution for future 5G mobile networks to cope with mobile traffic increase. In order to simplify the management of the heterogeneous Radio Access Network (RAN) that results from the massive deployment of small cells, recent research and industrial studies have promoted the design of novel centralized RAN architectures termed as Cloud-RAN (C-RAN), or Virtual RAN (V-RAN), by incorporating the benefits of cloud computing and Network Functions Virtualization (NFV). The DynaRoC project aims at (1) developing a theoretical framework of resource orchestration for C-RAN and deriving the fundamental performance limits as well as the tradeoffs among various system parameters, and (2) designing dynamic resource orchestration mechanisms based on the theoretical findings to achieve a desired performance balance, by taking into account various design challenges. The PhD student will investigate innovative resource optimization mechanisms to foster the deployment of C-RANs, improving their performance exploiting the enabling Network Functions Virtualization technology
33
Platt, Steven. "Decentralized cellular networks: Towards blockchain enabled cellular overlays." Doctoral thesis, Universitat Pompeu Fabra, 2021. http://hdl.handle.net/10803/672922.
Full textAbstract:
This thesis undertakes an investigation into the fit and utility of blockchain technologies within
cellular networks. The core of this writing is a new 5G core network blockchain designed to be
compatible with, and paired as storage for 3GPP-compliant virtual network functions.
Compatibility of the blockchain design is delivered by inheriting a number of behaviors from
wireless network operation, including a CSMA/CD mechanism of congestion control; a first for a
blockchain design. At the carrier level, a deployment model compatible with ETSI General
Autonomous Network Architecture is presented to enable decentralized service overlays. At the
network edge, a novel model of transition learning allows fluid roaming of user-equipment
across network boundaries. At the conclusion, the theory is combined, to reveal a model of
decentralized overlays, which at the user equipment, functions in a manner similar to FM radio.
A network channel radio of sorts for decentralized cellular access.Aquesta tesi realitza una investigació sobre l’us i l’adptabilitat de les tecnologies blockchain en xarxes cel·lulars. El nucli d’aquest treball és una nova blockchain basada en la xarxa 5G dissenyada per ser compatible i utilitzada com a emmagatzematge per a la funció de xarxa virtual compatible amb 3GPP. La compatibilitat del disseny de la blockchain s’ofereix adoptant diversos comportaments de l'operació de xarxa sense fils, inclos un mecanisme CSMA/CD de control de congestió; la primera vegada que s’utilitza per a un disseny de blockchain. A nivell de transport, es presenta un model de desplegament compatible amb l’arquitectura general de xarxes autonomes ETSI per permetre superposicions de serveis descentralitzats. A la capa de xarxa, presentem un nou model de ”transition learning” que facilita una itinerància fluida de l’equip d’usuari a través dels l ́ımits de la xarxa. Per acabar, la part teórica és combina per revelar un model de capes superposades descentralitzades, on l’equip de l’usuari funciona de manera similar una radio FM. Un canal de radio amb accés descentralitzat.
34
Azzouni, Abdelhadi. "Smart and secure network softwarization." Electronic Thesis or Diss., Sorbonne université, 2018. http://www.theses.fr/2018SORUS259.
Full textAbstract:
La tendance récente vers la “Softwarization” des réseaux entraîne un changement techno-économique sans précédent dans les secteurs des TIC (technologies de l'information et de la communication). En séparant le matériel sur lequel fonctionnent les fonctions/services réseau et le logiciel qui réalise et contrôle de ces fonctions/services, les réseaux logiciels (ou SDN, Software-Defined Networking) et la virtualisation des fonctions réseau (NFV, Network Function Virtualization) créent un écosystème ouvert qui réduit considérablement le coût de provisionnement des réseaux et change la façon dont les opérateurs gèrent et exploitent leurs réseaux. Les paradigmes SDN et NFV introduisent plus de flexibilité et permettent un meilleur contrôle, ainsi les technologies associées devraient dominer une grande partie du marché du réseautage dans les prochaines années (estimé à 3,68 milliards USD en 2017 et prévu par certains pour atteindre 54 milliards USD d'ici 2022 à un taux de croissance annuel composé (TCAC) de 71,4%). Cependant, l'un des soucis majeurs des opérateurs à propos de Network Softwarization est la sécurité. Dans cette thèse, nous avons d'abord conçu et implémenté un framework de test de pénétration (pentesting) pour les contrôleurs SDN. Nous avons proposé un ensemble d'algorithmes pour l'empreinte digitale d'un contrôleur SDN distant, i.e. sans avoir besoin d’une connexion directe au contrôleur. En utilisant notre framework, les opérateurs réseau peuvent évaluer la sécurité de leurs déploiements SDN (y compris Opendaylight, Floodlight et Cisco Open SDN Controller) avant de les mettre en production. Deuxièmement, nous avons étudié le problème de découverte de topologie dans les réseaux SDN. Nous avons constaté des problèmes de sécurité, ainsi que de performance, majeurs autour du protocole OFDP (OpenFlow Topology Discovery Protocol). Afin de résoudre ces problèmes majeurs, nous avons conçu et implémenté un nouveau protocole, sécurisé et efficace, pour la découverte de topologie dans les réseaux OpenFlow. Notre protocole est appelé sOFTDP; secure and efficient OpenFlow Topology Discovery Protocol. sOFTDP nécessite des modifications minimales à la conception de base du commutateur OpenFlow et s'avère plus sûr que le OFDP traditionnel et les améliorations plus récente sur OFDP. En outre, sOFTDP surpasse OFDP de plusieurs ordres de grandeur en terme de performance, ce que nous avons confirmé par des tests approfondis. Le deuxième axe de notre recherche dans cette thèse est la gestion intelligente et automatique des réseaux logiciels. Inspirés par les avancées récentes dans les techniques d'apprentissage automatique, notamment les réseaux de neurones profonds (DNN, Deep Neural Networks), nous avons créé un moteur d'ingénierie de trafic pour le SDN appelé NeuRoute, entièrement basé sur les DNN. Les contrôleurs SDN/OpenFlow actuels utilisent par défaut un routage basé sur l'algorithme de Dijkstra pour les chemins les plus courts mais fournissent des API pour développer des applications de routage personnalisées. NeuRoute est un framework de routage dynamique indépendant du contrôleur qui (i) prédit la matrice de trafic en temps réel, (ii) utilise un réseau neuronal pour apprendre les caractéristiques du trafic et (iii) génère automatiquement des règles de routage pour optimiser le débit du trafic. [...]The recent trend toward Network Softwarization is driving an unprecedented technoeconomic shift in the Telecom and ICT (Information and Communication Technologies) industries. By separating the hardware on which network functions/services run and the software that realizes and controls the network functions/services, Software-Defined Networking (SDN) and Network Function Virtualization (NFV) are creating an open ecosystem that drastically reduces the cost of building networks and changes the way operators operate their networks. SDN and NFV paradigms add more flexibility and enable more control over networks, thus, related technologies are expected to dominate a large part of the networking market in the next few years (estimated at USD 3.68B in 2017 and forecasted by some to reach 54B USD by 2022 at a Compound Annual Growth Rate (CAGR) of 71.4%). However, one of the major operators’ concerns about Network Softwarization is security. In this thesis, we have first designed and implemented a pentesting (penetration testing) framework for SDN controllers. We have proposed a set of algorithms to fingerprint a remote SDN controller without having direct connection to it. Using our framework, network operators can evaluate the security of their SDN deployments (including Opendaylight, Floodlight and Cisco Open SDN Controller) before putting them into production. Second, we have studied the Topology Discovery problem in SDN controllers and discovered major security (as well as performance) issues around the current de-facto OpenFlow Topology Discovery Protocol (OFDP). In order to fix these major issues, we have designed and implemented a new secure and efficient OpenFlow Topology Discovery Protocol (called sOFTDP). sOFTDP requires minimal changes to the OpenFlow switch design and is shown to be more secure than previous workarounds on traditional OFDP. Also, sOFTDP outperforms OFDP by several orders of magnitude which we confirmed by extensive experiments. The second axis of our research in this thesis is smart management in softwarized networks. Inspired by the recent breakthroughs in machine learning techniques, notably, Deep Neural Networks (DNNs), we have built a traffic engineering engine for SDN called NeuRoute, entirely based on DNNs. Current SDN/OpenFlow controllers use a default routing based on Dijkstra’s algorithm for shortest paths, and provide APIs to develop custom routing applications. NeuRoute is a controller-agnostic dynamic routing framework that (i) predicts traffic matrix in real time, (ii) uses a neural network to learn traffic characteristics and (iii) generates forwarding rules accordingly to optimize the network throughput. NeuRoute is composed of two main components: NeuTM and NeuRoute-TRU. NeuTM is a traffic matrix (TM) prediction framework that uses Long Short Term Memory (LSTM) Neural Network architecture to learn long-range traffic dependencies and characteristics then accurately predicts future TMs. NeuRoute-TRU is a path selection engine that computes optimal paths for traffic matrices predicted by NeuTM. NeuRoute-TRU achieves the same results as the most efficient dynamic routing heuristic but in much less execution time
35
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 textAbstract:
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.
36
Leipnitz, Marcos Tomazzoli. "Resilient regular expression matching on FPGAs with fast error repair." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2017. http://hdl.handle.net/10183/168788.
Full textAbstract:
O paradigma Network Function Virtualization (NFV) promete tornar as redes de computadores mais escaláveis e flexíveis, através do desacoplamento das funções de rede de hardware dedicado e fornecedor específico. No entanto, funções de rede computacionalmente intensivas podem ser difíceis de virtualizar sem degradação de desempenho. Neste contexto, Field-Programmable Gate Arrays (FPGAs) têm se mostrado uma boa opção para aceleração por hardware de funções de rede virtuais que requerem alta vazão, sem se desviar do conceito de uma infraestrutura NFV que visa alta flexibilidade. A avaliação de expressões regulares é um mecanismo importante e computacionalmente intensivo, usado para realizar Deep Packet Inpection, que pode ser acelerado por FPGA para atender aos requisitos de desempenho. Esta solução, no entanto, apresenta novos desafios em relação aos requisitos de confiabilidade. Particularmente para FPGAs baseados em SRAM, soft errors na memória de configuração são uma ameaça de confiabilidade significativa. Neste trabalho, apresentamos um mecanismo de tolerância a falhas abrangente para lidar com falhas de configuração na funcionalidade de módulos de avaliação de expressões regulares baseados em FPGA. Além disso, é introduzido um mecanismo de correção de erros que considera o posicionamento desses módulos no FPGA para reduzir o tempo de reparo do sistema, melhorando a confiabilidade e a disponibilidade. Os resultados experimentais mostram que a taxa de falha geral e o tempo de reparo do sistema podem ser reduzidos em 95% e 90%, respectivamente, com custos de área e performance admissíveis.The Network Function Virtualization (NFV) paradigm promises to make computer networks more scalable and flexible by decoupling the network functions (NFs) from dedicated and vendor-specific hardware. However, network and compute intensive NFs may be difficult to virtualize without performance degradation. In this context, Field-Programmable Gate Arrays (FPGAs) have been shown to be a good option for hardware acceleration of virtual NFs that require high throughput, without deviating from the concept of an NFV infrastructure which aims at high flexibility. Regular expression matching is an important and compute intensive mechanism used to perform Deep Packet Inspection, which can be FPGA-accelerated to meet performance constraints. This solution, however, introduces new challenges regarding dependability requirements. Particularly for SRAM-based FPGAs, soft errors on the configuration memory are a significant dependability threat. In this work we present a comprehensive fault tolerance mechanism to deal with configuration faults on the functionality of FPGA-based regular expression matching engines. Moreover, a placement-aware scrubbing mechanism is introduced to reduce the system repair time, improving the system reliability and availability. Experimental results show that the overall failure rate and the system mean time to repair can be reduced in 95% and 90%, respectively, with manageable area and performance costs.
37
Vikrant, Nikam. "Design and Performance Evaluation of Resource Allocation Mechanisms in Optical Data Center Networks." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-198163.
Full textAbstract:
A datacenter hosts hundreds of thousands of servers and a huge amount of bandwidth is required to accommodate communication between thousands of servers. Several packet switched based datacenter architectures are proposed to cater the high bandwidth requirement using multilayer network topologies, however at the cost of increased network complexity and high power consumption. In recent years, the focus has shifted from packet switching to optical circuit switching to build the data center networks as it can support on demand connectivity and high bit rates with low power consumption. On the other hand, with the advent of Software Defined Networking (SDN) and Network Function Virtualization (NFV), the role of datacenters has become more crucial. It has increased the need of dynamicity and flexibility within a datacenter adding more complexity to datacenter networking. With NFV, service chaining can be achieved in a datacenter where virtualized network functions (VNFs) running on commodity servers in a datacenter are instantiated/terminated dynamically. A datacenter also needs to cater large capacity requirement as service chaining involves steering of large aggregated flows. Use of optical circuit switching in data center networks is quite promising to meet such dynamic and high capacity traffic requirements. In this thesis work, a novel and modular optical data center network (DCN) architecture that uses multi-directional wavelength switches (MD-WSS) is introduced. VNF service chaining use case is considered for evaluation of this DCN and the end-to-end service chaining problem is formulated as three inter-connected sub-problems: multiplexing of VNF service chains, VNFs placement in the datacenter and routing and wavelength assignment. This thesis presents integer linear programming (ILP) formulation and heuristics for solving these problems, and numerically evaluate them.Ett datacenter inrymmer hundratusentals servrar och en stor mängd bandbredd krävs för att skicka data mellan tusentals servrar. Flera datacenter baserade på paketförmedlande arkitekturer föreslås för att tillgodose kravet på hög bandbredd med hjälp av flerskiktsnätverkstopologier, men på bekostnad av ökad komplexitet i nätverken och hög energiförbrukning. Under de senaste åren har fokus skiftat från paketförmedling till optisk kretsomkoppling for att bygga datacenternätverk som kan stödja på-begäran-anslutningar och höga bithastigheter med låg strömförbrukning. Å andra sidan, med tillkomsten av Software Defined Networking (SDN) och nätverksfunktionen Virtualisering (NFV), har betydelsen av datacenter blivit mer avgörande. Det har ökat behovet av dynamik och flexibilitet inom ett datacenter, vilket leder till storre komplexitet i datacenternätverken. Med NFV kan tjänstekedjor åstadkommas i ett datacenter, där virtualiserade nätverksfunktioner (VNFs) som körs på servrar i ett datacenter kan instansieras och avslutas dynamiskt. Ett datacenter måste också tillgodose kravet på stor kapacitet eftersom tjänstekedjan innebär styrning av stora aggregerade flöden. Användningen av optisk kretsomkoppling i datacenternätverk ser ganska lovande ut for att uppfylla sådana trafikkrav dynamik och hög kapacitet. I detta examensarbete, har en ny och modulär optisk datacenternätverksarkitektur (DCN) som använder flerriktningvåglängdsswitchar (MD-WSS) införs. Ett användningsfall av VNF-tjänstekedjor noga övervägd för utvärdering av denna DCN och end-to-end-servicekedjans problem formuleras som tre sammankopplade delproblem: multiplexering av VNF-servicekedjor, VNF placering i datacentret och routing och våglängd uppdrag. Denna avhandling presenterar heltalsprogrammering (ILP) formulering och heuristik för att lösa dessa problem och numeriskt utvärdera dem.
38
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 textAbstract:
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 futursNetwork 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
39
Cherrared, Sihem. "Gestion des fautes dans les réseaux multi-tenants et programmables." Thesis, Rennes 1, 2020. http://www.theses.fr/2020REN1S016.
Full textAbstract:
La virtualisation est une tentative prometteuse pour résoudre certains défis de la 5G. La virtualisation consiste à exécuter des fonctions réseaux en tant que logiciels sur une infrastructure physique partagée. Cela optimise les coûts de déploiement et simplifie la gestion, mais il introduit de nouveaux défis tels que la topologie de réseau dynamique et le manque de visibilité. Dans cette thèse, nous proposons un algorithme d’auto-modélisation et un processus de diagnostic actif pour relever ces défis. Nous apprenons et validons le modèle défini par injection de pannes. Nous appliquons notre approche au use-case "virtual Ip Multimedia (vIMS)"Network Functions Virtualization (NFV) is one promising attempt at solving some of the 5G challenges. NFV is about running network functions as virtualized workloads on commodity hardware. This may optimize deployment costs and simplify the life cycle management, but it introduces new challenges such as the dynamic network topology and the lack of visibility. In this thesis, we propose a self-modeling algorithm and an active diagnosis process to face these challenges. We define a dependency model learned from faults injection. The self-modeling and the active diagnosis approach was applied to the real-world virtual Ip Multimedia Subsystem (vIMS) use-case
40
Мохамед, Мухі-Алдін Хассан, and Muhi-Aldin Hassan Mohamed. "Моделі та методи забезпечення якості обслуговування у мережах з підтримкою функцій віртуалізації." Thesis, Національний авіаційний університет, 2020. http://er.nau.edu.ua/handle/NAU/41248.
Full textAbstract:
В роботі розв'язана актуальна науково-прикладна задача, що полягає у
розробці нових та вдосконаленні існуючих методів аналізу розподілу мережевих
ресурсів; оцінки коректності функціонування та надання послуг у мультисервісних
мережах з підтримкою технології NFV.
7. Для вирішення науково-прикладної задачі удосконалено: метод динамічного
управління складом комплексних сервісів за рахунок зміни їх складових у NFV
мережах, який дозволяє формувати та управляти складом комплексного сервісу з
урахуванням поточного стану складових сервісів при формуванні комплексного
сервісу, що призводить до забезпечення необхідного рівня QoS; розроблено метод
динамічного розподілу пропускної спроможності каналів зв’язку у NFV мережах, що
базується на принципах розподілення залишкової пропускної спроможності та
дозволяє уникнути повного завантаження та перевантаження каналу передачі;
Розроблено метод динамічної реплікації сервісів в мережах з підтримкою функцій
віртуалізації мережевих ресурсів, який за рахунок використання теорії мережевого
обчислення дозволяє підвищити доступність і ефективність надання сервісів за
рахунок своєчасного формування, видалення копій різних типів сервісів і їх
раціонального розподілу між фрагментами мережі.
Визначено, що запропонований метод балансування навантаження дозволяє
підвищити ефективність використання каналів передачі на 7% та зменшити середню
затримку загалом на 16% у порівнянні з динамічним алгоритмом Central Queuing, а
застосування розробленого методу реплікації сервісів дозволяє підвищити
доступність сервісу в 14 разів у випадку перевантажень.
З метою аналізу ефективності розподілу мережевих ресурсів запропоновано
проводити аналіз функціональних та нефункціональних властивостей сервісу за
допомогою модельного підходу. У якості математичного апарату моделювання
запропоновано використовувати апарат Е-мереж.
Запропоновані математичні моделі і методи можуть бути використані під час
розробки, впровадження та підтримки мультисервісних мереж, що базуються на
хмарному підході з використанням технології віртуалізації мережевих функцій.
The actual scientific and applied problem is solved in the work, which consists in
development of new and improvement of existing methods of analysis of distribution of
network resources; assessment of the correctness of the functioning and provision of
services in multiservice networks with NFV technology support.
To solve the scientific-applied problem, the following methods were developed: the
method of dynamic management of the composition of complex services by changing their
components in NFV networks, which allows to form and manage the composition of the
complex service, taking into account the current state of the complex services in the
formation of the complex service, which leads to the required level of QoS; dynamic
bandwidth allocation method for NFV networks based on the principles of residual
bandwidth allocation and avoiding full load and overload of the transmission channel;
dynamic replication method that increases the availability of services as the service grows
in popularity on the NFV network.
It is determined that the proposed method of load balancing can increase the
efficiency of use of transmission channels by 7% and reduce the average delay by 16% in
comparison with the dynamic algorithm of Central Queuing, and the application of the
developed method of replication of services allows to increase the service availability by
14 times in case of overloads.
In order to analyze the efficiency of the distribution of network resources, it is
proposed to analyze the functional and non-functional properties of the service using a
model approach. It is proposed to use the E-network apparatus as a mathematical
simulation apparatus. It is suggested to analyze such algorithmic properties as:
boundedness, activity, reachability and security.6. A dynamic replication method has been
developed to increase the availability of services as the service becomes more popular on
the NFV network.
To model the change in network characteristics in the service delivery process, the
application of network computing theory is proposed, on the basis of which a number of
definitions have been made, which allow the most complete modeling of NFVI elements.
NFVI behavior analysis methods are proposed in two time models: continuous time: load
and service curves and discrete time: arrival and departure function. Algorithm for
reservation of resources in the provision of services based on the use of elements of the
theory of network computing. The method is based on algorithms for analysis and
estimation of the limit indicators of delay and speed of processing, which are characteristic
for each node. A practical example of reserving resources using RSVP.
The method of dynamic replication of services in networks with support of
functions of virtualization of network resources is developed, which through the use of
network computing theory allows to increase the availability and efficiency of rendering
services by timely formation, deleting of copies of different types of services and their
rational distribution between fragments of the network.
The proposed mathematical models and methods can be used in the development,
implementation and maintenance of cloud-based multi-service networks using network
function virtualization technology.
41
Mechtri, Marouen. "Virtual networked infrastructure provisioning in distributed cloud environments." Thesis, Evry, Institut national des télécommunications, 2014. http://www.theses.fr/2014TELE0028/document.
Full textAbstract:
L'informatique en nuage (Cloud Computing) a émergé comme un nouveau paradigme pour offrir des ressources informatiques à la demande et pour externaliser des infrastructures logicielles et matérielles. Le Cloud Computing est rapidement et fondamentalement en train de révolutionner la façon dont les services informatiques sont mis à disposition et gérés. Ces services peuvent être demandés à partir d’un ou plusieurs fournisseurs de Cloud d’où le besoin de la mise en réseau entre les composants des services informatiques distribués dans des emplacements géographiquement répartis. Les utilisateurs du Cloud veulent aussi déployer et instancier facilement leurs ressources entre les différentes plateformes hétérogènes de Cloud Computing. Les fournisseurs de Cloud assurent la mise à disposition des ressources de calcul sous forme des machines virtuelles à leurs utilisateurs. Par contre, ces clients veulent aussi la mise en réseau entre leurs ressources virtuelles. En plus, ils veulent non seulement contrôler et gérer leurs applications, mais aussi contrôler la connectivité réseau et déployer des fonctions et des services de réseaux complexes dans leurs infrastructures virtuelles dédiées. Les besoins des utilisateurs avaient évolué au-delà d'avoir une simple machine virtuelle à l'acquisition de ressources et de services virtuels complexes, flexibles, élastiques et intelligents. L'objectif de cette thèse est de permettre le placement et l’instanciation des ressources complexes dans des infrastructures de Cloud distribués tout en permettant aux utilisateurs le contrôle et la gestion de leurs ressources. En plus, notre objectif est d'assurer la convergence entre les services de cloud et de réseau. Pour atteindre cela, nous proposons des algorithmes de mapping d’infrastructures virtuelles dans les centres de données et dans le réseau tout en respectant les exigences des utilisateurs. Avec l'apparition du Cloud Computing, les réseaux traditionnels sont étendus et renforcés avec des réseaux logiciels reposant sur la virtualisation des ressources et des fonctions réseaux. En plus, le nouveau paradigme d'architecture réseau (Software Defined Networks) est particulièrement pertinent car il vise à offrir la programmation du réseau et à découpler, dans un équipement réseau, la partie plan de données de la partie plan de contrôle. Dans ce contexte, la première partie propose des algorithmes optimaux (exacts) et heuristiques de placement pour trouver le meilleur mapping entre les demandes des utilisateurs et les infrastructures sous-jacentes, tout en respectant les exigences exprimées dans les demandes. Cela inclut des contraintes de localisation permettant de placer une partie des ressources virtuelles dans le même nœud physique. Ces contraintes assurent aussi le placement des ressources dans des nœuds distincts. Les algorithmes proposés assurent le placement simultané des nœuds et des liens virtuels sur l’infrastructure physique. Nous avons proposé aussi un algorithme heuristique afin d’accélérer le temps de résolution et de réduire la complexité du problème. L'approche proposée se base sur la technique de décomposition des graphes et la technique de couplage des graphes bipartis. Dans la troisième partie, nous proposons un cadriciel open source (framework) permettant d’assurer la mise en réseau dynamique entre des ressources Cloud distribués et l’instanciation des fonctions réseau dans l’infrastructure virtuelle de l’utilisateur. Ce cadriciel permettra de déployer et d’activer les composants réseaux afin de mettre en place les demandes des utilisateurs. Cette solution se base sur un gestionnaire des ressources réseaux "Cloud Network Gateway Manager" et des passerelles logicielles permettant d’établir la connectivité dynamique et à la demande entre des ressources cloud et réseau. Le CNG-Manager offre le contrôle de la partie réseau et prend en charge le déploiement des fonctions réseau nécessaires dans l'infrastructure virtuelle des utilisateursCloud computing emerged as a new paradigm for on-demand provisioning of IT resources and for infrastructure externalization and is rapidly and fundamentally revolutionizing the way IT is delivered and managed. The resulting incremental Cloud adoption is fostering to some extent cloud providers cooperation and increasing the needs of tenants and the complexity of their demands. Tenants need to network their distributed and geographically spread cloud resources and services. They also want to easily accomplish their deployments and instantiations across heterogeneous cloud platforms. Traditional cloud providers focus on compute resources provisioning and offer mostly virtual machines to tenants and cloud services consumers who actually expect full-fledged (complete) networking of their virtual and dedicated resources. They not only want to control and manage their applications but also control connectivity to easily deploy complex network functions and services in their dedicated virtual infrastructures. The needs of users are thus growing beyond the simple provisioning of virtual machines to the acquisition of complex, flexible, elastic and intelligent virtual resources and services. The goal of this thesis is to enable the provisioning and instantiation of this type of more complex resources while empowering tenants with control and management capabilities and to enable the convergence of cloud and network services. To reach these goals, the thesis proposes mapping algorithms for optimized in-data center and in-network resources hosting according to the tenants' virtual infrastructures requests. In parallel to the apparition of cloud services, traditional networks are being extended and enhanced with software networks relying on the virtualization of network resources and functions especially through network resources and functions virtualization. Software Defined Networks are especially relevant as they decouple network control and data forwarding and provide the needed network programmability and system and network management capabilities. In such a context, the first part proposes optimal (exact) and heuristic placement algorithms to find the best mapping between the tenants' requests and the hosting infrastructures while respecting the objectives expressed in the demands. This includes localization constraints to place some of the virtual resources and services in the same host and to distribute other resources in distinct hosts. The proposed algorithms achieve simultaneous node (host) and link (connection) mappings. A heuristic algorithm is proposed to address the poor scalability and high complexity of the exact solution(s). The heuristic scales much better and is several orders of magnitude more efficient in terms of convergence time towards near optimal and optimal solutions. This is achieved by reducing complexity of the mapping process using topological patterns to map virtual graph requests to physical graphs representing respectively the tenants' requests and the providers' physical infrastructures. The proposed approach relies on graph decomposition into topology patterns and bipartite graphs matching techniques. The third part propose an open source Cloud Networking framework to achieve cloud and network resources provisioning and instantiation in order to respectively host and activate the tenants' virtual resources and services. This framework enables and facilitates dynamic networking of distributed cloud services and applications. This solution relies on a Cloud Network Gateway Manager and gateways to establish dynamic connectivity between cloud and network resources. The CNG-Manager provides the application networking control and supports the deployment of the needed underlying network functions in the tenant desired infrastructure (or slice since the physical infrastructure is shared by multiple tenants with each tenant receiving a dedicated and isolated portion/share of the physical resources)
42
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 textAbstract:
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.
43
Slim, Farah. "Etude et implémentation d'algorithmes de gestion de ressources pour un système d'exploitation de réseau." Thesis, Ecole nationale supérieure Mines-Télécom Atlantique Bretagne Pays de la Loire, 2018. http://www.theses.fr/2018IMTA0071.
Full textAbstract:
L’automatisation et la capacité de rendre les réseaux totalement programmables est un enjeu majeur dans l’évolution des systèmes de télécommunications. Rendre les réseaux plus flexibles et proches du système d’information est une question récurrente dans le monde des réseaux depuis de nombreuses années, mais l’émergence de nouvelles initiatives dans le cadre de l’Internet du futur, notamment avec le développement d’outils de gestion associés comme OpenStack, ont permis de développer de nouvelles approches pour la commande et la gestion des équipements de réseau. Grâce à ces nouveaux paradigmes, le secteur télécom est désormais au coeur d'une transformation digitale. Cette transformation s'appuie sur de nouvelles technologies émergentes telles que la virtualisation, les réseaux définis par logiciels, et le déploiement des services réseaux sur le cloud. L’objectif de la thèse est d'analyser les modifications qui vont affecter l'infrastructure de l'opérateur dans le but de concevoir des algorithmes de gestion de ressources adaptés au contexte de la virtualisation des fonctions réseauxNetwork programmability is a major issue in the evolution of telecommunication systems. However, the emergence of new initiatives in the context of the internet of the future, such as network function virtualization and specialized tools such as Openstack makes it possible to develop new approaches to control and manage the network infrastructure. This new approach on which telecom operators rely to accelerate their digital transformation will impact not only the way networks are defined but also the main role of the operator, who now hasto manage cloud resources in combination with network resources. The main goal of the thesis is to analyze the modifications that will affect the infrastructure of the operator in order to design resource allocation algorithms adapted to the context of the virtualization of network functions
44
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 textAbstract:
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éseauRecent 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)
45
Ogunleye, Babatunde Samuel. "WiMAX spectrum virtualization and network federation." Doctoral thesis, University of Cape Town, 2017. http://hdl.handle.net/11427/27011.
Full textAbstract:
Spectrum management in wireless broadband networks as regards its cost and its efficient usage has posed a huge challenge for mobile network operators. Traditionally, network operators had exclusive rights to access the band of spectrum allocated to them, but with the high price of spectrum license, it is becoming necessary to find alternative ways to use and access spectrum more efficiently. Resource virtualization is a method which has been extensively adopted in hardware computing for creating abstract versions of physical hardware resources and it has proven to be a powerful technique for customized resource provision and sharing. This idea of resource virtualization is gradually being transferred into the domain of wireless mobile network resource management but the ideas around it are still evolving. Since spectrum is an important wireless network resource, it is imperative to provide an efficient and cost effective means for the resource to be accessed and utilized. Therefore the idea of spectrum virtualization is investigated in this research as a possible solution to this problem. To expand on the notion of spectrum virtualization, this research further explores the idea of network federation. Network Federation involves the interconnection of diverse network components to be operated as a single seamless network. This will enable them share their network resources while the networks are geographically dispersed and managed by different network operators. To fully implement these concepts there is a need for a well-developed network framework. This research proposes two novel architectures for spectrum virtualization and network federation using the WiMAX (Worldwide Interoperability for Microwave Exchange) wireless broadband technology. The proposed WiMAX spectrum virtualization architecture introduces a novel entity known as the Virtual Spectrum Hypervisor (VS-Hypervisor). This VS-Hypervisor bears the responsibility of spectrum management and virtualization within the WiMAX framework. In the implementation of WiMAX network federation, the novel architecture enables the cooperative existence of multiple WiMAX base-stations having virtualization capabilities with overlapping cellular coverage areas for the purpose of sharing their spectrum resources. In this architecture, a novel federation control plane known as the Virtual Spectrum Exchange Locale (VSEL) is proposed. The VSEL facilitates the VS-Hypervisors in the federated physical base-stations to be able to negotiate and exchange spectrum between themselves to match their spectrum needs. The architectures for WiMAX spectrum virtualization and network federation was modelled and implemented using the OPNET Modeler. Results obtained validated their efficacy with respect to the effective management of the wireless network spectrum. Therefore this proposed network architectures would help network operators optimize their radio networks.
46
Pitzus, Antonio. "SDN : Software Defined Networking." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2017. http://amslaurea.unibo.it/14006/.
Full textAbstract:
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.
47
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 textAbstract:
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ébitTo 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
48
Song, Yihong. "P-Cycle-based Protection in Network Virtualization." Thèse, Université d'Ottawa / University of Ottawa, 2013. http://hdl.handle.net/10393/23813.
Full textAbstract:
As the "network of network", the Internet has been playing a central and crucial role in modern society, culture, knowledge, businesses and so on in a period of over two decades by supporting a wide variety of network technologies and applications. However, due to its popularity and multi-provider nature, the future development of the Internet is limited to simple incremental updates.
To address this challenge, network virtualization has been propounded as a potential candidate to provide the essential basis for the future Internet architecture. Network virtualization is capable of providing an open and flexible networking environment in which service providers are allowed to dynamically compose multiple coexisting heterogeneous virtual networks on a shared substrate network. Such a flexible environment will foster the deployment of diversified services and applications.
A major challenge in network virtualization area is the Virtual Network Embedding (VNE), which aims to statically or dynamically allocate virtual nodes and virtual links on substrate resources, physical nodes and paths. Making effective use of substrate resources requires high-efficient and survivable VNE techniques. The main contribution of this thesis is two high-performance p-Cycle-based survivable virtual network embedding approaches. These approaches take advantage of p-Cycle-based protection techniques that minimize the backup resources while providing a full VN protection scheme against link and node failures.
49
Tseliou, Georgia. "Network virtualization in next generation cellular networks." Doctoral thesis, Universitat Politècnica de Catalunya, 2019. http://hdl.handle.net/10803/667301.
Full textAbstract:
The complexity of operation and management of emerging cellular networks significantly increases, as they evolve to correspond to increasing QoS needs, data rates and diversity of offered services. Thus critical challenges appear regarding their performance. At the same time, network sustainability pushes toward the utilization of haring Radio Access Network (RAN) infrastructure between Mobile Network Operators (MNOs). This requires advanced network management techniques which have to be developed based on characteristics of these networks and traffic demands. Therefore it is necessary to provide solutions enabling the creation of logically isolated network partitions over shared physical network infrastructure. Multiple heterogeneous virtual networks should simultaneously coexist and support resource aggregation so as to appear as a single resource to serve different traffic types on demand.
Hence in this thesis, we study RAN virtualization and slicing solutions destined to tackle these challenges. In the first part, we present our approach to map virtual network elements onto radio resources of the substrate physical network, in a dense multi-tier LTE-A scenario owned by a MNO. We propose a virtualization solution at BS level, where baseband modules of distributed BSs, interconnected via logical point-to-point X2 interface, cooperate to reallocate radio resources on a traffic need basis. Our proposal enhances system performance by achieving 53% throughput gain compared with benchmark schemes without substantial signaling overhead. In the second part of the thesis, we concentrate on facilitating resource provisioning between multiple Virtual MNOs (MVNOs), by integrating the capacity broker in the 3GPP network management architecture with minimum set of enhancements. A MNO owns the network and provides RAN access on demand to several MVNOs. Furthermore we propose an algorithm for on-demand resource allocation considering two types of traffic. Our proposal achieves 50% more admitted requests without Service Level Agreement (SLA) violation compared with benchmark schemes. In the third part, we devise and study a solution for BS agnostic network slicing leveraging BS virtualization in a multi-tenant scenario. This scenario is composed of different traffic types (e.g., tight latency requirements and high data rate demands) along with BSs characterized by different access and transport capabilities (i.e., Remote Radio Heads, RRHs, Small Cells, SCs and future 5G NodeBs, gNBs with various functional splits having ideal and non-ideal transport network). Our solution achieves 67% average spectrum usage gain and 16.6% Baseband Unit processing load reduction compared with baseline scenarios. Finally, we conclude the thesis by providing insightful research challenges for future works.La complejidad de la operación y la gestión de las emergentes redes celulares aumenta a medida que evolucionan para hacer frente a las crecientes necesidades de calidad de servicio (QoS), las tasas de datos y la diversidad de los servicios ofrecidos. De esta forma aparecen desafíos críticos con respecto a su rendimiento. Al mismo tiempo, la sostenibilidad de la red empuja hacia la utilización de la infraestructura de red de acceso radio (RAN) compartida entre operadores de redes móviles (MNO). Esto requiere técnicas avanzadas de gestión de redes que deben desarrollarse en función de las características especiales de estas redes y las demandas de tráfico. Por lo tanto, es necesario proporcionar soluciones que permitan la creación de particiones de red aisladas lógicamente sobre la infraestructura de red física compartida. Para ello, en esta tesis, estudiamos las soluciones de virtualización de la RAN destinadas a abordar estos desafíos. En la primera parte de la tesis, nos centramos en mapear elementos de red virtual en recursos de radio de la red física, en un escenario LTE-A de múltiples niveles que es propiedad de un solo MNO. Proponemos una solución de virtualización a nivel de estación base (BS), donde los módulos de banda base de BSs distribuidas, interconectadas a través de la interfaz lógica X2, cooperan para reasignar los recursos radio en función de las necesidades de tráfico. Nuestra propuesta mejora el rendimiento del sistema al obtener un rendimiento 53% en comparación con esquemas de referencia. En la segunda parte de la tesis, nos concentramos en facilitar el aprovisionamiento de recursos entre muchos operadores de redes virtuales móviles (MVNO), al integrar el capacity broker en la arquitectura de administración de red 3GPP con un conjunto míinimo de mejoras. En este escenario, un MNO es el propietario de la red y proporciona acceso bajo demanda (en inglés on-demand) a varios MVNOs. Además, para aprovechar al máximo las capacidades del capacity broker, proponemos un algoritmo para la asignación de recursos bajo demanda, considerando dos tipos de tráfico con distintas características. Nuestra propuesta alcanza 50% más de solicitudes admitidas sin violación del Acuerdo de Nivel de Servicio (SLA) en comparación con otros esquemas. En la tercera parte de la tesis, estudiamos una solución para el slicing de red independiente del tipo de BS, considerando la virtualización de BS en un escenario de múltiples MVNOs (multi-tenants). Este escenario se compone de diferentes tipos de tráfico (por ejemplo, usuarios con requisitos de latencia estrictos y usuarios con altas demandas de velocidad de datos) junto con BSs caracterizadas por diferentes capacidades de acceso y transporte (por ejemplo, Remote Radio Heads, RRHs, Small cells, SC y 5G NodeBs, gNBs con varias divisiones funcionales que tienen una red de transporte ideal y no ideal). Nuestra solución logra una ganancia promedio de uso de espectro de 67% y una reducción de la carga de procesamiento de la banda base de 16.6% en comparación con escenarios de referencia. Finalmente, concluimos la tesis al proporcionando los desafíos y retos de investigación para trabajos futuros.
50
Glidden, Todd P. "Privacy for mobile networks via network virtualization." Thesis, Monterey, Calif. : Naval Postgraduate School, 2009. http://edocs.nps.edu/npspubs/scholarly/theses/2009/March/09Mar%5FGlidden.pdf.
Full textAbstract:
Thesis (M.S. in Computer Science)--Naval Postgraduate School, March 2009.Thesis Advisor(s): Singh, Gurminder ; Gibson, John. "March 2009." Description based on title screen as viewed on April 23, 2009. Author(s) subject terms: Privacy, mobile networks, first responders, mobile file sharing, data dissemination. Includes bibliographical references (p. 47-49). Also available in print.