On load balancing via switch migration in software-defined networking

Switch-controller assignment is an essential task in multi-controller software-defined networking. Static assignments are not practical because network dynamics are complex and difficult to predetermine. Since network load varies both in space and time, the mapping of switches to controllers should be adaptive to sudden changes in the network. To that end, switch migration plays an important role in maintaining dynamic switch-controller mapping. Migrating switches from overloaded to underloaded controllers brings flexibility and adaptability to the network but, at the same time, deciding which switches should be migrated to which controllers, while maintaining a balanced load in the network, is a challenging task. This work presents a heuristic approach with solution shaking to solve the switch migration problem. Shift and swap moves are incorporated within a search scheme. Every move is evaluated by how much benefititwillgivetoboththeimmigrationandoutmigrationcontrollers.Theexperimentalresultsshowthat theproposedapproachisabletooutweighthestate-of-artapproaches,andimprovetheloadbalancingresults up to≈ 14% in some scenarios when compared to the most recent approach. In addition, the results show that the proposed work is more robust to controller failure than the state-of-art methods.Portuguese Science and Technology Foundation (FCT) - UID/MULTI/00631/2019;info:eu-repo/semantics/publishedVersio

Gestion flexible des ressources dans les réseaux de nouvelle génération avec SDN

Abstract : 5G and beyond-5G/6G are expected to shape the future economic growth of multiple vertical industries by providing the network infrastructure required to enable innovation and new business models. They have the potential to offer a wide spectrum of services, namely higher data rates, ultra-low latency, and high reliability. To achieve their promises, 5G and beyond-5G/6G rely on software-defined networking (SDN), edge computing, and radio access network (RAN) slicing technologies. In this thesis, we aim to use SDN as a key enabler to enhance resource management in next-generation networks. SDN allows programmable management of edge computing resources and dynamic orchestration of RAN slicing. However, achieving efficient performance based on SDN capabilities is a challenging task due to the permanent fluctuations of traffic in next-generation networks and the diversified quality of service requirements of emerging applications. Toward our objective, we address the load balancing problem in distributed SDN architectures, and we optimize the RAN slicing of communication and computation resources in the edge of the network. In the first part of this thesis, we present a proactive approach to balance the load in a distributed SDN control plane using the data plane component migration mechanism. First, we propose prediction models that forecast the load of SDN controllers in the long term. By using these models, we can preemptively detect whether the load will be unbalanced in the control plane and, thus, schedule migration operations in advance. Second, we improve the migration operation performance by optimizing the tradeoff between a load balancing factor and the cost of migration operations. This proactive load balancing approach not only avoids SDN controllers from being overloaded, but also allows a judicious selection of which data plane component should be migrated and where the migration should happen. In the second part of this thesis, we propose two RAN slicing schemes that efficiently allocate the communication and the computation resources in the edge of the network. The first RAN slicing scheme performs the allocation of radio resource blocks (RBs) to end-users in two time-scales, namely in a large time-scale and in a small time-scale. In the large time-scale, an SDN controller allocates to each base station a number of RBs from a shared radio RBs pool, according to its requirements in terms of delay and data rate. In the short time-scale, each base station assigns its available resources to its end-users and requests, if needed, additional resources from adjacent base stations. The second RAN slicing scheme jointly allocates the RBs and computation resources available in edge computing servers based on an open RAN architecture. We develop, for the proposed RAN slicing schemes, reinforcement learning and deep reinforcement learning algorithms to dynamically allocate RAN resources.La 5G et au-delà de la 5G/6G sont censées dessiner la future croissance économique de multiples industries verticales en fournissant l'infrastructure réseau nécessaire pour permettre l'innovation et la création de nouveaux modèles économiques. Elles permettent d'offrir un large spectre de services, à savoir des débits de données plus élevés, une latence ultra-faible et une fiabilité élevée. Pour tenir leurs promesses, la 5G et au-delà de la-5G/6G s'appuient sur le réseau défini par logiciel (SDN), l’informatique en périphérie et le découpage du réseau d'accès (RAN). Dans cette thèse, nous visons à utiliser le SDN en tant qu'outil clé pour améliorer la gestion des ressources dans les réseaux de nouvelle génération. Le SDN permet une gestion programmable des ressources informatiques en périphérie et une orchestration dynamique de découpage du RAN. Cependant, atteindre une performance efficace en se basant sur le SDN est une tâche difficile due aux fluctuations permanentes du trafic dans les réseaux de nouvelle génération et aux exigences de qualité de service diversifiées des applications émergentes. Pour atteindre notre objectif, nous abordons le problème de l'équilibrage de charge dans les architectures SDN distribuées, et nous optimisons le découpage du RAN des ressources de communication et de calcul à la périphérie du réseau. Dans la première partie de cette thèse, nous présentons une approche proactive pour équilibrer la charge dans un plan de contrôle SDN distribué en utilisant le mécanisme de migration des composants du plan de données. Tout d'abord, nous proposons des modèles pour prédire la charge des contrôleurs SDN à long terme. En utilisant ces modèles, nous pouvons détecter de manière préemptive si la charge sera déséquilibrée dans le plan de contrôle et, ainsi, programmer des opérations de migration à l'avance. Ensuite, nous améliorons les performances des opérations de migration en optimisant le compromis entre un facteur d'équilibrage de charge et le coût des opérations de migration. Cette approche proactive d'équilibrage de charge permet non seulement d'éviter la surcharge des contrôleurs SDN, mais aussi de choisir judicieusement le composant du plan de données à migrer et l'endroit où la migration devrait avoir lieu. Dans la deuxième partie de cette thèse, nous proposons deux mécanismes de découpage du RAN qui allouent efficacement les ressources de communication et de calcul à la périphérie des réseaux. Le premier mécanisme de découpage du RAN effectue l'allocation des blocs de ressources radio (RBs) aux utilisateurs finaux en deux échelles de temps, à savoir dans une échelle de temps large et dans une échelle de temps courte. Dans l’échelle de temps large, un contrôleur SDN attribue à chaque station de base un certain nombre de RB à partir d'un pool de RB radio partagé, en fonction de ses besoins en termes de délai et de débit. Dans l’échelle de temps courte, chaque station de base attribue ses ressources disponibles à ses utilisateurs finaux et demande, si nécessaire, des ressources supplémentaires aux stations de base adjacentes. Le deuxième mécanisme de découpage du RAN alloue conjointement les RB et les ressources de calcul disponibles dans les serveurs de l’informatique en périphérie en se basant sur une architecture RAN ouverte. Nous développons, pour les mécanismes de découpage du RAN proposés, des algorithmes d'apprentissage par renforcement et d'apprentissage par renforcement profond pour allouer dynamiquement les ressources du RAN

SDN workload balancing and QoE control in next generation network infrastructures

The increasing demand of bandwidth, low latency and reliability, even in mobile scenarios, has pushed the evolution of the networking technologies to satisfy new requirements of innovative services. Flexible orchestration of network resources is increasingly being investigated by the research community and by the service operator companies as a mean to easily deploy new remunerative services while reducing capital expenditures and operating expenses. In this regard, the Future Internet initiatives are expected to improve state of the art technologies by developing new orchestrating platforms based on the most prominent enabling technologies, namely, Software Defined Network (SDN) orchestrated Network Function Virtualization (NFV) infrastructure. After introducing the fundamental of the Next Generation Network, formalized as the conceptual Future Internet Platform architecture, the reference scenarios and the proposed control frameworks are given. The thesis discusses the design of two resources management framework of such architecture, targeted, respectively, (i) at the balancing of SDN Control traffic at the network core and (ii) at the user Quality of Experience (QoE) evaluation and control at the network edge. Regarding the first framework, to address the issues related with the adoption of a logically centralized but physically distributed SDN control plane, a discrete-time, distributed, non-cooperative load balancing algorithm is proposed, based on game theory and converged to a specific equilibrium known as Wardrop equilibrium. Regarding the QoE framework, a cognitive approach is presented, aimed at controlling the Quality of Experience (QoE) of the end users by closing the loop between the provided QoS and the user experience feedbacks parameters. QoE Management functionalities are aimed at approaching the desired QoE level exploiting a mathematical model and methodology to identify a set of QoE profiles and an optimal and adaptive control strategy based on a Reinforcement Learning algorithm. For both the proposed solutions, simulation and proof-of-concept implementation results are presented and discussed, to highlight the correctness and the effectiveness of the proposed solutions

Optimizing total cost of ownership (TCO) for 5G multi-tenant mobile backhaul (MBH) optical transport networks

Legacy network elements are reaching end-of-life and packet-based transport networks are not efficiently optimized. In particular, high density cell architecture in future 5G networks will face big technical and financial challenges due to avalanche of traffic volume and massive growth in connected devices. Raising density and ever-increasing traffic demand within future 5G Heterogeneous Networks (HetNets) will result in huge deployment, expansion and operating costs for upcoming Mobile BackHaul (MBH) networks with flat revenue generation. Thus, the goal of this dissertation is to provide an efficient physical network planning mechanism and an optimized resource engineering tool in order to reduce the Total Cost of Ownership (TCO) and increase the generated revenues. This will help Service Providers (SPs) and Mobile Network Operators (MNOs) to improve their network scalability and maintain positive Project Profit Margins (PPM). In order to meet this goal, three key issues are required to be addressed in our framework and are summarized as follows: i) how to design and migrate to a scalable and reliable MBH network in an optimal cost?, ii) how to control the deployment and activation of the network resources in such MBH based on required traffic demand in an efficient and cost-effective way?, and iii) how to enhance the resource sharing in such network and maximize the profit margins in an efficient way? As part of our contributions to address the first issue highlighted above and to plan the MBH with reduced network TCO and improved scalability, we propose a comprehensive migration plan towards an End-to-End Integrated-Optical-Packet-Network (E2-IOPN) for SP optical transport networks. We review various empirical challenges faced by a real SP during the transformation process towards E2-IOPN as well as the implementation of an as-built plan and a high-level design (HLD) for migrating towards lower cost-per-bit GPON, MPLS-TP, OTN and next-generation DWDM technologies. Then, we propose a longer-term strategy based on SDN and NFV approach that will offer rapid end-to-end service provisioning with costefficient centralized network control. We define CapEx and OpEx cost models and drive a cost comparative study that shows the benefit and financial impact of introducing new low-cost packet-based technologies to carry traffic from legacy and new services. To address the second issue, we first introduce an algorithm based on a stochastic geometry model (Voronoi Tessellation) to more precisely define MBH zones within a geographical area and more accurately calculate required traffic demands and related MBH infrastructure. In order to optimize the deployment and activation of the network resources in the MBH in an efficient and cost-effective way, we propose a novel method called BackHauling-as-a-Service (BHaaS) for network planning and Total Cost of Ownership (TCO) analysis based on required traffic demand and a "You-pay-only-for-what-you-use" approach. Furthermore, we enhance BHaaS performance by introducing a more service-aware method called Traffic-Profile-asa- Service (TPaaS) to further drive down the costs based on yearly activated traffic profiles. Results show that BHaaS and TPaaS may enhance by 22% the project benefit compared to traditional TCO model. Finally, we introduce a new cost (CapEx and OpEx) models for 5G multi-tenant Virtualized MBH (V-MBH) as part of our contribution to address the third issue. In fact, in order to enhance the resource sharing and maximize the network profits, we drive a novel pay-as-yougrow and optimization model for the V-MBH called Virtual-Backhaul-as-a-Service (VBaaS). VBaaS can serve as a planning tool to optimize the Project Profit Margin (PPM) while considering the TCO and the yearly generated Return-on-Investment (ROI). We formulate an MNO Pricing Game (MPG) for TCO optimization to calculate the optimal Pareto-Equilibrium pricing strategy for offered Tenant Service Instances (TSI). Then, we compare CapEx, OpEx, TCO, ROI and PPM for a specific use-case known in the industry as CORD project using Traditional MBH (T-MBH) versus Virtualized MBH (V-MBH) as well as using randomized versus Pareto-Equilibrium pricing strategies. The results of our framework offer SPs and MNOs a more precise estimation of traffic demand, an optimized infrastructure planning and yearly resource deployment as well as an optimized TCO analysis (CapEx and OpEx) with enhanced pricing strategy and generated ROI. Numerical results show more than three times increase in network profitability using our proposed solutions compared with Traditional MBH (T-MBH) methods

Evolution Toward 5G Mobile Networks - A Survey on Enabling Technologies

In this paper, an extensive review has been carried out on the trends of existing as well as proposed potential enabling technologies that are expected to shape the fifth generation (5G) mobile wireless networks. Based on the classification of the trends, we develop a 5G network architectural evolution framework that comprises three evolutionary directions, namely, (1) radio access network node and performance enabler, (2) network control programming platform, and (3) backhaul network platform and synchronization. In (1), we discuss node classification including low power nodes in emerging machine-type communications, and network capacity enablers, e.g., millimeter wave communications and massive multiple-input multiple-output. In (2), both logically distributed cell/device-centric platforms, and logically centralized conventional/wireless software defined networking control programming approaches are discussed. In (3), backhaul networks and network synchronization are discussed. A comparative analysis for each direction as well as future evolutionary directions and challenges toward 5G networks are discussed. This survey will be helpful for further research exploitations and network operators for a smooth evolution of their existing networks toward 5G networks

A Game-Theoretic Approach to Strategic Resource Allocation Mechanisms in Edge and Fog Computing

With the rapid growth of Internet of Things (IoT), cloud-centric application management raises questions related to quality of service for real-time applications. Fog and edge computing (FEC) provide a complement to the cloud by filling the gap between cloud and IoT. Resource management on multiple resources from distributed and administrative FEC nodes is a key challenge to ensure the quality of end-user’s experience. To improve resource utilisation and system performance, researchers have been proposed many fair allocation mechanisms for resource management. Dominant Resource Fairness (DRF), a resource allocation policy for multiple resource types, meets most of the required fair allocation characteristics. However, DRF is suitable for centralised resource allocation without considering the effects (or feedbacks) of large-scale distributed environments like multi-controller software defined networking (SDN). Nash bargaining from micro-economic theory or competitive equilibrium equal incomes (CEEI) are well suited to solving dynamic optimisation problems proposing to ‘proportionately’ share resources among distributed participants. Although CEEI’s decentralised policy guarantees load balancing for performance isolation, they are not faultproof for computation offloading. The thesis aims to propose a hybrid and fair allocation mechanism for rejuvenation of decentralised SDN controller deployment. We apply multi-agent reinforcement learning (MARL) with robustness against adversarial controllers to enable efficient priority scheduling for FEC. Motivated by software cybernetics and homeostasis, weighted DRF is generalised by applying the principles of feedback (positive or/and negative network effects) in reverse game theory (GT) to design hybrid scheduling schemes for joint multi-resource and multitask offloading/forwarding in FEC environments. In the first piece of study, monotonic scheduling for joint offloading at the federated edge is addressed by proposing truthful mechanism (algorithmic) to neutralise harmful negative and positive distributive bargain externalities respectively. The IP-DRF scheme is a MARL approach applying partition form game (PFG) to guarantee second-best Pareto optimality viii | P a g e (SBPO) in allocation of multi-resources from deterministic policy in both population and resource non-monotonicity settings. In the second study, we propose DFog-DRF scheme to address truthful fog scheduling with bottleneck fairness in fault-probable wireless hierarchical networks by applying constrained coalition formation (CCF) games to implement MARL. The multi-objective optimisation problem for fog throughput maximisation is solved via a constraint dimensionality reduction methodology using fairness constraints for efficient gateway and low-level controller’s placement. For evaluation, we develop an agent-based framework to implement fair allocation policies in distributed data centre environments. In empirical results, the deterministic policy of IP-DRF scheme provides SBPO and reduces the average execution and turnaround time by 19% and 11.52% as compared to the Nash bargaining or CEEI deterministic policy for 57,445 cloudlets in population non-monotonic settings. The processing cost of tasks shows significant improvement (6.89% and 9.03% for fixed and variable pricing) for the resource non-monotonic setting - using 38,000 cloudlets. The DFog-DRF scheme when benchmarked against asset fair (MIP) policy shows superior performance (less than 1% in time complexity) for up to 30 FEC nodes. Furthermore, empirical results using 210 mobiles and 420 applications prove the efficacy of our hybrid scheduling scheme for hierarchical clustering considering latency and network usage for throughput maximisation.Abubakar Tafawa Balewa University, Bauchi (Tetfund, Nigeria

A QoS-Aware Joint Power and Subchannel Allocation Algorithm for Mobile Network Virtualization

Mobile network virtualization is a promising technology due to its flexibility and feasibility. Since it enables physical resources abstraction and sharing, the overall resource inefficiency can be reduced dramatically. By means of virtualization, mobile service providers can share their physical resources with multiple virtual network operators. In this paper, a joint power and subchannel allocation algorithm for mobile network virtualization (MNV) with quality of services support is proposed. It presents a resource allocation scheme for orthogonal frequency division multiple access-based MNV with multiple virtual network operators. An optimal solution is provided to maximize the total data rate of both infrastructure providers and virtual network operators. Numerical results have shown that the proposed resource allocation algorithm improves the overall performance