TY - GEN
T1 - Cost-Efficient Virtual Server Provisioning and Selection in distributed Data Centers
AU - Xu, Jielong
AU - Tang, Jian
AU - Mumey, Brendan
AU - Zhang, Weiyi
AU - Kwiat, Kevin
AU - Kamhoua, Charles
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2015/9/9
Y1 - 2015/9/9
N2 - In this paper, we study a Virtual Server Provisioning and Selection (VSPS) problem in distributed Data Centers (DCs) with the objective of minimizing the total operational cost while meeting the service response time requirement.We aim to develop general algorithms for the VSPS problem without assuming a particular queueing model for service processing in each DC. First, we present a Mixed Integer Linear Programming (MILP) formulation. Then we present a 3-step optimization framework, under which we develop a polynomial-time ln(N)-approximation algorithm (where N is the number of clients) along with a post-optimization procedure for performance improvement. We also show this problem is NP-hard to approximate and is not possible to obtain a better approximation ratio unless NP has TIME(nO(log log n)) deterministic time algorithms. In addition, we present an effective heuristic algorithm that jointly obtains the VS provisioning and selection solutions. Extensive simulation results are presented to justify effectiveness of the proposed algorithms.
AB - In this paper, we study a Virtual Server Provisioning and Selection (VSPS) problem in distributed Data Centers (DCs) with the objective of minimizing the total operational cost while meeting the service response time requirement.We aim to develop general algorithms for the VSPS problem without assuming a particular queueing model for service processing in each DC. First, we present a Mixed Integer Linear Programming (MILP) formulation. Then we present a 3-step optimization framework, under which we develop a polynomial-time ln(N)-approximation algorithm (where N is the number of clients) along with a post-optimization procedure for performance improvement. We also show this problem is NP-hard to approximate and is not possible to obtain a better approximation ratio unless NP has TIME(nO(log log n)) deterministic time algorithms. In addition, we present an effective heuristic algorithm that jointly obtains the VS provisioning and selection solutions. Extensive simulation results are presented to justify effectiveness of the proposed algorithms.
KW - Cloud Computing
KW - Distributed Data Centers
KW - Server Provisioning
KW - Server Selection
UR - http://www.scopus.com/inward/record.url?scp=84953750329&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84953750329&partnerID=8YFLogxK
U2 - 10.1109/ICC.2015.7249193
DO - 10.1109/ICC.2015.7249193
M3 - Conference contribution
AN - SCOPUS:84953750329
T3 - IEEE International Conference on Communications
SP - 5466
EP - 5472
BT - 2015 IEEE International Conference on Communications, ICC 2015
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - IEEE International Conference on Communications, ICC 2015
Y2 - 8 June 2015 through 12 June 2015
ER -