DocumentCode
1969090
Title
Efficient algorithms for survivable virtual network embedding
Author
Sun, Gang ; Yu, Hongfang ; Li, Lemin ; Anand, Vishal ; Di, Hao ; Gao, Xiujiao
Author_Institution
Sch. of Commun. & Inf. Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu, China
fYear
2010
fDate
8-12 Dec. 2010
Firstpage
531
Lastpage
532
Abstract
In this work we propose two decomposition algorithms LR-SVNE and D-SVNE for solving the SVNE problem efficiently. We focus on the design of survivable VN embedding with resource constraints. The VN embedding problem with resource constraints is NP-hard, hence most work focuses on devising heuristic solutions. Simulation results show that our algorithms perform well in terms of both time complexity and embedding cost.
Keywords
computational complexity; computer networks; optimisation; D-SVNE; LR-SVNE; NP-hard problem; decomposition algorithm; resource constraint; survivable VN embedding; survivable virtual network embedding problem; Algorithm design and analysis; Computational complexity; Grid computing; Manganese; Simulation; Substrates;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications and Photonics Conference and Exhibition (ACP), 2010 Asia
Conference_Location
Shanghai
Print_ISBN
978-1-4244-7111-9
Type
conf
DOI
10.1109/ACP.2010.5682613
Filename
5682613
Link To Document