Efficient And Robust Resource Allocation For Network Function Virtualization

DOWNLOAD

Download Efficient And Robust Resource Allocation For Network Function Virtualization PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Efficient And Robust Resource Allocation For Network Function Virtualization book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages. If the content not found or just blank you must refresh this page

Efficient And Robust Resource Allocation For Network Function Virtualization

DOWNLOAD
Author : Gamal Sallam
language : en
Publisher:
Release Date : 2020

Efficient And Robust Resource Allocation For Network Function Virtualization written by Gamal Sallam and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 2020 with categories.

With the advent of Network Function Virtualization (NFV), network services that traditionally run on proprietary dedicated hardware can now be realized using Virtual Network Functions (VNFs) that are hosted on general-purpose commodity hardware. This new network paradigm offers a great flexibility to Internet service providers (ISPs) for efficiently operating their networks (collecting network statistics, enforcing management policies, etc.). However, introducing NFV requires an investment to deploy VNFs at certain network nodes (called VNF-nodes), which has to account for practical constraints such as the deployment budget and the VNF-node limited resources. While gradually transitioning to NFV, ISPs face the problem of where to efficiently introduce NFV; here, we measure the efficiency by the amount of traffic that can be served in an NFV-enabled network. This problem is non-trivial as it is composed of two challenging subproblems: 1) placement of VNF-nodes; 2) allocation of the VNF-nodes' resources to network flows. These two subproblems must be jointly considered to satisfy the objective of serving the maximum amount of traffic. We first consider this problem for the one-dimensional setting, where all network flows require one network function, which requires a unit of resource to process a unit of flow. In contrast to most prior work that often neglects either the budget constraint or the resource allocation constraint, we explicitly consider both of them and prove that accounting for them introduces several new challenges. Specifically, we prove that the studied problem is not only NP-hard but also non-submodular. To address these challenges, we introduce a novel relaxation method such that the objective function of the relaxed placement subproblem becomes submodular. Leveraging this useful submodular property, we propose two algorithms that achieve an approximation ratio of $\frac{1}{2}(1-1/e)$ and $\frac{1}{3}(1-1/e)$ for the original non-relaxed problem, respectively. Next, we consider the multi-dimensional setting, where flows can require multiple network functions, which can also require a different amount of each resource to process a unit of flow. To address the new challenges arising from the multi-dimensional setting, we propose a novel two-level relaxation method that allows us to draw a connection to the sequence submodular theory and utilize the property of sequence submodularity along with the primal-dual technique to design two approximation algorithms. Finally, we perform extensive trace-driven simulations to show the effectiveness of the proposed algorithms. While the NFV paradigm offers great flexibility to network operators for efficient management of their networks, VNF instances are typically more prone to error and more vulnerable to security threats compared with dedicated hardware devices. Therefore, the NFV paradigm also poses new challenges concerning failure resilience. That has motivated us to consider robustness with respect to the class of sequence submodular function maximization problem, which has a wide range of applications, including those in the NFV domain. Submodularity is an important property of set functions and has been extensively studied in the literature. It models set functions that exhibit a diminishing returns property, where the marginal value of adding an element to a set decreases as the set expands. This notion has been generalized to considering sequence functions, where the order of adding elements plays a crucial role and determines the function value; the generalized notion is called sequence (or string) submodularity. In this part of the dissertation, we study a new problem of robust sequence submodular maximization with cardinality constraints. The robustness is against the removal of a subset of elements in the selected sequence (e.g., due to malfunctions or adversarial attacks). Compared to robust submodular maximization for set function, new challenges arise when sequence functions are concerned. Specifically, there are multiple definitions of submodularity for sequence functions, which exhibit subtle yet critical differences. Another challenge comes from two directions of monotonicity: forward monotonicity and backward monotonicity, both of which are important to proving performance guarantees. To address these unique challenges, we design two robust greedy algorithms: while one algorithm achieves a constant approximation ratio but is robust only against the removal of a subset of contiguous elements, the other is robust against the removal of an arbitrary subset of the selected elements but requires a stronger assumption and achieves an approximation ratio that depends on the number of the removed elements. Finally, we consider important problems that arise in the production networks, where packets need to pass through an ordered set of network functions called Service Function Chains (SFC) before reaching the destination. We study the following problems: (1) How to find an SFC-constrained shortest path between any pair of nodes? (2) What is the achievable SFC-constrained maximum flow? We propose a transformation of the network graph to minimize the computational complexity of subsequent applications of any shortest path algorithm. Moreover, we formulate the SFC-constrained maximum flow problem as a fractional multicommodity flow problem and develop a combinatorial algorithm for a special case of practical interest.

Resource Allocation In Network Function Virtualization

DOWNLOAD
Author : Song Yang
language : en
Publisher: Springer Nature
Release Date : 2022-08-29

Resource Allocation In Network Function Virtualization written by Song Yang and has been published by Springer Nature this book supported file pdf, txt, epub, kindle and other format this book has been release on 2022-08-29 with Technology & Engineering categories.

Network Function Virtualization (NFV) has recently attracted considerable attention from both research and industrial communities. Numerous papers have been published regarding solving the resource- allocation problems in NFV, from various perspectives, considering different constraints, and adopting a range of techniques. However, it is difficult to get a clear impression of how to understand and classify different kinds of resource allocation problems in NFV and how to design solutions to solve these problems efficiently. This book addresses these concerns by offering a comprehensive overview and explanation of different resource allocation problems in NFV and presenting efficient solutions to solve them. It covers resource allocation problems in NFV, including an introduction to NFV and QoS parameters modelling as well as related problem definition, formulation and the respective state-of-the-art algorithms. This book allows readers to gain a comprehensive understanding of and deep insights into the resource allocation problems in NFV. It does so by exploring (1) the working principle and architecture of NFV, (2) how to model the Quality of Service (QoS) parameters in NFV services, (3) definition, formulation and analysis of different kinds of resource allocation problems in various NFV scenarios, (4) solutions for solving the resource allocation problem in NFV, and (5) possible future work in the respective area.

Traffic And Resource Management In Robust Cloud Data Center Networks

DOWNLOAD
Author : Sara Ayoubi
language : en
Publisher:
Release Date : 2016

Traffic And Resource Management In Robust Cloud Data Center Networks written by Sara Ayoubi and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 2016 with categories.

Cloud Computing is becoming the mainstream paradigm, as organizations, both large and small, begin to harness its benefits. Cloud computing gained its success for giving IT exactly what it needed: The ability to grow and shrink computing resources, on the go, in a cost-effective manner, without the anguish of infrastructure design and setup. The ability to adapt computing demands to market fluctuations is just one of the many benefits that cloud computing has to offer, this is why this new paradigm is rising rapidly. According to a Gartner report, the total sales of the various cloud services will be worth 204 billion dollars worldwide in 2016. With this massive growth, the performance of the underlying infrastructure is crucial to its success and sustainability. Currently, cloud computing heavily depends on data centers for its daily business needs. In fact, it is through the virtualization of data centers that the concept of "computing as a utility" emerged. However, data center virtualization is still in its infancy; and there exists a plethora of open research issues and challenges related to data center virtualization, including but not limited to, optimized topologies and protocols, embedding design methods and online algorithms, resource provisioning and allocation, data center energy efficiency, fault tolerance issues and fault tolerant design, improving service availability under failure conditions, enabling network programmability, etc.This dissertation will attempt to elaborate and address key research challenges and problems related to the design and operation of efficient virtualized data centers and data center infrastructure for cloud services. In particular, we investigate the problem of scalable traffic management and traffic engineering methods in data center networks and present a decomposition method to exactly solve the problem with considerable runtime improvement over mathematical-based formulations. To maximize the network's admissibility and increase its revenue, cloud providers must make efficient use of their's network resources. This goal is highly correlated with the employed resource allocation/placement schemes; formally known as the virtual network embedding problem. This thesis looks at multi-facets of this latter problem; in particular, we study the embedding problem for services with one-to-many communication mode; or what we denote as the multicast virtual network embedding problem. Then, we tackle the survivable virtual network embedding problem by proposing a fault-tolerance design that provides guaranteed service continuity in the event of server failure. Furthermore, we consider the embedding problem for elastic services in the event of heterogeneous node failures. Finally, in the effort to enable and support data center network programmability, we study the placement problem of softwarized network functions (e.g., load balancers, firewalls, etc.), formally known as the virtual network function assignment problem. Owing to its combinatorial complexity, we propose a novel decomposition method, and we numerically show that it is hundred times faster than mathematical formulations from recent existing literature.

Dynamic Resource Coordination Towards Reliable And Flexible Network Slicing

DOWNLOAD
Author : Genya Ishigaki
language : en
Publisher:
Release Date : 2021

Dynamic Resource Coordination Towards Reliable And Flexible Network Slicing written by Genya Ishigaki and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 2021 with Computer networks categories.

The increasing demand for a diverse array of network applications entails a more flexible and reliable networking paradigm. Network slicing is envisioned to package a set of networking, computing, and storage resources in a coordinated manner, so that the network slice with the tailored set of resources satisfies service requirements unique to each network application. A key enabling technology of network slicing is network softwarization, exemplified by Software Defined Networking (SDN) and Network Function Virtualization (NFV), which enable swift migration of both networking and computing resources. While network slicing sets a conceptual foundation for next-generation networking for diverse applications, the resource coordination mechanism that dynamically operates and manages the resources remains a challenging issue. This is more so when considering the computational complexity induced by the dependency relationship among the softwarized resources and the uncertainty of future network states, such as network failure scenarios and traffic patterns. This dissertation features four resource allocation problems that collectively facilitate the agile operation and management of end-to-end network slices. The first two problems are related to the reliability aspect of network slicing. In particular, we discuss protection and recovery problems of interdependent network components from a resource allocation standpoint. The third problem deals with a dynamic bandwidth allocation in optical access networks. The dynamic adjustment of allocated bandwidth assists more effective resource utilization and the accommodation of different types of network services. Furthermore, SDN controller placement, which determines responsiveness to a request for end-to-end resource coordination, is examined as the fourth problem. The theoretical analysis and proposed algorithms for the problems not only solve the specific resource allocation tasks, but also provide fundamental insights to tackle similar allocation problems under entangled dependency and future uncertainty. In particular, the proposed learning-based approaches project an automated resource coordination system for more effective utilization of network resources in 5G and beyond networks.

Dynamic Resource Management In Service Oriented Core Networks

DOWNLOAD
Author : Weihua Zhuang
language : en
Publisher: Springer Nature
Release Date : 2021-11-03

Dynamic Resource Management In Service Oriented Core Networks written by Weihua Zhuang and has been published by Springer Nature this book supported file pdf, txt, epub, kindle and other format this book has been release on 2021-11-03 with Computers categories.

This book provides a timely and comprehensive study of dynamic resource management for network slicing in service-oriented fifth-generation (5G) and beyond core networks. This includes the perspective of developing efficient computation resource provisioning and scheduling solutions to guarantee consistent service performance in terms of end-to-end (E2E) data delivery delay. Network slicing is enabled by the software defined networking (SDN) and network function virtualization (NFV) paradigms. For a network slice with a target traffic load, the E2E service delivery is enabled by virtual network function (VNF) placement and traffic routing with static resource allocations. When data traffic enters the network, the traffic load is dynamic and can deviate from the target value, potentially leading to QoS performance degradation and network congestion. Data traffic has dynamics in different time granularities. For example, the traffic statistics (e.g., mean and variance) can be non-stationary and experience significant changes in a coarse time granularity, which are usually predictable. Within a long time duration with stationary traffic statistics, there are traffic dynamics in small timescales, which are usually highly bursty and unpredictable. To provide continuous QoS performance guarantee and ensure efficient and fair operation of the network slices over time, it is essential to develop dynamic resource management schemes for the embedded services in the presence of traffic dynamics during virtual network operation. Queueing theory is used in system modeling, and different techniques including optimization and machine learning are applied to solving the dynamic resource management problems. Based on a simplified M/M/1 queueing model with Poisson traffic arrivals, an optimization model for flow migration is presented to accommodate the large-timescale changes in the average traffic rates with average E2E delay guarantee, while addressing a trade-off between load balancing and flow migration overhead. To overcome the limitations of Poisson traffic model, the authors present a machine learning approach for dynamic VNF resource scaling and migration. The new solution captures the inherent traffic patterns in a real-world traffic trace with non-stationary traffic statistics in large timescale, predicts resource demands for VNF resource scaling, and triggers adaptive VNF migration decision making, to achieve load balancing, migration cost reduction, and resource overloading penalty suppression in the long run. Both supervised and unsupervised machine learning tools are investigated for dynamic resource management. To accommodate the traffic dynamics in small time granularities, the authors present a dynamic VNF scheduling scheme to coordinate the scheduling among VNFs of multiple services, which achieves network utility maximization with delay guarantee for each service. Researchers and graduate students working in the areas of electrical engineering, computing engineering and computer science will find this book useful as a reference or secondary text. Professionals in industry seeking solutions to dynamic resource management for 5G and beyond networks will also want to purchase this book.

Resource Management For Efficient Scalable And Resilient Network Function Chains

DOWNLOAD
Author : Sameer G. Kulkarni
language : en
Publisher:
Release Date : 2018

Resource Management For Efficient Scalable And Resilient Network Function Chains written by Sameer G. Kulkarni and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 2018 with categories.

Networks, the basis of the modern connected world, have evolved beyond the con- nectivity services. Network Functions (NFs) or traditionally the middleboxes are the basis of realizing different types of services such as security, optimization func- tions, and value added services. Typically, multiple NFs are chained together (also known as Service Function Chaining) to realize distinct network services, which are pivotal in providing the policy enforcement and performance in networks. Network Function Virtualization (NFV) is becoming more prevalent and enabling the soft- warized NFs to fast...

Compare

DOWNLOAD
Author : Bernardo A. Huberman
language : en
Publisher:
Release Date : 2016

Compare written by Bernardo A. Huberman and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 2016 with categories.

As Communication Service Providers (CSPs) adopt the Network Function Virtualization (NFV) paradigm they need to transition their network function capacity to a virtualized infrastructure with different Network Functions running on a set of heterogeneous servers. This abstract describes a novel technique for allocating server resources (compute, storage and network) for a given set of Virtual Network Function (VNF) requirements. Our approach helps the telco providers decide the most effective way to run several VNFs on servers with different performance characteristics. Our analysis of prior VNF performance characterization on heterogeneous/different server resource allocations shows that the ability to arbitrarily create many VNFs among different servers' resource allocations leads to a comparative advantage among servers. We propose a VNF resource allocation method called COMPARE that maximizes the total throughput of the system by formulating this resource allocation problem as a comparative advantage problem among heterogeneous servers. There several applications for using the VNF resource allocation from COMPARE including transitioning current Telco deployments to NFV based solutions and providing initial VNF placement for Service Function Chain (SFC) provisioning.

Intelligent Sustainable Systems

DOWNLOAD
Author : Atulya K. Nagar
language : en
Publisher: Springer Nature
Release Date : 2023-01-24

Intelligent Sustainable Systems written by Atulya K. Nagar and has been published by Springer Nature this book supported file pdf, txt, epub, kindle and other format this book has been release on 2023-01-24 with Technology & Engineering categories.

This book provides insights of World Conference on Smart Trends in Systems, Security and Sustainability (WS4 2022) which is divided into different sections such as Smart IT Infrastructure for Sustainable Society; Smart Management Prospective for Sustainable Society; Smart Secure Systems for Next Generation Technologies; Smart Trends for Computational Graphics and Image Modeling; and Smart Trends for Biomedical and Health Informatics. The proceedings is presented in two volumes. The book is helpful for active researchers and practitioners in the field.

Internet Of Things And Connected Technologies

DOWNLOAD
Author : Rajiv Misra
language : en
Publisher: Springer Nature
Release Date : 2021-05-29

Internet Of Things And Connected Technologies written by Rajiv Misra and has been published by Springer Nature this book supported file pdf, txt, epub, kindle and other format this book has been release on 2021-05-29 with Technology & Engineering categories.

This book presents the recent research adoption of a variety of enabling wireless communication technologies like RFID tags, BLE, ZigBee, etc., and embedded sensor and actuator nodes, and various protocols like CoAP, MQTT, DNS, etc., that has made Internet of things (IoT) to step out of its infancy to become smart things. Now, smart sensors can collaborate directly with the machine without human involvement to automate decision making or to control a task. Smart technologies including green electronics, green radios, fuzzy neural approaches, and intelligent signal processing techniques play important roles in the developments of the wearable healthcare systems. In the proceedings of 5th International Conference on Internet of Things and Connected Technologies (ICIoTCT), 2020, brought out research works on the advances in the Internet of things (IoT) and connected technologies (various protocols, standards, etc.). This conference aimed at providing a forum to discuss the recent advances in enabling technologies and applications for IoT.

Resource Management In Distributed Systems

DOWNLOAD
Author : Anwesha Mukherjee
language : en
Publisher: Springer Nature
Release Date :

Resource Management In Distributed Systems written by Anwesha Mukherjee and has been published by Springer Nature this book supported file pdf, txt, epub, kindle and other format this book has been release on with categories.