NFV Provisioning in Large-Scale Distributed Networks With Minimum Delay

Abstract

Network function virtualization (NFV) and software-defined networking (SDN) are two technologies that have emerged to reduce capital and operational costs, and to simplify network management. In this paper, we propose an SDN-based system that provisions virtual network functions (VNFs) to minimize round trip time (RTT) delay and synchronization delay requirements. Our system uses graphic-theoretic approaches to place newly requested VNFs including four centrality functions - betweenness, degree, closeness, and Katz. The system performance is evaluated using two random graph topologies representing the physical and logical structures. The impact of increasing the number of deployed VNFs is considered. The results indicate that the degree and Katz selection methods mostly provide the minimum RTT for physical networks, whereas the betweenness selection provides minimum RTT values for logical networks. Moreover, the closeness selection method provides the best synchronization delay for both logical and physical networks.

Keywords

• Software-defined networking
• network function virtualization
• VNF placement
• network performance
• clustering
• k-means%22%2C%22default_operator%22%3A%22AND%22%7D%7D%7D"> <italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">k</italic>-means