PLAN: A Policy-Aware VM Management Scheme for Cloud Data Centres

被引:7
作者
Cui, Lin [1 ]
Tso, Fung Po [2 ]
Pezaros, Dimitrios P. [3 ]
Jia, Weijia [4 ]
机构
[1] Jinan Univ, Dept Comp Sci, Guangzhou, Guangdong, Peoples R China
[2] Liverpool John Moores Univ, Sch Comp & Math Sci, Liverpool L3 3AF, Merseyside, England
[3] Univ Glasgow, Sch Comp Sci, Glasgow G12 8QQ, Lanark, Scotland
[4] Shanghai Jiao Tong Univ, Dept Comp Sci & Engn, Shanghai, Peoples R China
来源
2015 IEEE/ACM 8TH INTERNATIONAL CONFERENCE ON UTILITY AND CLOUD COMPUTING (UCC) | 2015年
关键词
Data center networks; virtual machine; migration; policies; middleboxes;
D O I
10.1109/UCC.2015.30
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Policies play an important role in network configuration and therefore in offering secure and high performance services especially over multi-tenant Cloud Data Center (DC) environments. At the same time, elastic resource provisioning through virtualization often disregards policy requirements, assuming that the policy implementation is handled by the underlying network infrastructure. This can result in policy violations, performance degradation and security vulnerabilities. In this paper, we define PLAN, a PoLicy-Aware and Network-aware VM management scheme to jointly consider DC communication cost reduction through Virtual Machine (VM) migration while meeting network policy requirements. We show that the problem is NP-hard and derive an efficient approximate algorithm to reduce communication cost while adhering to policy constraints. Through extensive evaluation, we show that PLAN can reduce topology-wide communication cost by 38% over diverse aggregate traffic and configuration policies.
引用
收藏
页码:142 / 151
页数:10
相关论文
共 26 条
[1]  
Aibo Song, 2013, Pervasive Computing and the Networked World. Joint International Conference, ICPCA/SWS 2012. Revised Selected Papers, P426, DOI 10.1007/978-3-642-37015-1_37
[2]   A scalable, commodity data center network architecture [J].
Al-Fares, Mohammad ;
Loukissas, Alexander ;
Vahdat, Amin .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2008, 38 (04) :63-74
[3]  
[Anonymous], DAT CTR LOAD BAL DAT
[4]  
[Anonymous], MATHWARE SOFT COMPUT
[5]   A SURVEY OF ALGORITHMS FOR THE GENERALIZED ASSIGNMENT PROBLEM [J].
CATTRYSSE, DG ;
VANWASSENHOVE, LN .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1992, 60 (03) :260-272
[6]  
Clark C, 2005, USENIX ASSOCIATION PROCEEDINGS OF THE 2ND SYMPOSIUM ON NETWORKED SYSTEMS DESIGN & IMPLEMENTATION (NSDI '05), P273
[7]   An efficient approximation for the Generalized Assignment Problem [J].
Cohen, Reuven ;
Katzir, Liran ;
Raz, Danny .
INFORMATION PROCESSING LETTERS, 2006, 100 (04) :162-166
[8]  
Cui L., 2015, IEEE INT C DISTR COM
[9]  
Fayazbakhsh S. K., 2014, OP NETW SUMM, V2014
[10]  
Fayazbakhsh S.K., 2014, NSDI