TY - GEN
T1 - On a fault-tolerant resource allocation scheme for revenue maximization in data centers
AU - Banerjee, Sujogya
AU - Murthy, Sudheendra
AU - Sen, Arunabha
PY - 2011
Y1 - 2011
N2 - 2011 has been the "Year of the Cloud" as organizations around the world have started migrating their services and applications to large-scale data center infrastructures. A large-scale data center experiences random failures of several hardware components every day. These hardware failures present challenging issues in providing reliable service to the end users. The notion of fault domains captures the effect of single hardware failures in data centers. In this paper, we use the concept of fault domains and investigate the problem of revenue maximization in fault-tolerant resource allocation in large data centers. We provide a novel formulation of the problem and prove that this problem is NP-complete. We provide optimal solution technique through Integer Linear Program formulation and present an efficient heuristic that produces near-optimal solution in a fraction of time required to compute the optimal. Through extensive experimentation, we prove the efficacy of our heuristics.
AB - 2011 has been the "Year of the Cloud" as organizations around the world have started migrating their services and applications to large-scale data center infrastructures. A large-scale data center experiences random failures of several hardware components every day. These hardware failures present challenging issues in providing reliable service to the end users. The notion of fault domains captures the effect of single hardware failures in data centers. In this paper, we use the concept of fault domains and investigate the problem of revenue maximization in fault-tolerant resource allocation in large data centers. We provide a novel formulation of the problem and prove that this problem is NP-complete. We provide optimal solution technique through Integer Linear Program formulation and present an efficient heuristic that produces near-optimal solution in a fraction of time required to compute the optimal. Through extensive experimentation, we prove the efficacy of our heuristics.
UR - http://www.scopus.com/inward/record.url?scp=84858972791&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84858972791&partnerID=8YFLogxK
U2 - 10.1109/ANTS.2011.6163676
DO - 10.1109/ANTS.2011.6163676
M3 - Conference contribution
AN - SCOPUS:84858972791
SN - 9781467300933
T3 - International Symposium on Advanced Networks and Telecommunication Systems, ANTS
BT - ANTS 2011 - 5th IEEE International Conference on Advanced Networks and Telecommunication Systems
T2 - 5th IEEE International Conference on Advanced Networks and Telecommunication Systems, ANTS 2011
Y2 - 18 December 2011 through 21 December 2011
ER -