DOCSLIB.ORG

SDN/NFV Control Plane Optimizations for Fixed-Mobile Access and Data Center Optical Networking

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

i \main_BA" | 2018/3/29 | 9:37 | page i | #1 i i i SDN/NFV Control Plane Optimizations for Fixed-Mobile Access and Data Center Optical Networking Bogda-Mihai Andru¸s Supervisors: Professor Idelfonso Tafur Monroy, Professor Juan Jos´eVegas Olmos and Dr. Achim Autenrieth Delivery Date: 10th October 2017 DTU Fotonik Department of Photonics Engineering Technical University of Denmark Building 343 2800 Kgs. Lyngby DENMARK i i i i i \main_BA" | 2018/3/29 | 9:37 | page ii | #2 i i i i i i i i \main_BA" | 2018/3/29 | 9:37 | page i | #3 i i i Abstract This thesis seeks to leverage SDN and NFV technologies to enable scalable, high performance, resilient and cost effective Fixed-Mobile Convergence (FMC) on three separate segments: access/aggregation, inter but also in- tra data center (DC) networks for distributed Next Generation Points of Presence (NG-POP - the location in the operator infrastructure centralizing the IP edge for all access types). From a structural stand point, shared access/aggregation for data trans- port solutions (i.e., low latency optical cross connects and Wavelength Di- vision Multiplexed-Passive Optical Networks) are proposed, evaluated and assessed for compatibility with the stringent bandwidth, latency and jitter requirements for baseband mobile, fixed and Wi-Fi services. Functional convergence is achieved by integrating universal network functions like Au- thentication, Data Path Management, content caching inside the NG-POP with the help of SDN and NFV techniques. Comprehensive convergence is demonstrated, for the first time to our knowledge, through the study of a series of use cases highlighting the FMC impact on user experience: seamless authentication and roaming through various network access points (i.e., Wi-Fi, mobile, fixed) as well as improved QoS and network utilization through content caching. To provide survivability for NG-POPs, Network Function live migration with zero downtime is demonstrated as a prevention mechanism for infrastructure failure. High performance scalable DCs are required by NG-POPs for providing services like content caching, multi-tenancy support, customer applications among others. To develop compatible, cost effective DC solutions, we in- vestigate new high radix DC topologies (i.e., hypercube, fat tree, torus, jellyfish) as well as optimizing control plane operations by adopting SDN. We demonstrate that, for a high performing topology like hypercube, SDN can achieve a 45% throughput increase, as opposed to conventional Span- ning Tree Protocol. i i i i i i \main_BA" | 2018/3/29 | 9:37 | page ii | #4 i i i ii Abstract Optimizing elastic optical network control plane for DC connections, is another aspect investigated in this work. We propose a modular scal- able flexi-grid optical domain controller based on Finite State Machines and a NETCONF/YANG standard northbound interface. The modular structure allows either a centralized or a distributed deployment for on the fly encrypted device management connections. Controller evaluation over networks ranging from 1 to 64 ROADMs show a relatively constant start up and synchronization time in both deployments. These results, together with a modest log scale growth of media channel set up time, validate the scalability of our controller. i i i i i \main_BA" | 2018/3/29 | 9:37 | page iii | #5 i i i Resum´e Denne afhandling sigter mod at udnytte SDN og NFV teknologier til at muliggøre skalerbar, høj ydeevne, robust og omkostningseffektiv Fixed- Mobile Convergence (FMC) p˚atre separate segmenter: adgang / aggregering, inter og intra data center (DC) netværk til distribuerede Next Generation Points of Presence (NG-POP - placeringen i operatørinfrastrukturen der centraliserer IP-kanten for alle adgangstyper). Fra et strukturelt standpunkt foresl˚as,vurderes og valideres fælles adgangs / aggregeringstransportløsninger (dvs. optisk krydsforbindelser med lav la- tency og bølgelængde-division Multiplexede-Passive Optiske Netværk) som er kompatible med de stringente b˚andbredde-,latency- og jitterkrav for baseband mobile, fastnet og Wi-Fi-tjenester. Funktionel konvergens opn˚as ved at integrere universelle netværks funktioner s˚asom autentificering, Data vejs Management og indholds caching inde i NG-POP ved hjælp af SDN og NFV teknikker. Omfattende konvergens demonstreres for første gang, ifølge vores viden, gennem en række bruger tilfælde, der fremhæver FMC's indvirkning p˚abrugeroplevelsen: sømløs godkendelse og roaming gennem forskellige netværksadgangspunkter (dvs. Wi-Fi, mobil, fast) samt forbedret QoS og netværksudnyttelse gennem indholds caching. For at give overlevelsesevne til NG-POP'er, demonstreres en netværksfunktion med nulstilling og uden nedetid, som en forebyggende mekanisme for infrastruk- turfejl. Højtydende skalerbare DC'er er p˚akrævet af NG-POP'er for at levere tjenester som indholds-caching, multi-forbruger og kundeapplikationer mv. For at udvikle kompatible, omkostningseffektive DC-løsninger undersøger vi nye høj-radix DC-topologier (dvs. hypercube, fat tree, torus, jellyfish) samt optimering af kontrolplanoperationer ved at implementere SDN. Vi demonstrerer at SDN, for en højtydende topologi som f.eks. hypercube, kan opn˚aen 45% gennemstrømningsforøgelse i modsætning til den konven- tionelle Spanning Tree Protocol. iii i i i i i \main_BA" | 2018/3/29 | 9:37 | page iv | #6 i i i iv Resum´e Optimering af et elastisk optisk netværkskontrolplan for DC-forbindelser, er et andet aspekt, der undersøges i dette arbejde. Vi foresl˚aren mod- ulær skalerbar flexi-grid optisk domæne controller baseret p˚aFinite State Machines og en NETCONF / YANG standard for nordg˚aendegrænse- flader. Den modulære struktur tillader enten en centraliseret eller en dis- tribueret implementering for krypterede enhedsadministrationsforbindelser. Evaluering af kontrolmekanismen, over netværk, der spænder fra 1 til 64 ROADM'er, viser en forholdsvis konstant opstarts- og synkroniseringstid p˚aca. 920 ms for den centrale og 1150 ms for den distribuerede imple- mentering. Disse resultater, sammen med en beskeden log-skala vækst af mediekanalers opsætningstid, validerer skalerbarhden af vores controller. i i i i i \main_BA" | 2018/3/29 | 9:37 | page v | #7 i i i Acknowledgements This thesis is based on the achievement of my research within the depart- ment of Photonics Engineering, Technical University of Denmark and with ADVA Optical Networking SE in Martinsried/Munich, Germany. First of all, I would like to thank my supervisors Prof. Idelfonso Tafur Monroy, Prof. Juan Jos´eVegas Olmos and Dr. Achim Autenrieth for giving me the opportunity to do my Ph.D. in their group, for their support and also their belief in me during the course of my Ph.D. In addition, I would like to thank my colleague from ADVA: Thomas Szyrkowiec for all the help and motivation to improve my work and expand my knowledge in the field of SDN. From DTU, I would like to thank, Saul Vasquez for printing this thesis, Lau Suhr for translating this abstract in Danish and all my colleagues from the former Metro-Access group, for their personal support. To my parents back home, to whom I owe all my personal and profes- sional achievements, I want to thank them for their invaluable faith and moral support. Finally, I want to thank my girlfriend Corina Gres, anu for proofreading this thesis but especially for her love, inspiration and patience during all my studies. Bogdan-Mihai Andru¸s November 2017 v i i i i i \main_BA" | 2018/3/29 | 9:37 | page vi | #8 i i i i i i i i \main_BA" | 2018/3/29 | 9:37 | page vii | #9 i i i Summary of Original Work This thesis is based on the following original publications: PAPER A B. Andrus, A. Autenrieth, S. Pachnicke, S. Zou, J.J. V. Olmos and I. T. Monroy, \Performance Evaluation of NETCONF-Based Low Latency Cross-Connect for 5G C-RAN Architectures," Accepted for publication in International Conference on Transparent Optical Networks (ICTON), 2018, (Invited). PAPER B B. Andrus, R. Martinez, A. Autenrieth, M. Requena, R. Vilalta, B. Le Guyader, X. Grall, S. Gosselin, P. Olaszi, A. Pineda, A. Ladanyi, S. Zou, J. J .V. Olmos and I. T. Monroy, \Demonstration of Next Generation Point of Presence for Fixed-Mobile Convergence," Submitted for publication to International Journal On Advances in Networks and Services, issn: 1942- 2644, March 2018, (Invited). PAPER C B. Andrus, A. Autenrieth, S. Pachnicke, J. J. V. Olmos and I. T. Mon- roy, \Live Migration Downtime Analysis of a VNF Guest for a Proposed Optical FMC Network Architecture," in Proc. of 17th ITG-Fachtagung Photonische Netze Conference, Leipzig, Germany, 2016. PAPER D B. Andrus, O. M. Poncea, J.J. V. Olmos, and I. T. Monroy \Perfor- mance Evaluation of Two Highly Interconnected Data Center Networks," in Proc. of 17th International Conference on Transparent Optical Networks (ICTON), 2015. vii i i i i i \main_BA" | 2018/3/29 | 9:37 | page viii | #10 i i i viii Summary of Original Work PAPER E B. Andrus,V. Mehmeri, J.J. V. Olmos, S. Spolitis, V. Bobrovs, and I. T. Monroy, \SDN Data Center Performance Evaluation of Torus and Hypercube Interconnecting Schemes," in Proc. of Advances in Wireless and Optical Communications (RTUWO), 2015. PAPER F B. Andrus, V. Mehmeri, A. Autenrieth, J.J. V. Olmos, and I. T. Monroy, \Evaluation of SDN Enabled Data Center Networks Based on High Radix Topologies," Accepted for publication in Proc. of International Conference on Systems and Networks Communications (ICSNC), 2017. PAPER G B. Andrus, A. Autenrieth, T. Szyrkowiec, J.J. V. Olmos, and I. T. Monroy \Evaluation and Experimental Demonstration of SDN-Enabled Flexi-grid Optical Domain Controller based on NETCONF/YANG," Accepted for publication in Network Operations and Management Symposium (NOMS), Taipei, 2018. i i i i i \main_BA" | 2018/3/29 | 9:37 | page ix | #11 i i i ix Other scientific reports associated with the project: R1 S. Pachnicke, B. Andrus, and A. Autenrieth, "Impact of Fixed-Mobile Convergence, ", in International Conference on Optical Network Design and Modeling (ONDM), 2016.
Recommended publications
  • CS 554 / CSE 512: Parallel Numerical Algorithms Lecture Notes Chapter 1: Parallel Computing

    CS 554 / CSE 512: Parallel Numerical Algorithms Lecture Notes Chapter 1: Parallel Computing

    CS 554 / CSE 512: Parallel Numerical Algorithms Lecture Notes Chapter 1: Parallel Computing Michael T. Heath and Edgar Solomonik Department of Computer Science University of Illinois at Urbana-Champaign September 4, 2019 1 Motivation Computational science has driven demands for large-scale machine resources since the early days of com- puting. Supercomputers—collections of machines connected by a network—are used to solve the most computationally expensive problems and drive the frontier capabilities of scientific computing. Leveraging such large machines effectively is a challenge, however, for both algorithms and software systems. Numer- ical algorithms—computational methods for finding approximate solutions to mathematical problems— serve as the basis for computational science. Parallelizing these algorithms is a necessary step for deploying them on larger problems and accelerating the time to solution. Consequently, the interdependence of parallel and numerical computing has shaped the theory and practice of both fields. To study parallel numerical algo- rithms, we will first aim to establish a basic understanding of parallel computers and formulate a theoretical model for the scalability of parallel algorithms. 1.1 Need for Parallelism Connecting the latest technology chips via networks so that they can work in concert to solve larger problems has long been the method of choice for solving problems beyond the capabilities of a single computer. Improvements in microprocessor technology, hardware logic, and algorithms have expanded the scope of problems that can be solved effectively on a sequential computer. These improvements face fundamental physical barriers, however, so that parallelism has prominently made its way on-chip. Increasing the number of processing cores on a chip is now the dominant source of hardware-level performance improvement.
  • Principles of Distributed Computing

    Principles of Distributed Computing

    ii !"#$!%& ''''()*+$!,-' Principles of Distributed Computing Roger Wattenhofer [email protected] Spring 2016 iv CONTENTS 7.4 Applications . 80 8 Locality Lower Bounds 85 8.1 Model . 85 8.2 Locality . 86 8.3 The Neighborhood Graph . 88 Contents 9 Social Networks 93 9.1 Small World Networks . 94 9.2 Propagation Studies . 100 10 Synchronization 105 1 Vertex Coloring 5 10.1 Basics . 105 1.1 Problem & Model . .5 10.2 Synchronizer α ............................ 106 1.2 Coloring Trees . .8 10.3 Synchronizer β ............................ 107 2 Tree Algorithms 15 10.4 Synchronizer γ ............................ 108 2.1 Broadcast . 15 10.5 Network Partition . 110 2.2 Convergecast . 17 10.6 Clock Synchronization . 112 2.3 BFS Tree Construction . 18 2.4 MST Construction . 19 11 Communication Complexity 119 11.1 Diameter & APSP . 119 3 Leader Election 23 11.2 Lower Bound Graphs . 121 3.1 Anonymous Leader Election . 23 11.3 Communication Complexity . 124 3.2 Asynchronous Ring . 24 11.4 Distributed Complexity Theory . 129 3.3 Lower Bounds . 26 3.4 Synchronous Ring . 29 12 Wireless Protocols 133 12.1 Basics . 133 4 Distributed Sorting 33 12.2 Initialization . 135 4.1 Array & Mesh . 33 4.2 Sorting Networks . 36 12.2.1 Non-Uniform Initialization . 135 4.3 Counting Networks . 39 12.2.2 Uniform Initialization with CD . 135 12.2.3 Uniform Initialization without CD . 137 5 Shared Memory 47 12.3 Leader Election . 137 5.1 Model . 47 12.3.1 With High Probability . 137 5.2 Mutual Exclusion . 48 12.3.2 Uniform Leader Election . 138 5.3 Store & Collect .
  • Chapter 1: Parallel Computing

    Chapter 1: Parallel Computing

    CS 554 / CSE 512: Parallel Numerical Algorithms Lecture Notes Chapter 1: Parallel Computing Michael T. Heath and Edgar Solomonik Department of Computer Science University of Illinois at Urbana-Champaign November 10, 2017 1 Motivation Computational science has driven demands for large-scale machine resources since the early days of com- puting. Supercomputers—collections of machines connected by a network—are used to solve the most computationally expensive problems and drive the frontier capabilities of scientific computing. Leveraging such large machines effectively is a challenge, however, for both algorithms and software systems. Numer- ical algorithms—computational methods for finding approximate solutions to mathematical problems— serve as the basis for computational science. Parallelizing these algorithms is a necessary step for deploying them on larger problems and accelerating the time to solution. Consequently, the interdependence of parallel and numerical computing has shaped the theory and practice of both fields. To study parallel numerical algo- rithms, we will first aim to establish a basic understanding of parallel computers and formulate a theoretical model for the scalability of parallel algorithms. 1.1 Need for Parallelism Connecting the latest technology chips via networks so that they can work in concert to solve larger problems has long been the method of choice for solving problems beyond the capabilities of a single computer. Improvements in microprocessor technology, hardware logic, and algorithms have expanded the scope of problems that can be solved effectively on a sequential computer. These improvements face fundamental physical barriers, however, so that parallelism has prominently made its way on-chip. Increasing the number of processing cores on a chip is now the dominant source of hardware-level performance improvement.
  • Distributed Computing

    Distributed Computing

    !"#$!%& ''''()*+$!,-' Principles of Distributed Computing Roger Wattenhofer [email protected] Spring 2014 Contents 1 Vertex Coloring 5 1.1 Problem & Model . .5 1.2 Coloring Trees . .8 2 Leader Election 15 2.1 Anonymous Leader Election . 15 2.2 Asynchronous Ring . 16 2.3 Lower Bounds . 18 2.4 Synchronous Ring . 21 3 Tree Algorithms 23 3.1 Broadcast . 23 3.2 Convergecast . 24 3.3 BFS Tree Construction . 25 3.4 MST Construction . 27 4 Distributed Sorting 31 4.1 Array & Mesh . 31 4.2 Sorting Networks . 34 4.3 Counting Networks . 37 5 Shared Memory 45 5.1 Introduction . 45 5.2 Mutual Exclusion . 46 5.3 Store & Collect . 49 5.3.1 Problem Definition . 49 5.3.2 Splitters . 50 5.3.3 Binary Splitter Tree . 51 5.3.4 Splitter Matrix . 53 6 Shared Objects 57 6.1 Introduction . 57 6.2 Arrow and Friends . 58 6.3 Ivy and Friends . 63 7 Maximal Independent Set 69 7.1 MIS . 69 7.2 Original Fast MIS . 71 7.3 Fast MIS v2 . 74 i ii CONTENTS 7.4 Applications . 78 8 Locality Lower Bounds 83 8.1 Locality . 84 8.2 The Neighborhood Graph . 86 9 Social Networks 91 9.1 Small World Networks . 92 9.2 Propagation Studies . 98 10 Synchronization 101 10.1 Basics . 101 10.2 Synchronizer α ............................ 102 10.3 Synchronizer β ............................ 103 10.4 Synchronizer γ ............................ 104 10.5 Network Partition . 106 10.6 Clock Synchronization . 108 11 Hard Problems 115 11.1 Diameter & APSP . 115 11.2 Lower Bound Graphs . 117 11.3 Communication Complexity .