MatchVNE: A Stable Virtual Network Embedding Strategy Based on Matching Theory
Published:
Authors
Keerthan Kumar. T G, Ankit Srivastava, Anurag Satpathy, Sourav Kanti Addya, and Shashidhar. G Koolagudi
Conference
2023 International Conference on COMmunication Systems & NETworkS (COMSNETS) (Core Rank - National India)
Abstract
Network virtualization (NV) can provide greater flexibility, better control, and improved quality of service (QoS) for the existing Internet architecture by enabling heterogeneous virtual network requests (VNRs) to share the substrate network (SN) resources. The efficient assignment of the SN resources catering to the demands of virtual machines (VMs) and virtual links (VLs) of the VNRs is known as virtual network embedding (VNE) and is proven to be NP-Hard. Deviating from the literature, this paper proposes a framework MatchVNE that is focused on maximizing the revenue-to-cost ratio of VNRs by considering a blend of system and topological attributes that better capture the inherent dependencies among the VMs. MatchVNE performs a stable VM embedding using the deferred acceptance algorithm (DAA). The preference of the VMs and servers are generated using a hybrid entropy, and the technique for order of preference by similarity to ideal solution (TOPSIS) based ranking strategy for VMs and servers. The attribute weights are determined using entropy, whereas the server and VM ranking are obtained via TOPSIS. The shortest path, VL-embedding, follows VM-embedding. The simulation results show that MatchVNE outperforms the baselines by achieving a 23% boost in the average revenue-to-cost-ratio and 44% improvement in the average acceptance ratio.