Energy-Efficient Softwarized Networks: A Survey

With the dynamic demands and stringent requirements of various applications, networks need to be high-performance, scalable, and adaptive to changes. Researchers and industries view network softwarization as the best enabler for the evolution of networking to tackle current and prospective challenges. Network softwarization must provide programmability and flexibility to network infrastructures and allow agile management, along with higher control for operators. While satisfying the demands and requirements of network services, energy cannot be overlooked, considering the effects on the sustainability of the environment and business. This paper discusses energy efficiency in modern and future networks with three network softwarization technologies: SDN, NFV, and NS, introduced in an energy-oriented context. With that framework in mind, we review the literature based on network scenarios, control/MANO layers, and energy-efficiency strategies. Following that, we compare the references regarding approach, evaluation method, criterion, and metric attributes to demonstrate the state-of-the-art. Last, we analyze the classified literature, summarize lessons learned, and present ten essential concerns to open discussions about future research opportunities on energy-efficient softwarized networks.Comment: Accepted draft for publication in TNSM with minor updates and editin

Joint Network Function Placement and Routing Optimization in Dynamic Software-defined Satellite-Terrestrial Integrated Networks

Software-defined satellite-terrestrial integrated networks (SDSTNs) are seen as a promising paradigm for achieving high resource flexibility and global communication coverage. However, low latency service provisioning is still challenging due to the fast variation of network topology and limited onboard resource at low earth orbit satellites. To address this issue, we study service provisioning in SDSTNs via joint optimization of virtual network function (VNF) placement and routing planning with network dynamics characterized by a time-evolving graph. Aiming at minimizing average service latency, the corresponding problem is formulated as an integer nonlinear programming under resource, VNF deployment, and time-slotted flow constraints. Since exhaustive search is intractable, we transform the primary problem into an integer linear programming by involving auxiliary variables and then propose a Benders decomposition based branch-and-cut (BDBC) algorithm. Towards practical use, a time expansion-based decoupled greedy (TEDG) algorithm is further designed with rigorous complexity analysis. Extensive experiments demonstrate the optimality of BDBC algorithm and the low complexity of TEDG algorithm. Meanwhile, it is indicated that they can improve the number of completed services within a configuration period by up to 58% and reduce the average service latency by up to 17% compared to baseline schemes.Comment: Accepted by IEEE Transactions on Wireless Communication

Towards the deployment of software defined networks over satellites - an in-laboratory demonstration for GEO satellite services

Traditional satellite communications missions are based on artificial satellites that can communicate with ground stations. This type of network provides wide-area coverage as well as resilient communications. Satellite systems are expected to be merged with the introduction of 5G/6G mobile systems to offer seamless connection and ubiquitous coverage for users worldwide. SDN/NFV are two of the most important enabling technologies for deploying new 5G/6G mobile network architectures, and they are widely used in telecommunications to deliver different services. Its method is based on network softwarization, which abstracts the physical infrastructure by separating the functionality of the hardware. Furthermore, using SDN, it is possible to reconfigure the network in flexible topologies that adapt to the performance necessary at any given time, thereby maximizing resources and lowering costs. SDN/NFV, on the other hand, relies on a strong and continuous network layer to construct a control plane and deploy VNF. However, establishing a stable link is difficult in constellations of several LEO/MEO satellites. TALENT is a software platform created with the purpose of supplying satellite and ground connection by coordinating satellite and terrestrial systems from a single location, developed under the SaTG5 project that defined the integration of satellite solutions for 5G. Regardless of these solutions, a robust testbed is required to help in the discovery of novel protocols for delivering and orchestrating network services over satellite networks that take dynamic network architecture on satellite constellations into account. This thesis addresses the lack of a testbed for deploying VNF via a satellite network, as well as the orchestration and deployment of VNF across various satellite constellations. Its main contribution is an update to TALENT to allow it to work with newer Open Source MANO versions, and a testbed for deploying a VNF across a simulated satellite network based on the OpenSand satellite simulation tool.Objectius de Desenvolupament Sostenible::9 - Indústria, Innovació i Infraestructur

Service Chaining Placement Based on Satellite Mission Planning in Ground Station Networks

As the increase in satellite number and variety, satellite ground stations should be required to offer user services in a flexible and efficient manner. Network function virtualization (NFV) can provide a new paradigm to allocate network resources on-demand for user services over the underlying network. However, most of the existing work focuses on the virtual network function (VNF) placement and routing traffic problem for enterprise data center networks, the issue needs to further study in satellite communication scenarios. In this paper, we investigate the VNF placement and routing traffic problem in satellite ground station networks. We formulate the problem of resource allocation as an integer linear programming (ILP) model and the objective is to minimize the link resource utilization and the number of servers used. Considering the information about satellite orbit fixation and mission planning, we propose location-aware resource allocation (LARA) algorithms based on Greedy and IBM CPLEX 12.10, respectively. The proposed LARA algorithm can assist in deploying VNFs and routing traffic flows by predicting the running conditions of user services. We evaluate the performance of our proposed LARA algorithm in three networks of Fat-Tree, BCube, and VL2. Simulation results show that our proposed LARA algorithm performs better than that without prediction, and can effectively decrease the average resource utilization of satellite ground station networks

Dynamic resource management for neighbor-based VNF placement in decentralized satellite networks

By introducing software-defined networking (SDN) and network function virtualization (NFV), low-earth-orbit (LEO) satellite networks can facilitate virtual network function (VNF) placement, which will provide computing services for satellite applications on-demand. In this paper, we study the VNF placement problem in a decentralized LEO satellite network due to the requirements for real-time processing and network resilience, where our aim is to jointly optimize end-toend service delay and network bandwidth cost in a dynamic environment. To this end, a decentralized LEO satellite network architecture is first implemented for resource management by establishing the neighboring sub-network for each satellite. Then we formulate the VNF placement problem as an integer non-linear programming problem with multiple constraints of network resources and service requirements. A neighbor-based VNF placement (N-VNFP) approach is proposed to address the optimization problem. Finally, we conduct the experiments to evaluate the performance of the proposed N-VNFP approach in a Walker constellation with 66 LEO satellites. The simulation results show that the proposed N-VNFP approach provides an effective solution for resource management in a decentralized LEO satellite network and also outperforms the two centralized baselines, i.e., Viterbi and Greedy, in terms of end-to-end service delay and network bandwidth cost

Network Service Orchestration: A Survey

Business models of network service providers are undergoing an evolving transformation fueled by vertical customer demands and technological advances such as 5G, Software Defined Networking~(SDN), and Network Function Virtualization~(NFV). Emerging scenarios call for agile network services consuming network, storage, and compute resources across heterogeneous infrastructures and administrative domains. Coordinating resource control and service creation across interconnected domains and diverse technologies becomes a grand challenge. Research and development efforts are being devoted to enabling orchestration processes to automate, coordinate, and manage the deployment and operation of network services. In this survey, we delve into the topic of Network Service Orchestration~(NSO) by reviewing the historical background, relevant research projects, enabling technologies, and standardization activities. We define key concepts and propose a taxonomy of NSO approaches and solutions to pave the way towards a common understanding of the various ongoing efforts around the realization of diverse NSO application scenarios. Based on the analysis of the state of affairs, we present a series of open challenges and research opportunities, altogether contributing to a timely and comprehensive survey on the vibrant and strategic topic of network service orchestration.Comment: Accepted for publication at Computer Communications Journa

Low-latency and Resource-efficient Service Function Chaining Orchestration in Network Function Virtualization

© 2014 IEEE. Recently, network function virtualization (NFV) has been proposed to solve the dilemma faced by traditional networks and to improve network performance through hardware and software decoupling. The deployment of the service function chain (SFC) is a key technology that affects the performance of virtual network function (VNF). The key issue in the deployment of SFCs is proposing effective algorithms to achieve efficient use of resources. In this article, we propose an SFC deployment optimization (SFCDO) algorithm based on a breadth-first search (BFS). The algorithm first uses a BFS-based algorithm to find the shortest path between the source node and the destination node. Then, based on the shortest path, the path with the fewest hops is preferentially chosen to implement the SFC deployment. Finally, we compare the performances with the greedy and simulated annealing (G-SA) algorithm. The experiment results show that the proposed algorithm is optimized in terms of end-to-end delay and bandwidth resource consumption. In addition, we also consider the load rate of the nodes to achieve network load balancing

Will SDN be part of 5G?

For many, this is no longer a valid question and the case is considered settled with SDN/NFV (Software Defined Networking/Network Function Virtualization) providing the inevitable innovation enablers solving many outstanding management issues regarding 5G. However, given the monumental task of softwarization of radio access network (RAN) while 5G is just around the corner and some companies have started unveiling their 5G equipment already, the concern is very realistic that we may only see some point solutions involving SDN technology instead of a fully SDN-enabled RAN. This survey paper identifies all important obstacles in the way and looks at the state of the art of the relevant solutions. This survey is different from the previous surveys on SDN-based RAN as it focuses on the salient problems and discusses solutions proposed within and outside SDN literature. Our main focus is on fronthaul, backward compatibility, supposedly disruptive nature of SDN deployment, business cases and monetization of SDN related upgrades, latency of general purpose processors (GPP), and additional security vulnerabilities, softwarization brings along to the RAN. We have also provided a summary of the architectural developments in SDN-based RAN landscape as not all work can be covered under the focused issues. This paper provides a comprehensive survey on the state of the art of SDN-based RAN and clearly points out the gaps in the technology.Comment: 33 pages, 10 figure

Dynamic resource allocation for virtual network function placement in satellite edge clouds

Satellite edge computing has become a promising way to provide computing services for Internet of Things (IoT) users in remote areas, which are out of the coverage of terrestrial networks. Nevertheless, it is not suitable for large-scale IoT users due to the resource limitation of satellites. Cloud computing can provide sufficient available resources for IoT users, but it does not meet delay-sensitive services as high network latency. Satellite edge clouds can facilitate flexible service provisioning for numerous IoT users by incorporating the advantages of edge computing and cloud computing. In this paper, we investigate the dynamic resource allocation problem for virtual network function (VNF) placement in satellite edge clouds. The aim is to minimize the network bandwidth cost and the service end-to-end delay jointly. We formulate the VNF placement problem as an integer non-linear programming problem and then propose a distributed VNF placement (D-VNFP) algorithm to address it. The experiments are conducted to evaluate the performance of the proposed D-VNFP algorithm, where Viterbi and Game theory are considered as the baseline algorithms. The results show that the proposed D-VNFP algorithm is effective and efficient for solving the VNF placement problem in satellite edge clouds