SLA-tree: a framework for efficiently supporting SLA-based decisions in cloud computing

  • Authors:
  • Yun Chi;Hyun Jin Moon;Hakan Hacigümüş;Junichi Tatemura

  • Affiliations:
  • NEC Laboratories America, Cupertino, CA;NEC Laboratories America, Cupertino, CA;NEC Laboratories America, Cupertino, CA;NEC Laboratories America, Cupertino, CA

  • Venue:
  • Proceedings of the 14th International Conference on Extending Database Technology
  • Year:
  • 2011

Quantified Score

Hi-index 0.01

Visualization

Abstract

As cloud computing becomes increasingly important in database systems, many new challenges and opportunities have arisen. One challenge is that in cloud computing, business profit plays a central role. Hence, it is very important for a cloud service provider to quickly make profit-oriented decisions. In this paper, we propose a novel data structure, called SLA-tree, to efficiently support profit-oriented decision making. SLA-tree is built on two pieces of information: (1) a set of buffered queries waiting to be executed, which represents the scheduled events that will happen in the near future, and (2) a service level agreement (SLA) for each query, which indicates the different profits for the query for varying query response times. By constructing the SLA-tree, we efficiently support the answering of certain profit-oriented "what if" questions. Answers to these questions in turn can be applied to different profit-oriented decisions in cloud computing such as profit-aware scheduling, dispatching, and capacity planning. Extensive experimental results based on both synthetic and real-world data demonstrate the effectiveness and efficiency of our SLA-tree framework.