Abstract
Network virtualization is considered as a key technology for the future network. The emergence of software-defined network (SDN) provides a platform for the research and development of network virtualization. One of the key challenges in network virtualization is virtual network embedding (VNE). Some of the previous VNE algorithms perform virtual node embedding, which combines the nodes’ resource attributes and local topology attributes by arithmetic operations. On the one hand, it is not easy to distinguish the topological differences between SN and VN only by simple topology metrics. On the other hand, it is easy to ignore the different weight impacts of different metrics using only arithmetic operations, which will lead to an unbalanced embedding solution. To deal with these issues, we propose a novel node-ranking approach based on topology-differentiating (VNE-NRTD) for SDN-based virtual network embedding. Owing to the topological difference between SN and VN, different node metrics are used to quantify the substrate nodes and virtual nodes, respectively. Then, the nodes are ranked using the modified set pair analysis (SPA) method to avoid the unbalanced embedding solution. On this basis, we introduce the global bandwidth of the network topology into node-ranking to further improve the efficiency of node embedding. The simulation results show that the VNE-NRTD algorithm proposed in this paper outperforms other latest heuristic algorithms in terms of the VNR acceptance ratio, long-term average R/C ratio, substrate node utilization, and substrate link utilization.
Highlights
Over the past decades, Internet has achieved great success
The main contributions of this paper are summarized as follows: (i) To describe the VNE problem more clearly, this paper studies the virtual network embedding model based on software-defined network (SDN). e mixed-integer linear programming (MILP) model is established for the SDN-based virtual network embedding problem, and the flow rule capacity constraint is added in the node embedding process
E remainder of this paper is organized as follows: Section 2 briefly reviews the related work of VNE; the VNE model based on SDN is discussed in Section 3; in Section 4, we present the MILP model for VNE, and the heuristic VNENRTD algorithm is detailed in Section 5; extensive simulation work is implemented in Section 6; and Section 7 concludes this paper
Summary
Internet has achieved great success. the ossification of Internet is getting worse with the rapid growth of end-users and various applications. (i) To describe the VNE problem more clearly, this paper studies the virtual network embedding model based on SDN. Different from the previous node-ranking methods that ignore the weight difference between different metrics, an appropriate weight is assigned to each metric and the node importance is calculated based on the modified SPA method On this basis, the global bandwidth of the network topology is introduced into the node-ranking process to further improve the efficiency of node embedding. Simulation results vividly demonstrated that the proposed VNE-NRTD algorithm has obvious improvements compared with the selected algorithm in terms of the VNR acceptance ratio, long-term average R/C ratio, and substrate node utilization under different network environments, while reducing the substrate link utilization. E remainder of this paper is organized as follows: Section 2 briefly reviews the related work of VNE; the VNE model based on SDN is discussed in Section 3; in Section 4, we present the MILP model for VNE, and the heuristic VNENRTD algorithm is detailed in Section 5; extensive simulation work is implemented in Section 6; and Section 7 concludes this paper
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
