DocumentCode
2938711
Title
Defragmentation of Resources in Virtual Desktop Clouds for Cost-Aware Utility-Optimal Allocation
Author
Sridharan, M. ; Calyam, Prasad ; Venkataraman, Aishwarya ; Berryman, Alex
Author_Institution
Ohio Supercomput. Center/OARnet, Ohio State Univ., Columbus, OH, USA
fYear
2011
fDate
5-8 Dec. 2011
Firstpage
253
Lastpage
260
Abstract
Cloud Service Providers (CSPs) make virtual desktop cloud (VDC) resource provisioning decisions within desktop pools based on user groups and their application profiles. Such provisioning is aimed to satisfy acceptable user quality of experience (QoE) levels and is coupled with subsequent placement of VDs across distributed data centers. The placement decisions are influenced by session latency, load balancing and operation cost constraints. In this paper, we identify the resource fragmentation problem that occurs when placement is done opportunistically to minimize provisioning time and deliver satisfactory user QoE. To solve this problem, which inherently is an NP-Hard problem, we propose a defragmentation scheme that has fast convergence time and has three levels of complexity: (i) "utility fair provisioning" (UFP) to optimize resource provisioning within a data center - to achieve relative fairness between desktop pools, (ii) "static migration-free utility optimal placement and provisioning" (MUPP) to optimize resource provisioning between multiple data centers - to improve performance, and (iii) "dynamic global utility optimal placement and provisioning" (GUPP) to optimize resource provisioning using cost-aware and utility-maximal VD re-allocations and migrations - to increase scalability. We evaluate our defragmentation scheme against \´least latency\´, \´least load\´, and \´least cost\´ schemes using a novel "VDC-Sim" simulator that we have developed in this study. Our simulations leverage profiles of user groups and their applications within desktop pools, obtained from a real VDC test bed. Our simulation results demonstrate that defragmentation is an important optimization step that can enable CSPs to achieve fairness, substantially improve user QoE and increase VDC scalability.
Keywords
cloud computing; computational complexity; computer centres; costing; distributed processing; optimisation; resource allocation; utility programs; NP-hard problem; VDC scalability; cloud service provider; cost-aware utility-optimal allocation; desktop pools; distributed data centers; dynamic global utility optimal placement; least cost scheme; least latency scheme; least load scheme; load balancing; operation cost constraint; placement decision; real VDC testbed; resource defragmentation scheme; resource fragmentation problem; resource provisioning decision; resource provisioning optimization; satisfactory user QoE; user quality of experience; utility fair provisioning; utility-maximal VD reallocation; virtual desktop clouds; Complexity theory; Convergence; Heuristic algorithms; Measurement; Optimization; Resource management; Scalability; Greedy Heuristic; Optimal Resource Allocation; Resource Defragmentation; Virtual Desktop Clouds;
fLanguage
English
Publisher
ieee
Conference_Titel
Utility and Cloud Computing (UCC), 2011 Fourth IEEE International Conference on
Conference_Location
Victoria, NSW
Print_ISBN
978-1-4577-2116-8
Type
conf
DOI
10.1109/UCC.2011.41
Filename
6123505
Link To Document