Cost-Efficient Virtual Server Provisioning and Selection in distributed Data Centers

Jielong Xu; Jian Tang; Brendan Mumey; Weiyi Zhang; Kevin Kwiat; Charles Kamhoua

doi:10.1109/ICC.2015.7249193

Cost-Efficient Virtual Server Provisioning and Selection in distributed Data Centers

Jielong Xu, Jian Tang, Brendan Mumey, Weiyi Zhang, Kevin Kwiat, Charles Kamhoua

Department of Electrical Engineering & Computer Science

Research output: Chapter in Book/Entry/Poem › Conference contribution

2 Scopus citations

Abstract

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(n^{O(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.

Original language	English (US)
Title of host publication	IEEE International Conference on Communications
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	5466-5472
Number of pages	7
Volume	2015-September
ISBN (Print)	9781467364324
DOIs	https://doi.org/10.1109/ICC.2015.7249193
State	Published - Sep 9 2015
Event	IEEE International Conference on Communications, ICC 2015 - London, United Kingdom Duration: Jun 8 2015 → Jun 12 2015

Other

Other	IEEE International Conference on Communications, ICC 2015
Country/Territory	United Kingdom
City	London
Period	6/8/15 → 6/12/15

Keywords

Cloud Computing
Distributed Data Centers
Server Provisioning
Server Selection

ASJC Scopus subject areas

Electrical and Electronic Engineering
Computer Networks and Communications

Access to Document

10.1109/ICC.2015.7249193

Cite this

Xu, J, Tang, J, Mumey, B, Zhang, W, Kwiat, K & Kamhoua, C 2015, Cost-Efficient Virtual Server Provisioning and Selection in distributed Data Centers. in IEEE International Conference on Communications. vol. 2015-September, 7249193, Institute of Electrical and Electronics Engineers Inc., pp. 5466-5472, IEEE International Conference on Communications, ICC 2015, London, United Kingdom, 6/8/15. https://doi.org/10.1109/ICC.2015.7249193

@inproceedings{c3c9090868604d4a90f24f90b5d9fb63,

title = "Cost-Efficient Virtual Server Provisioning and Selection in distributed Data Centers",

abstract = "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.",

keywords = "Cloud Computing, Distributed Data Centers, Server Provisioning, Server Selection",

author = "Jielong Xu and Jian Tang and Brendan Mumey and Weiyi Zhang and Kevin Kwiat and Charles Kamhoua",

year = "2015",

month = sep,

day = "9",

doi = "10.1109/ICC.2015.7249193",

language = "English (US)",

isbn = "9781467364324",

volume = "2015-September",

pages = "5466--5472",

booktitle = "IEEE International Conference on Communications",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "IEEE International Conference on Communications, ICC 2015 ; Conference date: 08-06-2015 Through 12-06-2015",

}

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

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

SN - 9781467364324

VL - 2015-September

SP - 5466

EP - 5472

BT - IEEE International Conference on Communications

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 -

Cost-Efficient Virtual Server Provisioning and Selection in distributed Data Centers

Abstract

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this