TY - GEN
T1 - Self-Adaptive, Deadline-Aware Resource Control in Cloud Computing
AU - Xiang, Yu
AU - Balasubramanian, Bharath
AU - Wang, Michael
AU - Lan, Tian
AU - Sen, Soumya
AU - Chiang, Mung
PY - 2013/1/1
Y1 - 2013/1/1
N2 - Modern data centers deliver resources over the cloud for clients to run various applications and jobs with diverse requirements. Today's cloud resource management is able to support certain Quality of Service (QoS) requirements including reliability and security. However, in many settings such as the military cloud where latency requirement is paramount, existing cloud resource management schemes fall short in providing a systematic framework to meet and balance disparate types of application deadlines, since they are primarily focused on speeding up job executions for timely processing. In this paper we present a self-adaptive, deadline-aware resource control framework that can be implemented in a fully distributed fashion, making it suitable for unreliable environments where a single point of failure is not acceptable. Relying on Nash Bargaining in non-cooperative game theory, our framework allocates cloud resources in an optimal way to maximize the Nash Bargaining Solutions (NBS) with respect to both job priority and deadline. Further, it also enables self-adaptive deadline-aware resource allocation and rebalancing under cyber or physical attacks that may diminish cloud capacity. We validate our technique by performing experiments on the Hadoop framework.
AB - Modern data centers deliver resources over the cloud for clients to run various applications and jobs with diverse requirements. Today's cloud resource management is able to support certain Quality of Service (QoS) requirements including reliability and security. However, in many settings such as the military cloud where latency requirement is paramount, existing cloud resource management schemes fall short in providing a systematic framework to meet and balance disparate types of application deadlines, since they are primarily focused on speeding up job executions for timely processing. In this paper we present a self-adaptive, deadline-aware resource control framework that can be implemented in a fully distributed fashion, making it suitable for unreliable environments where a single point of failure is not acceptable. Relying on Nash Bargaining in non-cooperative game theory, our framework allocates cloud resources in an optimal way to maximize the Nash Bargaining Solutions (NBS) with respect to both job priority and deadline. Further, it also enables self-adaptive deadline-aware resource allocation and rebalancing under cyber or physical attacks that may diminish cloud capacity. We validate our technique by performing experiments on the Hadoop framework.
UR - http://www.scopus.com/inward/record.url?scp=84901229788&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84901229788&partnerID=8YFLogxK
U2 - 10.1109/SASOW.2013.35
DO - 10.1109/SASOW.2013.35
M3 - Conference contribution
AN - SCOPUS:84901229788
SN - 9781479950867
T3 - Proceedings - IEEE 7th International Conference on Self-Adaptation and Self-Organizing Systems Workshops, SASOW 2013
SP - 41
EP - 46
BT - Proceedings - IEEE 7th International Conference on Self-Adaptation and Self-Organizing Systems Workshops, SASOW 2013
PB - IEEE Computer Society
T2 - 7th IEEE International Conference on Self-Adaptation and Self-Organizing Systems Workshops, SASOW 2013
Y2 - 9 September 2013 through 13 September 2013
ER -