Time Efficient Virtual Network Embedding Algorithm. Issue 2 (2nd April 2016)

• Record Type: Journal Article
• Authors: Huang, Tao; Gu, Ying; Liu, Jiang; Liu, Yunjie
• Is Part Of: Intelligent automation & soft computing. Volume 22:Issue 2(2016)
• Page Start: 273
• Page End: 280
• Publication Date: 2016-04-02
• Subjects: Virtual network embedding -- link mapping -- deleting-first -- half deleting-first -- runtime; Artificial intelligence -- Periodicals; Intelligent control systems -- Periodicals; 003.5
• DOI: 10.1080/10798587.2015.1095477
• Languages: English
• ISSNs: 1079-8587

Abstract

Abstract: The virtual network embedding problem is an essential problem in network virtualization. Researchers care about efficiency of the virtual network embedding algorithm. This issue has two procedures: node embedding and link embedding. However, previous studies mainly concentrate on the node embedding while neglecting the link embedding, which is the main cause for the bad running time. In this paper, we propose a new algorithm—Deleting-first algorithm, which deletes incapable substrate links for the current virtual request before link mapping. The efficiency of virtual network embedding will be improved. The simulation results show that the average performance of the new algorithm is better at runtime.