TY - GEN
T1 - Towards min-cost virtual infrastructure embedding
AU - Yu, Ruozhou
AU - Xue, Guoliang
AU - Zhang, Xiang
N1 - Funding Information:
This research was supported in part by NSF grants 1421685, 1457262 and 1461886.
Publisher Copyright:
© 2015 IEEE.
PY - 2015
Y1 - 2015
N2 - Cloud computing has emerged as a prevailing platform for internet service hosting. To best utilize Cloud resources for profit making, Cloud providers rely on intelligent resource allocation algorithms when provisioning the virtualized environments for tenant service hosting. Conventional resource allocation proposals mainly focus on efficient allocation of the computing and storage resources, with little effort on ensuring the network performance of tenant services. To address this issue, a number of recent efforts abstract tenant services in the form of virtual infrastructures for resource allocation. A virtual infrastructure specifies the tenant's demand of both the computing resources for hosting virtual servers, and the network bandwidth for inter-virtual server communications. With the problem of resource allocation for virtual infrastructures being NP-hard in general networks, heuristic algorithms have been proposed for this problem. In this paper, we propose a novel optimization technique, named sequential rounding, to tackle the resource allocation problem for virtual infrastructures. The proposed technique extends the rounding technique used for the traditional virtual network embedding problem, while minimizing mapping conflicts introduced by the virtual infrastructure embed- ding problem. Experiments show that our proposed algorithm outperforms existing algorithms regarding both the acceptance ratio and average embedding cost of virtual requests.
AB - Cloud computing has emerged as a prevailing platform for internet service hosting. To best utilize Cloud resources for profit making, Cloud providers rely on intelligent resource allocation algorithms when provisioning the virtualized environments for tenant service hosting. Conventional resource allocation proposals mainly focus on efficient allocation of the computing and storage resources, with little effort on ensuring the network performance of tenant services. To address this issue, a number of recent efforts abstract tenant services in the form of virtual infrastructures for resource allocation. A virtual infrastructure specifies the tenant's demand of both the computing resources for hosting virtual servers, and the network bandwidth for inter-virtual server communications. With the problem of resource allocation for virtual infrastructures being NP-hard in general networks, heuristic algorithms have been proposed for this problem. In this paper, we propose a novel optimization technique, named sequential rounding, to tackle the resource allocation problem for virtual infrastructures. The proposed technique extends the rounding technique used for the traditional virtual network embedding problem, while minimizing mapping conflicts introduced by the virtual infrastructure embed- ding problem. Experiments show that our proposed algorithm outperforms existing algorithms regarding both the acceptance ratio and average embedding cost of virtual requests.
KW - Cloud resource allocation
KW - Data center virtualization
KW - Virtual infrastructure embedding
UR - http://www.scopus.com/inward/record.url?scp=84964900497&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84964900497&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2014.7416953
DO - 10.1109/GLOCOM.2014.7416953
M3 - Conference contribution
AN - SCOPUS:84964900497
T3 - 2015 IEEE Global Communications Conference, GLOBECOM 2015
BT - 2015 IEEE Global Communications Conference, GLOBECOM 2015
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 58th IEEE Global Communications Conference, GLOBECOM 2015
Y2 - 6 December 2015 through 10 December 2015
ER -