Low-Latency and Resource-Efficient Service Function Chaining Orchestration in Network Function Virtualization

Abstract

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 paper, we propose a service function chain 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.

A fast and scalable authentication scheme in IOT for smart living

“…Fueled by virtualization technologies encompassing service virtualization, network function virtualization [25], [26], and object virtualization, the VFOG enables the fog's realization as investigated in [24], underpinning the majority of beneficial features. This framework includes three layers, i.e., a service virtualization layer, a network function virtualization layer, and an object virtualization layer from top to bottom, along the cloud-to-things continuum.…”

A Survey of Multiobjective Evolutionary Algorithms Based on Decomposition: Variants, Challenges and Future Directions

“…Much attention has been focused on SFC deployments. Sun et al [108] designed a heuristic algorithm to realize low-latency and resourceefficient SFC orchestration. Similar to the idea of decomposition in MOEA/D, Sun et al [109] split a large flow into a number of subflows and each subflow was redirected to one of these ''parallelized'' sub-SFCs.…”

A Time-efficient Multi-Protocol Probe Scheme for Fine-grain IoT Device Identification

“…We implemented and deployed our experimental prototype system on a commercial desktop computer (64-bit Windows 10, i5-8500, 3.0Hz, 16GB memory) [27,28]. In order to reduce identification time for whole Ipv4 cyberspace, we crawl a part of Internet-connected IoT devices in Censys.…”