Framework for Efficient Auto-Scaling of Virtual Network Functions in a Cloud Environment

Network Function Virtualization (NFV) offers an alternate method to design, deploy and manage network services. The NFV decouples network functions from the dedicated hardware and moves them to the virtual servers so that they can run in the software. One of the major strengths of the NFV is its ability to dynamically extend or reduce resources allocated to Virtual Network Functions (VNF) as needed and at run-time. There is a need for a comprehensive metering component in the cloud to store and process the metrics/samples for efficient auto-scaling or load-management of the VNF. In this paper, we propose an integrating framework for efficient auto-scaling of VNF using Gnocchi; a time-series database that is integrated within the framework to store, handle and index the time-series data. The objective of this study is to validate the efficacy of employing Gnocchi for auto-scaling of VNF, in terms of aggregated data points, database size, data recovery speed, and memory consumption. The employed methodology is to perform a detailed empirical analysis of the proposed framework by deploying a fully functional cloud to implement NFV architecture using several OpenStack components including Gnocchi. Our results show a significant improvement over the legacy Ceilometer configuration in terms of lower metering storage size, less memory utilization in processing and management of metrics, and reduced time delay in retrieving the monitoring data to evaluate alarms for the auto-scaling of VNF.

Survivability-Enhanced Virtual Network Embedding Strategy in Virtualized Wireless Sensor Networks

With the widespread application of wireless sensor networks (WSNs), WSN virtualization technology has received extensive attention. A key challenge in WSN virtualization is the survivable virtual network embedding (SVNE) problem which efficiently maps a virtual network on a WSN accounting for possible substrate failures. Aiming at the lack of survivability research towards physical sensor node failure in the virtualized sensor network, the SVNE problem is mathematically modeled as a mixed integer programming problem considering resource constraints. A heuristic algorithm-node reliability-aware backup survivable embedding algorithm (NCS)-is further put forward to solve this problem. Firstly, a node reliability-aware embedding method is presented for initial embedding. The resource reliability of underlying physical sensor nodes is evaluated and the nodes with higher reliability are selected as mapping nodes. Secondly, a fault recovery mechanism based on resource reservation is proposed. The critical virtual sensor nodes are recognized and their embedded physical sensor nodes are further backed up. When the virtual sensor network (VSN) fails caused by the failure physical node, the operation of the VSN is restored by backup switching. Finally, the experimental results show that the strategy put forward in this paper can effectively guarantee the survivability of the VSN, reduce the failure penalty caused by the physical sensor nodes failure, and improve the long-term operating income of infrastructure provider.

A Novel Weighted Clustering Algorithm Supported by a Distributed Architecture for D2D Enabled Content-Centric Networks

Next generation cellular systems need efficient content-distribution schemes. Content-sharing via Device-to-Device (D2D) clustered networks has emerged as a popular approach for alleviating the burden on the cellular network. In this article, we utilize Content-Centric Networking and Network Virtualization to propose a distributed architecture, that supports efficient content delivery. We propose to use clustering at the user level for content-distribution. A weighted multifactor clustering algorithm is proposed for grouping the D2D User Equipment (DUEs) sharing a common interest. The proposed algorithm is evaluated in terms of energy efficiency, area spectral efficiency, and throughput. The effect of the number of clusters on these performance parameters is also discussed. The proposed algorithm has been further modified to allow for a tradeoff between fairness and other performance parameters. A comprehensive simulation study demonstrates that the proposed clustering algorithm is more flexible and outperforms several classical and state-of-the-art algorithms.

Virtual Network Embedding Based on Topology Potential

To improve the low acceptance ratio and revenue to cost ratio caused by the poor match between the virtual nodes and the physical nodes in the existing virtual network embedding (VNE) algorithms, we established a multi-objective optimization integer linear programming model for the VNE problem, and proposed a novel two-stage virtual network embedding algorithm based on topology potential (VNE-TP). In the node embedding stage, the field theory once used for data clustering was introduced and a node embedding function designed to find the optimal physical node. In the link embedding stage, both the available bandwidth and hops of the candidate paths were considered, and a path embedding function designed to find the optimal path. Extensive simulation results show that the proposed algorithm outperforms other existing algorithms in terms of acceptance ratio and revenue to cost ratio.