A new virtual network static embedding strategy within the Cloud's private backbone network

被引:15
作者
Fajjari, Ilhem [1 ]
Aitsaadi, Nadjib [2 ]
Pioro, Michal [3 ,4 ]
Pujolle, Guy [1 ]
机构
[1] Univ Paris 06, LIP6, F-75005 Paris, France
[2] Univ Paris EST Creteil UPEC, LISSI, F-94400 Vitry Sur Seine, France
[3] Warsaw Univ Technol, Inst Telecommun, PL-00665 Warsaw, Poland
[4] Lund Univ, Dept Elect & Informat Technol, S-522100 Lund, Sweden
关键词
Networking Cloud computing; Service provisioning; Network virtualization; Embedding problem; Optimisation; Ant colony metaheuristic; ANT COLONY OPTIMIZATION;
D O I
10.1016/j.comnet.2014.01.004
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Cloud computing is a promising paradigm which has emerged to overcome the main issues of the computational world. It acts as a torchbearer technology for realising a new computing model in which resources can be acquired and released on demand. However, a fundamental issue in the instantiation of resources is how to afford optimal allocation so that the service provider fulfils the users' service level agreement while minimising its operational cost and maximising its revenue. In this paper, we tackle the problem of networking static service provisioning within the Cloud's private backbone network. This requires the embedding of virtual networks in which edge routers are directly connected to data centres. Our objective is to map online virtual networks in the private substrate backbone network using the minimum physical resources but while still satisfying the required QoS in terms of bandwidth, processing power and memory. This in turn minimises the reject rate of requests and maximises returns for the substrate network provider. Since the virtual network embedding problem is NP-hard, we propound a new scalable embedding strategy named VNE-AC to deal with its computational hardness. This is based on the Ant Colony metaheuristic. Extensive simulations are used to evaluate the performances of our proposal. These show that VNE-AC minimises the reject rate of virtual networks and enhances the cloud provider's revenue. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码:69 / 88
页数:20
相关论文
共 39 条
[1]  
Andersen D. G., 2002, THEORETICAL APPROACH
[2]  
[Anonymous], DEF CLOUD COMP V15
[3]  
[Anonymous], 2006, Efficient mapping of virtual networks onto a shared substrate
[4]  
[Anonymous], P 13 INT ICDCN
[5]  
[Anonymous], 2008, P 2008 GRID COMP ENV, DOI DOI 10.1109/GCE.2008.4738443
[6]  
Armbrust M., EECS200928
[7]   A View of Cloud Computing [J].
Armbrust, Michael ;
Fox, Armando ;
Griffith, Rean ;
Joseph, Anthony D. ;
Katz, Randy ;
Konwinski, Andy ;
Lee, Gunho ;
Patterson, David ;
Rabkin, Ariel ;
Stoica, Ion ;
Zaharia, Matei .
COMMUNICATIONS OF THE ACM, 2010, 53 (04) :50-58
[8]  
Bansal N, 2011, PODC 11: PROCEEDINGS OF THE 2011 ACM SYMPOSIUM PRINCIPLES OF DISTRIBUTED COMPUTING, P267
[9]   Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems [J].
Barnhart, C ;
Hane, CA ;
Vance, PH .
OPERATIONS RESEARCH, 2000, 48 (02) :318-326
[10]  
Brunner M., 2004, IEEE T NETW SERV MAN, P92