A framework for consumer centric sla management of cloud hosted databases

1

A Framework for Consumer-Centric SLAManagement of Cloud-Hosted Databases

Liang Zhao ∗†, Sherif Sakr ∗†, Anna Liu ∗†∗National ICT Australia (NICTA)

†School of Computer Science and EngineeringUniversity of New South Wales, Australia{firstname.lastname}@Nicta.com.au

Abstract— One of the main advantages of the cloud computingparadigm is that it simplifies the time-consuming processesof hardware provisioning, hardware purchasing and softwaredeployment. Currently, we are witnessing a proliferation in thenumber of cloud-hosted applications with a tremendous increasein the scale of the data generated as well as being consumed bysuch applications. Cloud-hosted database systems powering theseapplications form a critical component in the software stack ofthese applications. Service Level Agreements (SLA) represent thecontract which captures the agreed upon guarantees between aservice provider and its customers. The specifications of existingservice level agreements (SLA) for cloud services are not designedto flexibly handle even relatively straightforward performanceand technical requirements of consumer applications. In thisarticle, we present a novel approach for SLA-based managementof cloud-hosted databases from the consumer perspective. Wepresent an end-to-end framework for consumer-centric SLA man-agement of cloud-hosted databases. The framework facilitatesadaptive and dynamic provisioning of the database tier of thesoftware applications based on application-defined policies forsatisfying their own SLA performance requirements, avoidingthe cost of any SLA violation and controlling the monetary costof the allocated computing resources. In this framework, theSLA of the consumer applications are declaratively defined interms of goals which are subjected to a number of constraintsthat are specific to the application requirements. The frameworkcontinuously monitors the application-defined SLA and auto-matically triggers the execution of necessary corrective actions(scaling out/in the database tier) when required. The frameworkis database platform-agnostic, uses virtualization-based databasereplication mechanisms and requires zero source code changes ofthe cloud-hosted software applications. The experimental resultsdemonstrate the effectiveness of our SLA-based framework inproviding the consumer applications with the required flexibilityfor achieving their SLA requirements.

Index Terms— Service Level Agreements (SLA), CloudDatabases, NoSQL Systems, Database-as-a-Service.

I. INTRODUCTION

Cloud computing technology represents a new paradigm forthe provisioning of computing infrastructure. This paradigmshifts the location of this infrastructure to the network toreduce the costs associated with the management of hardwareand software resources. It represents the long-held dream ofenvisioning computing as a utility [1] where the economyof scale principles help to effectively drive down the costof computing infrastructure. Cloud computing simplifies thetime-consuming processes of hardware provisioning, hardwarepurchasing and software deployment. Therefore, it promises anumber of advantages for the deployment of data-intensive

applications such as elasticity of resources, pay-per-use costmodel, low time to market, and the perception of (virtually)unlimited resources and infinite scalability. Hence, it becomespossible, at least theoretically, to achieve unlimited throughputby continuously adding computing resources (e.g. databaseservers) if the workload increases.

In practice, the advantages of the cloud computing paradigmopens up new avenues for deploying novel applications whichwere not economically feasible in a traditional enterpriseinfrastructure setting. Therefore, the cloud has become anincreasingly popular platform for hosting software applicationsin a variety of domains such as e-retail, finance, news andsocial networking. Thus, we are witnessing a proliferation inthe number of applications with a tremendous increase in thescale of the data generated as well as being consumed by suchapplications. Cloud-hosted database systems powering theseapplications form a critical component in the software stackof these applications.

Cloud computing is by its nature a fast changing environ-ment which is designed to provide services to unpredictablydiverse sets of clients and heterogenous workloads. Severalstudies have also reported that the variation of the performanceof cloud computing resources is high [2], [3]. These char-acteristics raise serious concerns from the cloud consumers’perspective regarding the manner in which the SLA of theirapplication can be managed. According to a Gartner marketreport released in November 2010, SaaS is forecast to havea 15.8% growth rate through 2014 which makes SaaS andcloud very interesting to the services industry, but the viabilityof the business models depends on the practicality and thesuccess of the terms and conditions (SLAs) being offered bythe service provider(s) in addition to their satisfaction to theservice consumers. Therefore, successful SLA managementis a critical factor to be considered by both providers andconsumers alike. Existing service level agreements (SLAs) ofcloud providers are not designed for supporting the straight-forward requirements and restrictions under which SLA ofconsumers’ applications need to be handled. Particularly, mostproviders guarantee only the availability (but not the perfor-mance) of their services [4]. Therefore, consumer concernson SLA handling for their cloud-hosted databases along withthe limitations of existing SLA frameworks to express andenforce SLA requirements in an automated manner creates theneed for SLA-based management techniques for cloud-hosted

2

databases. In this article, we present a novel approach forSLA-based management of cloud-hosted databases from theconsumer perspective. In particular, we summarize the maincontributions of this article as follows:• We present an overview of the different options of hosting

the database tier of software applications in cloud envi-ronments. In addition, we provide a detailed discussionfor the main challenges for managing and achieving theSLA requirements of cloud-hosted database services.

• We present the design and implementation details of anend-to-end framework that enables the cloud consumerapplications to declaratively define and manage their SLAfor the cloud-hosted database tiers in terms of goalswhich are subjected to a number of constraints that arespecific to their application requirements. The presentedframework is database platform-agnostic and relies onvirtualization-based database replication mechanism.

• We present consumer-centric dynamic provisioningmechanisms for cloud-hosted databases based on adaptiveapplication requirements for two significant SLA metrics,namely, data freshness and transactions response times.

• We conduct an extensive set of experiments that demon-strate the effectiveness of our framework in providing thecloud consumer applications with the required flexibilityfor achieving their SLA requirements of the cloud-hosteddatabases.

To the best of our knowledge, our approach is the firstthat tackles the problem of SLA management for cloud-hosteddatabases from the perspective of the consumer applications.The remainder of this article is structured as follows. Section IIprovides an overview of the different options of deployingthe database tier of software applications on cloud platforms.Section III discusses the main challenges of SLA Managementfor cloud-hosted databases. Section IV presents an overviewof our framework architecture for consumer-centric SLAmanagement. The main challenges of database replicationmanagement in cloud environments are discussed in Section V.An experimental evaluation for the performance characteristicsof database replication in virtualized cloud environments ispresented in Section VI. Our mechanism for provisioning thedatabase tier based on the consumer-centric SLA metric ofdata freshness is presented in Section VII and for the SLAmetric of the response times of application transactions ispresented in Section VIII. Section IX summarizes the relatedwork before we conclude the article in Section X.

II. OPTIONS OF HOSTING CLOUD DATABASES

Over the past decade, rapidly growing Internet-based ser-vices such as e-mail, blogging, social networking, search ande-commerce have substantially redefined the way consumerscommunicate, access contents, share information and purchaseproducts. In principle, the main goal of cloud-based datamanagement systems is to facilitate the job of implement-ing every application as a distributed, scalable and widely-accessible service on the Web. In practice, there are threedifferent approaches for hosting the database tier of softwareapplications in cloud platforms, namely, the platform storageservices (NoSQL systems), the relational database as a service

(DaaS) and virtualized database servers. In the followingsubsections, we discuss the capabilities and limitations of eachof these approaches.

A. The platform storage services

This approach relies on a new wave of storage platformsnamed as key-value stores or NoSQL (Not Only SQL) sys-tems. These systems are designed to achieve high throughputand high availability by giving up some functionalities thattraditional database systems offer such as joins and ACIDtransactions [5]. For example, most of the NoSQL systemsprovide simple call level data access interfaces (in contrast toa SQL binding) and rely on weaker consistency managementprotocols (e.g. eventual consistency [6]). Commercial cloudofferings of this approach include Amazon SimpleDB andMicrosoft Azure Table Storage. In addition, there is a largenumber of open source projects that have been introducedwhich follow the same principles of NoSQL systems [7]such as HBase and Cassandra. In practice, migrating existingsoftware application that uses relational database to NoSQLofferings would require substantial changes in the softwarecode due to the differences in the data model, query interfaceand transaction management support. In addition, developingapplications on top of an eventually consistent NoSQL datas-tore requires a higher effort compared to traditional databasesbecause they hinder important factors such as data indepen-dence, reliable transactions, and other cornerstone characteris-tics often required by applications that are fundamental to thedatabase industry [8], [9]. In practice, the majority of today’splatform storage systems are more more suitable for OLAPapplications than for OLTP applications [10].

B. Relational Database as a Service (DaaS)

In this approach, a third party service provider hosts arelational database as a service [11]. Such services alleviatethe need for their users to purchase expensive hardware andsoftware, deal with software upgrades and hire professionalsfor administrative and maintenance tasks. Cloud offerings ofthis approach include Amazon RDS and Microsoft SQL Azure.For example, Amazon RDS provides access to the capabilitiesof MySQL or Oracle database while Microsoft SQL Azurehas been built on Microsoft SQL Server technologies. Assuch, users of these services can leverage the capabilities oftraditional relational database systems such as creating, ac-cessing and manipulating tables, views, indexes, roles, storedprocedures, triggers and functions. It can also execute complexqueries and joins across multiple tables. The migration ofthe database tier of any software application to a relationaldatabase service is supposed to require minimal effort if theunderlying RDBMS of the existing software application iscompatible with the offered service. However, many relationaldatabase systems are, as yet, not supported by the DaaSparadigm (e.g. DB2, Postgres). In addition, some limitationsor restrictions might be introduced by the service providerfor different reasons1. Moreover, the consumer applicationsdo not have sufficient flexibility in controlling the allocated

1http://msdn.microsoft.com/en-us/library/windowsazure/ee336245.aspx

3

resources of their applications (e.g. dynamically allocatingmore resources for dealing with increasing workload or dy-namically reducing the allocated resources in order to reducethe operational cost). The whole resource management andallocation process is controlled at the provider side whichlimits the ability of the consumer applications to maximizetheir benefits from the elasticity and scalability features of thecloud environment.C. Virtualized Database Server

Virtualization is a key technology of the cloud computingparadigm. Virtual machine technologies are increasingly beingused to improve the manageability of software systems andlower their total cost of ownership. They allow resources tobe allocated to different applications on demand and hidethe complexity of resource sharing from cloud users byproviding a powerful abstraction for application and resourceprovisioning. In particular, resource virtualization technologiesadd a flexible and programmable layer of software betweenapplications and the resources used by these applications.The virtualized database server approach takes an existingapplication that has been designed to be used in a conventionaldata center, and then port it to virtual machines in thepublic cloud. Such migration process usually requires minimalchanges in the architecture or the code of the deployedapplication. In this approach, database servers, like any othersoftware components, are migrated to run in virtual machines.Our work presented in this article belongs to this approach.In principle, one of the major advantages of the virtualizeddatabase server approach is that the application can have fullcontrol in dynamically allocating and configuring the physicalresources of the database tier (database servers) as needed [12],[13], [14]. Hence, software applications can fully utilize theelasticity feature of the cloud environment to achieve theirdefined and customized scalability or cost reduction goals.However, achieving these goals requires the existence of anadmission control component which is responsible for moni-toring the system state and taking the corresponding actions(e.g. allocating more/less computing resources) according tothe defined application requirements and strategies. Severalapproaches have been proposed for building admission controlcomponents which are based on the efficiency of utilization ofthe allocated resources [13], [14]. In our approach, we focuson building an SLA-based admission control component as amore practical and consumer-centric view for achieving therequirements of their applications.

III. CHALLENGES OF SLA MANAGEMENT FORCLOUD-HOSTED DATABASES

An SLA is a contract between a service provider andits customers. Service Level Agreements (SLAs) capture theagreed upon guarantees between a service provider and itscustomer. They define the characteristics of the provided ser-vice including service level objectives (SLOs) (e.g. maximumresponse times, minimum throughput rates, data freshness) anddefine penalties if these objectives are not met by the serviceprovider. In general, SLA management is a common generalproblem for the different types of software systems which arehosted in cloud environments for different reasons such as

Cloud Service Provides

(CSP)

Cloud ConsumersEnd Users

I-SLAA-SLA

e.g. Amazon , Microsoft, Google, Rackspace

e.g. Software-as-a-Service (SaaS)

Cloud-hosted software applications

Fig. 1: SLA Parties in Cloud Environments

the unpredictable and bursty workloads from various users inaddition to the performance variability in the underlying cloudresources. In particular, there are three typical parties in thecloud. To keep a consistent terminology through out the restof the article, these parties are defined as follows:• Cloud Service Providers (CSP): They offer client-

provisioned and metered computing resources (e.g.CPU, storage, memory, network) that can be rentedfor flexible time durations. In particular, they include:Infrastructure-as-a-Service providers (IaaS), Platform-as-a-Service providers (PaaS) and Database-as-a-Service(DaaS). Examples are: Amazon, Microsoft and Google.

• Cloud Consumers: They represent the cloud-hosted soft-ware applications that utilize the services of CSP and arefinancially responsible for their resource consumptions.

• End Users: They represent the legitimate users for the ser-vices (applications) that are offered by cloud consumers.

While cloud service providers charge cloud consumers forrenting computing resources to deploy their applications, cloudconsumers may charge their end users for processing theirworkloads (e.g. SaaS) or may process the user requests for free(cloud-hosted business application). In both cases, the cloudconsumers need to guarantee their users’ SLA. Penalties areapplied in the case of SaaS and reputation loss is incurred inthe case of cloud-hosted business applications. For example,Amazon found that every 100ms of latency costs them 1% insales and Google found that an extra 500ms in search pagegeneration time dropped traffic by 20%2. In addition, largeenterprise web applications (e.g., eBay and Facebook) needto provide high assurances in terms of SLA metrics such asresponse times and service availability to their users. Withoutsuch assurances, service providers of these applications standto lose their user base, and hence their revenues.

In practice, resource management and SLA guarantee fallsinto two layers: the cloud service providers and the cloudconsumers. In particular, the cloud service provider is re-sponsible for the efficient utilization of the physical resourcesand guarantee their availability for their customers (cloudconsumers). The cloud consumers are responsible for theefficient utilization of their allocated resources in order tosatisfy the SLA of their customers (end users) and achievetheir business goals. Therefore, we distinguish between twotypes of service level agreements (SLAs):

1) Cloud Infrastructure SLA (I-SLA): These SLA are offeredby cloud providers to cloud consumers to assure thequality levels of their cloud computing resources (e.g.,

2http://glinden.blogspot.com/2006/11/marissa-mayer-at-web-20.html

4

server performance, network speed, resources availability,storage capacity).

2) Cloud-hosted Application SLA (A-SLA): These guaranteesrelate to the levels of quality for the software applicationswhich are deployed on a cloud infrastructure. In particu-lar, cloud consumers often offer such guarantees to theirapplication’s end users in order to assure the quality ofservices that are offered such as the application’s responsetime and data freshness.

Figure 1 illustrates the relationship between I-SLA andA-SLA in the software stack of cloud-hosted applications.In practice, traditional cloud monitoring technologies (e.g.Amazon CloudWatch focus on low-level computing resources(e.g. CPU speed, CPU utilization, disk speed). In principle,translating the SLAs of applications’ transactions to the thresh-olds of utilization for low-level computing resources is a verychallenging task and is usually done in an ad-hoc manner dueto the complexity and dynamism inherent in the interactionbetween the different tiers and components of the system. Inparticular, meeting SLAs which are agreed with end-users byconsumer applications of cloud resources using the traditionaltechniques for resource provisioning is a very challenging taskdue to many reasons such as:• Highly dynamic workload: An application service can be

used by large numbers of end-users and highly variableload spikes in demand can occur depending on the dayand the time of year, and the popularity of the appli-cation. In addition, the characteristic of workload couldvary significantly from one application type to anotherand possible fluctuations on the workload characteristicswhich could be of several orders of magnitude on thesame business day may occur [15]. Therefore, predictingthe workload behavior (e.g. arrival pattern, I/O behav-ior, service time distribution) and consequently accurateplanning of the computing resource requirements are verychallenging tasks.

• Performance variability of cloud resources: Several stud-ies have reported that the variation of the performanceof cloud computing resources is high [2], [3]. As aresult, currently, cloud service providers do not provideadequate SLAs for their service offerings. Particularly,most providers guarantee only the availability (but notthe performance) of their services [1], [16].

• Uncertain behavior: one complexity that arises with thevirtualization technology is that it becomes harder to pro-vide performance guarantees and to reason about a partic-ular application’s performance because the performanceof an application hosted on a virtual machine becomes afunction of applications running in other virtual machineshosted on the same physical machine. In addition, itmay be challenging to harness the full performance ofthe underlying hardware, given the additional layers ofindirection in virtualized resource management [17].

In practice, it is a very challenging goal to delegate themanagement of the SLA requirements of the consumer ap-plications to the side of the cloud service provider due tothe wide heterogeneity in the workload characteristics, detailsand granularity of SLA requirements, and cost management

objectives of the very large number of consumer applications(tenants) that can be simultaneously running in a cloud envi-ronment. Therefore, it becomes a significant issue for the cloudconsumers to be able to monitor and adjust the deploymentof their systems if they intend to offer viable service levelagreements (SLAs) to their customers (end users) [12]. Failingto achieve these goals will jeopardize the sustainable growthof cloud computing in the future and may result in valuableapplications move away from the cloud. In the following sec-tions, we present our consumer-centric approach for managingthe SLA requirements of cloud-hosted databases.

IV. FRAMEWORK ARCHITECTURE

In this section, we present an overview of our consumer-centric framework that enables the cloud consumer applica-tions to declaratively define and manage their SLA for thecloud-hosted database tiers in terms of goals which are sub-jected to a number of constraints that are specific to their appli-cation requirements. The framework also enables the consumerapplications to declaratively define a set of application-specificrules (action rules) where the admission control component ofthe database tier needs to take corresponding actions in orderto meet the expected system performance or to reduce the costof the allocated cloud resources when they are not efficientlyutilized. The framework continuously monitors the databaseworkload, tracks the satisfaction of the application-definedSLA, evaluates the condition of the action rules and takesthe necessary actions when required. The design principles ofour framework architecture are to be application-independentand to require no code modification on the consumer softwareapplications that the framework will support. In addition,the framework is database platform-agnostic and relies onvirtualization-based database replication mechanism. In or-der to achieve these goals, we rely on a database proxyingmechanism which provides the ability to forward databaserequests to the underlying databases using an intermediatepiece of software, the proxy, and to return the results fromthose request transparently to the client program without theneed of having any database drivers installed. In particular, adatabase proxy software is a simple program that sits betweenthe client application and the database server that can monitor,analyze or transform their communications. Such flexibilityallows for a wide variety of uses such as load balancing, queryanalysis and query filtering.

In general, there exist many forms of SLAs with differentmetrics. In this article, we focus on the following two mainconsumer-centric SLA metrics:• Data freshness: which represents the tolerated window of

data staleness for each database replica. In other words, itrepresents the time between a committed update operationon the master database and the time when the operationis propagated and committed to the database replica(Section VII).

• Transaction response time: which represents the timebetween a transaction is presented to the database systemand the time when the transaction execution is completed(Section VIII).

Figure 2 shows an overview of our framework architecturewhich consists of three main modules: the monitor module, the

5

Action

Module

Load balancer actions

Database actions

...

Control

Module

Replication delay control

Response time control

...

Feed

Monitor

Module

Replication delay monitor

Response time monitor

...

Trigger

Slave1

Slave...

Slavek

Database

Proxy

Master

Configurations

Application

Define

Fig. 2: Framework Architecture

control module and the action module. In this architecture,the consumer application is only responsible of configuringthe control module of the framework by declaratively defining(using an XML dialect) the specifications of the SLA metricsof their application. In addition, the consumer applicationdeclaratively defines (using another XML dialect) a set ofrules that specify the actions that should be taken (when aset of conditions are satisfied) in order to meet the expectedsystem performance or to reduce the cost of the allocatedcloud resources when they are not efficiently utilized. Moredetails and examples about the declarative definitions of theapplication-specific SLA metrics and action rules will bepresented in Section VII and Section VIII. The control mod-ule also maintains the information about the configurationsof the load balancer (e.g. proxy address, proxy script), theaccess information of each database replica (e.g. host address,port number) and the location information of each databasereplica (e.g. us-east, us-west, eu-west). On the runtime, themonitor module is responsible of continuously tracking theapplication-defined SLAs and feeding the control module withthe collected information. The control module is responsiblefor continuously checking the monitored SLA values againsttheir associated application-defined SLAs and triggers theaction module to scale out/in the database according to theapplication-defined action rules.

In general, dynamic provisioning at the database-tier in-volves increasing or decreasing the number of database serversallocated to an application in response to workload changes.Data replication is a well-known strategy to achieve theavailability, scalability and performance improvement goals inthe data management world. In particular, when the applicationload increases and the database tier becomes the bottleneckin the stack of the software application, there are two mainoptions for achieving scalability at the database tier to enablethe application to cope with more client requests:

1) Scaling up (Vertical scalability): which aims at allocatinga bigger machine with more horsepower (e.g. more pro-cessors, memory, bandwidth) to act as a database server.

2) Scaling out (Horizontal scalability): which aims at repli-cating the data across more machines.

In practice, the scaling up option has the main drawbackthat large machines are often very expensive and eventually

a physical limit is reached where a more powerful machinecannot be purchased at any cost. Alternatively, it is bothextensible and economical, especially in a dynamic workloadenvironment, to scale out by adding another commodity serverwhich fits well with the pay-as-you-go pricing philosophy ofcloud computing. In addition, the scale out mechanism is moreadequate for achieving the elasticity benefit of cloud platformsby facilitating the process of horizontally adding or removing(in case of scaling in), as necessary, computing resourcesaccording to the application workload and requirements.

In database replication, there are two main replication strate-gies: master-slave and multi-master. In master-slave, updatesare sent to a single master node and lazily replicated toslave nodes. Data on slave nodes might be stale and it is theresponsibility of the application to check for data freshnesswhen accessing a slave node. Multi-master replication enforcesa serializable execution order of transactions between allreplicas so that each of them applies update transactions in thesame order. This way, any replica can serve any read or writerequest. Our framework mainly considers the master-slavearchitecture as it is the most common architecture employedby most web applications in the cloud environment. For thesake of simplicity of achieving the consistency goal amongthe database replicas and reducing the effect of networkcommunication latency, we employ the ROWA (read-once-write-all) protocol on the Master copy [18]. However, ourframework can be easily extended to support the multi-masterreplication strategy as well.

In general, provisioning of a new database replica involvesextracting database content from an existing replica and copy-ing that content to a new replica. In practice, the time takento execute these operations mainly depends on the databasesize. To provision database replicas in a timely fashion, it isnecessary to periodically snapshot the database state in orderto minimize the database extraction and copying time to thatof only the snapshot synchronization time. Clearly, there is atradeoff between the time to snapshot the database, the size ofthe transactional log and the amount of update transactionsin the workload. In our framework this trade-off can becontrolled by application-defined parameters. This tradeoffcan be further optimized by applying recently proposed livedatabase migration techniques [19], [20].

V. DATABASE REPLICATION IN THE CLOUD

The CAP theorem [21] shows that a shared-data system canonly choose at most two out of three properties: Consistency(all records are the same in all replicas), Availability (all repli-cas can accept updates or inserts), and tolerance to Partitions(the system still functions when distributed replicas cannottalk to each other). In practice, it is highly important forcloud-based applications to be always available and acceptupdate requests of data and at the same time cannot blockthe updates even while they read the same data for scalabilityreasons. Therefore, when data is replicated over a wide area,this essentially leaves just consistency and availability for asystem to choose between. Thus, the C (consistency) partof CAP is typically compromised to yield reasonable systemavailability [10]. Hence, most of the cloud data management

6

overcome the difficulties of distributed replication by relaxingthe consistency guarantees of the system. In particular, theyimplement various forms of weaker consistency models (e.g.eventual consistency [6]) so that all replicas do not have toagree on the same value of a data item at every moment oftime. In particular, the eventual consistency policy guaranteesthat if no new updates are made to the object, eventuallyall accesses will return the last updated value. If no failuresoccur, the maximum size of the inconsistency window can bedetermined based on factors such as communication delays,the load on the system and the number of replicas involved inthe replication scheme.

Florescu and Kossmann [22] have argued that in the newlarge scale web applications, the requirement to provide 100percent read and write availability for all users has overshad-owed the importance of the ACID paradigm as the gold stan-dard for data consistency. In these applications, no user is everallowed to be blocked. Hence, while having strong consistencymechanisms has been considered as a hard and expensiveconstraint in traditional database management systems, it hasbeen turned into an optimization goal (that can be relaxed) incloud-based database systems.

Kraska et al. [23] have presented a mechanism that allowssoftware designers to define the consistency guarantees on thedata instead of at the transaction level. In addition, it allowsthe ability to automatically switch consistency guaranteesat runtime. They described a dynamic consistency strategy,called Consistency Rationing, to reduce the consistency re-quirements when possible (i.e., the penalty cost is low) andraise them when it matters (i.e., the penalty costs wouldbe too high). Keeton et al. [24] have proposed a similarapproach in a system called LazyBase that allows users totrade off query performance and result freshness. LazyBasebreaks up metadata processing into a pipeline of ingestion,transformation and query stages which can be parallelized toimprove performance and efficiency. LazyBase uses modelsof transformation and query performance to determine howto schedule transformation operations to meet users’ freshnessand performance goals, and to utilize resources efficiently.

While Consistency Rationing and LazyBase represent twoapproaches for supporting adaptive consistency managementfor cloud-hosted databases, they are more focused on theperspective of cloud service provider. On the contrary, ourframework is more focused on the cloud consumer perspective.In particular, it provides the cloud consumer (software appli-cation) with flexible mechanisms for specifying and managingthe extent of inconsistencies that they can tolerate. In addition,it allows the creation and monitoring of several replicas of thedatabase with different levels of freshness across the differentvirtualized servers as we will show in a later section.

VI. PERFORMANCE EVALUATION OF DATABASEREPLICATION ON VIRTUALIZED CLOUD ENVIRONMENTS

In this section, we present an experimental evaluation forthe performance characteristics of the master-slave databasereplication strategy on virtualized database server in cloudenvironments [25]. In particular, the main goals of the ex-periments of this section are:

• To investigate the scalability characteristics of the master-slave replication strategy with an increasing workloadand an increasing number of database replicas in avirtualized cloud environment. In particular, we try toidentify what factors act as limits on achievable scalein such deployments.

• To measure the average replication delay (window ofdata staleness) that could exist with an increasing numberof database replicas and different configurations to thegeographical locations of the slave databases.

A. Experiment designThe Cloudstone benchmark3 has been designed as a per-

formance measurement tool for Web 2.0 applications. Thebenchmark mimics a Web 2.0 social events calendar thatallows users to perform individual operations (e.g. browsing,searching and creating events), as well as, social operations(e.g. joining and tagging events)[26]. Unlike Web 1.0 applica-tions, Web 2.0 applications behave differently on database inmany ways. One of the differences is on the write pattern. Ascontents of Web 2.0 applications depend on user contributionsvia blogs, photos, videos and tags. Therefore, more writetransactions are expected to be processed. Another differenceis on the tolerance with regards to data consistency. In general,Web 2.0 applications are more acceptable to data staleness.For example, it might not be a mission-critical goal for asocial network application (e.g. Facebook) to immediatelyhave a user’s new status available to his friends. However, aconsistency window of some seconds (or even some minutes)would be still acceptable. Therefore, we believe that the designand workload characteristics of the the Cloudstone benchmarkis more suitable for the purpose of our study rather thanother benchmarks such as TPC-W or RUBiS which are morerepresenting Web 1.0-like applications

The original software stack of Cloudstone consists of 3components: web application, database, and load generator.Throughout the benchmark, the load generator generates theload against the web application which in turn makes use ofthe database. The benchmark designs well for benchmarkingperformance of each tier for Web 2.0 applications. However,the original design of the benchmark makes it hard to pushthe database performance to its performance limits whichlimits its suitability for our experiments of focusing mainlyon the database tier of the software stack. In general, auser’s operation which is sent by a load generator has tobe interpreted as database transactions in the web tier basedon a pre-defined business logic before bypassing the requestto the database tier. Thus the saturation on the web tierusually happens earlier than the saturation on the database tier.Therefore, we modified the design of the original softwarestack by removing the web server tier. In particular, we re-implemented the business logic of the application in a waythat a user’s operation can be processed directly at the databasetier without any intermediate interpretation at the web servertier. Meanwhile, on top of our Cloudstone implementation, wealso implemented a connection pool (i.e. DBCP4) and a proxy

3http://radlab.cs.berkeley.edu/wiki/Projects/Cloudstone4http://commons.apache.org/dbcp/

7

(i.e. MySQL Connector/J5) components. The pool componentenables the application users to reuse the connections thathave been released by other users who have completed theiroperations in order to save the overhead of creating a newconnection for each operation. The proxy component works asa load balancer among the available database replicas where allwrite operations are sent to the master while all read operationsare distributed among slaves.

Multiple MySQL replicas are deployed to compose thedatabase tier. For the purpose of monitoring replication delayin MySQL, we have created a Heartbeats database and atime/date function for each replica. The Heartbeats database,synchronized in the format of SQL statement across replicas,maintains a ’heartbeat’ table which records an id and atimestamp in each row. A heartbeat plug-in for Cloudstoneis implemented to insert a new row with a global id anda local time stamp to the master periodically during theexperiment. Once the insert query is replicated to slaves, everyslave re-executes the query by committing the global id andits own local time stamp. The replication delay from themaster to slaves is then calculated as the difference of twotimestamps between the master and each slave. In practice,there are two challenges with respect to achieving a fine-grained measurement of replication delay: the resolution of thetime/date function and the clock synchronization between themaster and slaves. The time/date function offered by MySQLhas a resolution of a second which represents an unacceptablesolution because accurate measuring of the replication delayrequires a higher precision. We, therefore, implemented a userdefined time/date function with a microsecond resolution thatis based on a proposed solution to MySQL Bug #85236.The clock synchronizations between the master and slaves aremaintained by NTP7 (Network Time Protocol) on AmazonEC2. We set the NTP protocol to synchronize with multipletime servers every second to have a better resolution.

With the customized Cloudstone8 and the heartbeat plug-in, we are able to achieve our goal of measuring the end-to-end database throughput and the replication delay. In par-ticular, we defined two configurations with read/write ratiosof 50/50 and 80/20. We also defined three configurations ofthe geographical locations based on Availability Zones (theyare distinct locations within a Region) and Regions (they areseparated into geographic areas or countries) as follows: samezone where all slaves are deployed in the same AvailabilityZone of a Region of the master database; different zones wherethe slaves are in the same Region as the master database, but indifferent Availability Zones; different regions where all slavesare geographically distributed in a different Region from wherethe master database is located. The workload and the numberof database replicas start with a small number and graduallyincrease at a fixed step. Both numbers stop increasing if thereare no throughput gained.

5http://www.mysql.com/products/connector/6http://bugs.mysql.com/bug.php?id=85237http://www.ntp.org/8the source code of our Cloudstone customized implementation is available

on http://code.google.com/p/clouddb-replication/

us-west eu-west ap-southeast ap-northeast

L2

us-e

ast-1

au

s-e

ast-1

bL3

Cloudstone benchmark

Master

Slave1 Slavek Slavek+1 Slaven

Slave1 Slavek Slavek+1 Slaven

M write

operations

N re

ad

op

era

tion

s (d

istrib

ute

d)

Replication within the same region and the same availability zone

Replication within the same region but across availability zones

Slave1 Slaven

Replication across regions

us-e

ast

M / N satisfies pre-defined read/write ratioL1

Slave1 Slaven Slave1 Slaven Slave1 Slaven

Fig. 3: Database replication on virtualized cloud servers.

B. Experiment setup

We conducted our replication experiments in AmazonEC2 service with a three-layer implementation (Fig. 3). Thefirst layer is the Cloudstone benchmark which controls theread/write ratio and the workload by separately adjusting thenumber of read and write operations, and the number ofconcurrent users. As a large number of concurrent users em-ulated by the benchmark could be very resource-consuming,the benchmark is deployed in a large instance to avoid anyoverload on the application tier. The second layer includes themaster database that receives the write operations from thebenchmark and is responsible for propagating the writesetsto the slaves. The master database runs in a small instanceso that saturation can be expected to be observed early. Boththe master database server and the application benchmark aredeployed in us-east-1a location. The third layer is a group ofslaves which are responsible for processing read operationsand updating writesets. The number of slaves in a groupvaries from one to the number where throughput limitationis achieved. Several options for the deployment locations ofthe slaves have been used, namely, the same zone as themaster in us-east-1a, a different zone in us-east-1b and fourpossible different regions, ranging among us-west, eu-west, ap-southeast and ap-northeast. All slaves run in small instancesfor the same reason of provisioning the master instance.

Several sets of experiments have been implemented in orderto investigate the end-to-end throughput and the replicationdelay. Each of these sets is designed to target a specificconfiguration regarding the geographical locations of the slavedatabases and the read/write ratio. Multiple runs are conductedby compounding different workloads and numbers of slaves.The benchmark is able to push the database system to a limitwhere no more throughput can be obtained by increasing theworkload and the number of database replicas. Every run lasts35 minutes, including 10-minute ramp-up, 20-minute steadystage and 5-minute ramp down. Moreover, for each run, boththe master and slaves should start with a pre-loaded, fully-synchronized database.

C. End-to-end throughput experiments

Fig. 4 and Fig. 5 show the throughput trends for up to 4and 11 slaves with mixed configurations of three locations

8

5 0 7 5 1 0 0 1 2 5 1 5 0 1 7 5 2 0 00

5

1 0

1 5

2 0

2 5

End-t

o-end

throu

ghpu

t(op

eratio

ns pe

r sec

ond)

N u m b e r o f c o n c u r r e n t u s e r s

1 s l a v e 2 s l a v e s 3 s l a v e s 4 s l a v e s

(a) Same zone (us-west-1a)

5 0 7 5 1 0 0 1 2 5 1 5 0 1 7 5 2 0 00

5

1 0

1 5

2 0

2 5

End-t

o-end

throu

ghpu

t(op

eratio

ns pe

r sec

ond)

N u m v e r o f c o n c u r r e n t u s e r s


(b) Different zone (us-west-1b)

5 0 7 5 1 0 0 1 2 5 1 5 0 1 7 5 2 0 00

5

1 0

1 5

2 0

2 5

End-t

o-end

throu

ghpu

t(op

eratio

ns pe

r sec

ond)



(c) Different region (eu-west-1a)

Fig. 4: End-to-end throughput of the workload with the read/write ratio 50/50.

5 0 1 0 0 1 5 0 2 0 0 2 5 0 3 0 0 3 5 0 4 0 0 4 5 00

1 0

2 0

3 0

4 0

5 0

6 0

7 0

End-t

o-end

throu

ghpu

t(op

eratio

ns pe

r sec

ond)


1 s l a v e 2 s l a v e s 3 s l a v e s 4 s l a v e s 5 s l a v e s 6 s l a v e s 7 s l a v e s 8 s l a v e s 9 s l a v e s 1 0 s l a v e s 1 1 s l a v e s


5 0 1 0 0 1 5 0 2 0 0 2 5 0 3 0 0 3 5 0 4 0 0 4 5 00

1 0

2 0

3 0

4 0

5 0

6 0

7 0

End-t

o-end

throu

ghpu

t(op

eratio

ns pe

r sec

ond)




5 0 1 0 0 1 5 0 2 0 0 2 5 0 3 0 0 3 5 0 4 0 0 4 5 00

1 0

2 0

3 0

4 0

5 0

6 0

7 0

End-t

o-end

throu

ghpu

t(op

eratio

ns pe

r sec

ond)




Fig. 5: End-to-end throughput of the workload with the read/write ratio 80/20.

and two read/write ratios. Both results indicate that MySQLwith asynchronous master-slave replication is limited in itsability to scale due to the saturation to the master database. Inparticular, the throughput trends react to saturation movementsand transitions in database replicas in regards to an increasingworkload and an increasing number of database replicas. Ingeneral, the observed saturation point (the point right afterthe observed maximum throughput of a number of slaves),appearing in slaves at the beginning, moves along with anincreasing workload when an increasing number of slaves aresynchronized to the master. Eventually, however, the saturationwill transit from slaves to the master where the scalabilitylimit is achieved. Taking throughput trends with configurationsof the same zone and 50/50 ratio (Fig. 5a) as an example,the saturation point of 1 slave is initially observed at under100 workloads due to the full utilization of the slave’s CPU.When a 2nd slave is attached, the saturation point shifts to 175workloads where both slaves reach maximum CPU utilizationwhile the master’s CPU usage rate is also approaching itsutilization limit. Thus, ever since the 3rd slave is added,175 workloads remain as the saturation point, but with themaster being saturated instead of slaves. Once the master is inthe saturation status, adding more slaves does not help withimproving the scalability, because the overloaded master failsto offer extra capacity for improving write throughput to keepup the read/write ratio that corresponds to the increment of theread throughput. Hence, the read throughput is suppressed bythe benchmark, for the purpose of maintaining the pre-definedread/write ratio at 50/50. The slaves are over provisioned inthe case of 3 and 4 slaves, as the suppressed read throughputprevents slaves from being fully utilized. The similar saturation

transition also happens to 3 slaves at 50/50 ratio in the othertwo locations (Fig. 4b and Fig. 4c), and 10 slaves at 20/80ratio in the same zone (Fig. 5a), and different zone (Fig. 5b)and also 9 slaves at 20/80 ratio in different regions (Fig. 5c).

The configuration of the geographic locations is a factor thataffects the end-to-end throughput, in the context of locations ofusers. In the case of our experiments, since all users emulatedby Cloudstone send read operations from us-east-1a, distancesbetween the users and the slaves increase, following the orderof same zone, different zone and different region. Normally,a long distance incurs a slow round-trip time, which resultsin a smaller throughput for the same workload. Therefore,it can be expected that a decrease in maximum throughputwould be observed when configurations of locations followthe order of same zone, different zone and different region.Moreover, the throughput degradation is also related to readpercentages where higher read percentages would result inlarger degradations. It explains why degradation of maximumthroughput is more significant with configuration of 80/20read/write ratio (Fig. 5). Hence, it is a good strategy todistribute replicated slaves to places that are close to usersto improve end-to-end throughput.

The performance variation of instances is another factorthat needs to be considered when deploying databases in thecloud. For throughput trends of 1 slave at 50/50 read/writeratio with configurations of different zone and different region,respectively, if the configuration of locations is the only factor,the maximum throughput in the different zone (Fig. 4b) shouldbe larger than the one in the different region (Fig. 4c).However, the main reason of throughput difference here iscaused by the performance variation of instances rather than

9

5 0 7 5 1 0 0 1 2 5 1 5 0 1 7 5 2 0 01 0 0

1 0 1

1 0 2

1 0 3

1 0 4

1 0 5

1 0 6

Avera

ge re

lative

rep

licati

on de

lay (m

illisec

ond)




5 0 7 5 1 0 0 1 2 5 1 5 0 1 7 5 2 0 01 0 0

1 0 1

1 0 2

1 0 3

1 0 4

1 0 5

1 0 6

Avera

ge re

lative

rep

licati

on de

lay (m

illisec

ond)




5 0 7 5 1 0 0 1 2 5 1 5 0 1 7 5 2 0 01 0 0

1 0 1

1 0 2

1 0 3

1 0 4

1 0 5

1 0 6

Avera

ge re

lative

rep

licati

on de

lay (m

illisec

ond)




Fig. 6: Average relative replication delay of the workload with the read/write ratio is 50/50.

5 0 1 0 0 1 5 0 2 0 0 2 5 0 3 0 0 3 5 0 4 0 0 4 5 01 0 - 1

1 0 0

1 0 1

1 0 2

1 0 3

1 0 4

1 0 5

Avera

ge re

lative

rep

licatio

n dela

y (mi

llisec

ond)




5 0 1 0 0 1 5 0 2 0 0 2 5 0 3 0 0 3 5 0 4 0 0 4 5 01 0 - 1

1 0 0

1 0 1

1 0 2

1 0 3

1 0 4

1 0 5

Av

erage

relat

ive

replica

tion d

elay (

millis

econ

d)




5 0 1 0 0 1 5 0 2 0 0 2 5 0 3 0 0 3 5 0 4 0 0 4 5 01 0 - 1

1 0 0

1 0 1

1 0 2

1 0 3

1 0 4

1 0 5

Avera

ge re

lative

rep

licatio

n dela

y (mi

llisec

ond)




Fig. 7: Average relative replication delay of the workload with the read/write ratio is 80/20.

the configuration of locations. The 1st slave from the samezone runs on top of a physical machine with an Intel XeonCPU E5430 2.66GHz. While another 1st slave from the dif-ferent zone is deployed in a physical machine powered by anIntel Xeon CPU E5507 2.27GHz. Because of the performancedifferences between physical CPUs, the slave from same zoneperforms better than the one from different zone. Previousresearch indicated that the coefficient of variation of CPU ofsmall instances is 21% [2]. Therefore, it is a good strategy tovalidate instance performance before deploying applicationsinto the cloud, as poor-performing instances are launchedrandomly and can largely affect application performance.

D. Replication delay experiments

Fig. 6 and Fig. 7 show the trends of the average relativereplication delay for up to 4 and 11 slaves with mixedconfigurations of three locations and two read/write ratios.The results of both figures imply that the configurations of thegeographical locations has a lower impact on the replicationdelay than that of the workload characteristics. The trends ofthe average relative replication delay respond to an increasingworkload and an increasing number of database replicas. Formost cases, with the number of database replicas being keptconstant, the average relative replication delay surges alongwith an increasing workload which leads to more read andwrite operations sent to the slaves and the master database,respectively. It turns out that the increasing number of readoperations result in a higher resource demand on every slavewhile the increasing write operations on the master databaseleads to, indirectly, increasing resource demand on slaves asmore writesets are propagated to be committed on slaves.

The two increasing demands push resource contention higher,resulting in the delay of committing writesets, which sub-sequently results in higher replication delay. Similarly, theaverage relative replication delay decreases along with anincreasing number of database replicas as the addition of anew slave leads to a reduction in the resource contention andsubsequent decrease in replication delay.

As previously mentioned, the configuration of the geo-graphic location of the slaves play a less significant role inaffecting replication delay, in comparison to the changes ofthe workload characteristics. We measured the 1/2 round-triptime between the master in us-west-1a and the slave that usesdifferent configurations of geographic locations by runningthe ping command every second for a 20-minute period. Theresults suggest an average of 16, 21, and 173 milliseconds1/2 round-trip time for the same zone (Fig. 6a and Fig. 7a),different zones (Fig. 6b and Fig. 7b) and different regions(Fig. 6c and Fig. 7c), respectively. However, The trends of theaverage relative replication delay can usually go up from twoto four orders of magnitude (Fig. 6), or one to three ordersof magnitude (Fig. 7). Therefore, it could be suggested thatgeographic replication would be applicable in the cloud as longas workload characteristics can be well managed (e.g. havinga smart load balancer which is able to balance the operationsbased on estimated processing time).

VII. PROVISIONING THE DATABASE TIER BASED ON SLAOF DATA FRESHNESS

A. Adaptive Replication Controller

In practice, the cost of maintaining several database replicasthat are always strongly consistent is very high. Therefore,

10

us-w

est-1

ce

u-w

est-1

cu

s-e

ast-1

e

Cloudstone benchmark

Master

Slave

us-west-1

Slave

us-west-2

Slave

us-east-1

Slave

us-east-2

M / N read

write split

Replication within and across regions

M / N satisfies pre-defined read/write ratio

Slave

eu-west-1

Slave

eu-west-2

MySQL Proxy

The controller

Monitor and

manage to scale

Fig. 8: Adaptive replication controller.

keeping several database replicas with different levels offreshness can be highly beneficial in the cloud environmentsince freshness can be exploited as an important metric ofreplica selection for serving the application requests as well asoptimizing the overall system performance and monetary cost.Our framework provides the software applications with flexiblemechanisms for specifying different service level agreements(SLA) of data freshness for the underlying database replicas.In particular, the framework allows specifying an SLA ofdata freshness for each database replica and continuouslymonitor the replication delay of each replica so that once areplica violates its defined SLA, the framework automaticallyactivates another database replica at the closest geographiclocation in order to balance the workload and re-satisfy thedefined SLA [27]. In particular, the SLA of the replicationdelay for each replica (delaysla) is defined as an integervalue in the unit of millisecond which represents two maincomponents:

delaysla = delayrtt + delaytolerance

where the round-trip time component of the SLA replicationdelay (delayrtt) is the average round-trip time from themaster to the database replica. In particular, it represents theminimum delay cost for replicating data from the master to theassociated slave. The tolerance component of the replicationdelay (delaytolerance) is defined by a constant value whichrepresents the tolerance limit of the period of the time forthe replica to be inconsistent. This tolerance component canvary from one replica to another depending on many factorsuch as the application requirements, the geographic locationof the replica, and the workload characteristics and the loadbalancing strategy of each application. Therefore, the controlmodule is responsible of triggering the action module foradding a new database replica, when necessary, in order toavoid any violation in the application-defined SLA of datafreshness for the active database replicas. In our frameworkimplementation, we follow an intuitive strategy that triggersthe action module for adding a new replica when it detects anumber of continuous up-to-date monitored replication delaysof a replica which exceeds its application-defined threshold

(T ) of SLA violation of data freshness. In other words,for a running database replica, if the latest T monitoredreplication delays are violating its SLA of data freshness,the control module will trigger the action module to activatethe geographically closest replica (for the violating replica).It is worthy to note that the strategy of the control modulein making the decisions (e.g. the timing, the placement, thephysical creation) regarding the addition a new replica in orderto avoid any violence of the application-defined SLA can playan important role in determining the overall performance ofthe framework. However, it is not the main focus of this articleto investigate different strategies for making these decisions.We leave this aspect for future work.

B. Experimental Evaluation

We implemented two sets of experiments in order to eval-uate the effectiveness of our adaptive replication controllerin terms of its effect on the end-to-end system throughputand the replication delay for the underlying database replicas.Figure 8 illustrates the setup of our experiments in AmazonEC2 platform In the first set of experiments, we fix thevalue of the tolerance component (delaytolerance) of the SLAreplication delay to 1000 milliseconds and vary the monitorinterval (intvlmon) among the following set of values: 60,120, 240 and 480 seconds. In the second set of experiments,we fix the monitor interval (intvlmon) to 120 seconds andadjusts the SLA of replication delay (delaysla) by varying thetolerance component of the replication delay (delaytolerance)among the following set of values: 500, 1000, 2000 and4000 milliseconds. We have been evaluating the round-tripcomponent (delayrtt) of the replication delays SLA (delaysla)for the database replicas in the three geographical regions ofour deployment by running ping command every second fora 10 minutes period. The resulting average three round-triptimes (delayrtt) are 30, 130 and 200 milliseconds for themaster to slaves in us-west, us-east and eu-west respectively.Every experiment is executed for a period of 3000 secondswith a starting workload of 220 concurrent users and databaserequests with a read/write ratio of 80/20. The workloadgradually increases in steps of 20 concurrent users every 600seconds so that each experiment ends with a workload of 300concurrent users. Each experiment deploys 6 replicas in 3regions where each region hosts two replicas: the first replica isan active replica which is used from the start of the experimentfor serving the database requests of the application while thesecond replica is a hot backup which is not used for serving theapplication requests at the beginning of the experiment but canbe added by the action module, as necessary, when triggeredby the control module. Finally, in addition to the two setsof experiments, we conducted two experiments without ouradaptive replication controller in order to measure the end-to-end throughputs and replication delays of 3 (the minimumnumber of running replicas) and 6 (the maximum number ofrunning replicas) slaves in order to measure the baselines ofour comparison.

1) End-to-end throughput: Table I presents the end-to-endthroughput results for our set of experiments with differentconfiguration parameters. The baseline experiments represent

11

TABLE I: The effect of the the adaptive replication controller on the end-to-end system throughputExperiment Parameters The monitor interval The tolerance of Number of Running time End-to-end Replication

(intvlmon) replication delay running of all replicas throughput delay(in seconds) (delaytolerance) replicas (in seconds) (operations per seconds)

(in milliseconds)

Baselines with fixed N/A N/A 3 9000 22.33 Fig. 9anumber of replicas N/A N/A 6 18000 38.96 Fig. 9b

Varying the monitor interval 60 1000 3 → 6 15837 38.43 Fig. 9d(intvlmon) 120 1000 3 → 6 15498 36.45 Fig. 9c

240 1000 3 → 6 13935 34.12 Fig. 9e480 1000 3 → 6 12294 31.40 Fig. 9f

Varying the tolerance of 120 500 3 → 6 15253 37.44 Fig. 9greplication delay 120 1000 3 → 6 15498 36.45 Fig. 9c(delaytolerance) 120 2000 3 → 6 13928 36.33 Fig. 9h

120 4000 3 → 6 14437 34.68 Fig. 9i

the minimum and maximum end-to-end throughput results with22.33 and 38.96 operations per second, respectively. Theyalso represent the minimum and maximum baseline for therunning time of all database replicas with 9000 (3 runningreplicas, with 3000 seconds running time of each replica fromthe beginning to the end of the experiment) and 18000 (6running replicas, with 3000 seconds running time of eachreplica) seconds, respectively. The end-to-end throughput ofthe other experiments fall between the two baselines basedon the variance on the monitor interval (intvlmon) and thetolerance of replication delay (delaytolerance). Each exper-iment starts with 3 active replicas after which the numberof replicas gradually increases during the experiments basedon the configurations of the monitor interval and the SLAof replication delay parameters until it finally ends with 6replicas. Therefore, the total running time of the databasereplicas for the different experiments fall within the rangebetween 9000 and 18000 seconds. Similarly, the end-to-endthroughput delivered by the adaptive replication controller forthe different experiments fall within the end-to-end throughputrange produced by the two baseline experiments of 22.33 and38.96 operations per second. However, it is worth noting thatthe end-to-end throughput can be still affected by a lot of per-formance variations in the cloud environment such as hardwareperformance variation, network variation and warm up timeof the database replicas. In general, the relationship betweenthe running time of all slaves and end-to-end throughput isnot straightforward. Intuitively, a longer monitor interval ora longer tolerance of replication delay usually postpones theaddition of new replicas and consequently reduces the end-to-end throughput. The results show that the tolerance of thereplication delay parameter (delaytolerance) is more sensitivethan the monitor interval parameter (intvlmon). For example,having the values of the tolerance of the replication delayequal to 4000 and 1000 result in longer running times of thedatabase replicas than having the values equal to 2000 and500. On the other side, the increase of running time of allreplicas shows a linear trend along with the increase of theend-to-end throughput. However, a general conclusion mightnot easy to draw because the trend is likely affected by theworkload characteristics.

2) Replication delay: Figure 9 illustrates the effect of theadaptive replication controller on the performance of the repli-cation delay for the cloud-hosted database replicas. Figure (9a)and Figure (9b) show the replication delay of the two baselinecases for our comparison. They represent the experiments ofrunning with a fixed number of replicas (3 and 6 respectively)

from the starting times of the experiments to their end times.Figure (9a) shows that the replication delay tends to followdifferent patterns for the different replicas. The two trends ofus-west-1 and eu-west-1 surge significantly at 260 and 280users, respectively. On the same time, the trend of us-east-1tends to be stable throughout the entire running time of theexperiment. The main reason behind this is the performancevariation between the hosting EC2 instances for the databasereplicas9. Due to the performance differences between thephysical CPUs specifications, us-east-1 is able to handle theamount of operations that saturate us-west-1 and eu-west-1.Moreover, with an identical CPU for us-west-1 and eu-west-1,the former seems to surge at an earlier point than the latter.This is basically because of the difference in the geographicallocation of the two instances. As illustrated in Figure (8),the MySQL Proxy location is closer to us-west-1 than eu-west-1. Therefore, the forwarded database operations by theMySQL Proxy take less time to arrived at us-west-1 thaneu-west-1 which leads to more congestion on the us-west-1side. Similarly, in Figure (9b), the replication delay tends tosurge in both us-west-1 and us-west-2 for the same reasonof the difference in the geographic location of the underlyingdatabase replica.

Figures (9c), and (9g) to (9i) show the results of thereplication delay for our experiments using different values forthe monitor interval (intvlmon) and the tolerance of replicationdelay (delaytolerance) parameters. For example, Figure (9c)shows that the us-west-2, us-east-2, and eu-west-2 replicas areadded in sequence at the 255th, 407th and 1843th seconds,where the drop lines are emphasized. The addition of thethree replicas are caused by the SLA-violation of the us-west-1replicas at different periods. In particular, there are four SLA-violation periods for us-west-1 where the period must exceedthe monitor interval, and all calculated replication delays inthe period must exceed the SLA of replication delay. Thesefour periods are: 1) 67:415 (total of 349 seconds). 2) 670:841(total of 172 seconds). 3) 1373:1579 (total of 207 seconds).4) 1615:3000 (total of 1386 seconds). The addition of newreplicas is only triggered on the 1st and the 4th periods basedon the time point analysis. The 2nd and the 3rd periods do nottrigger the addition of new replica as the number of detectedSLA violations does not exceed the defined threshold (T ).

Figures (9c), and (9d) to (9f) show the effect of varying themonitor interval (intvlmon) on the replication delay of the

9Both us-west-1 and eu-west-1 are powered by Intel(R) Xeon(R) CPUE5507 @ 2.27GHz, whereas us-east-1 is deployed with a better CPU,Intel(R) Xeon(R) CPU E5645 @ 2.40GHz

12

u s - w e s t - 1 u s - e a s t - 1 e u - w e s t - 1

0 6 0 0 1 2 0 0 1 8 0 0 2 4 0 0 3 0 0 01 E - 4

1 E - 3

0 . 0 1

0 . 1

1

1 0

1 0 0

1 0 0 0

Replic

ation

delay

(sec

onds

)

T i m e l i n e p e r s l a v e ( s e c o n d )

(a) Fixed 3 running replicas

u s - w e s t - 1 u s - e a s t - 1 e u - w e s t - 1 u s - w e s t - 2 u s - e a s t - 2 e u - w e s t - 2

0 6 0 0 1 2 0 0 1 8 0 0 2 4 0 0 3 0 0 01 E - 4

1 E - 3

0 . 0 1

0 . 1

1

1 0

1 0 0

1 0 0 0

Replic

ation

delay

(sec

onds

)


(b) Fixed 6 running replicas


0 6 0 0 1 2 0 0 1 8 0 0 2 4 0 0 3 0 0 01 E - 4

1 E - 3

0 . 0 1

0 . 1

1

1 0

1 0 0

1 0 0 0

Replic

ation

delay

(sec

onds

)


(c) delaytolerance = 1000 ms and intvlmon = 120sec


0 6 0 0 1 2 0 0 1 8 0 0 2 4 0 0 3 0 0 01 E - 4

1 E - 3

0 . 0 1

0 . 1

1

1 0

1 0 0

1 0 0 0

Replic

ation

delay

(sec

onds

)


(d) intvlmon = 60 seconds


0 6 0 0 1 2 0 0 1 8 0 0 2 4 0 0 3 0 0 01 E - 4

1 E - 3

0 . 0 1

0 . 1

1

1 0

1 0 0

1 0 0 0

Replic

ation

delay

(sec

onds

)


(e) intvlmon = 120 seconds


0 6 0 0 1 2 0 0 1 8 0 0 2 4 0 0 3 0 0 01 E - 4

1 E - 3

0 . 0 1

0 . 1

1

1 0

1 0 0

1 0 0 0

Replic

ation

delay

(sec

onds

)


(f) intvlmon = 480 seconds


0 6 0 0 1 2 0 0 1 8 0 0 2 4 0 0 3 0 0 01 E - 4

1 E - 3

0 . 0 1

0 . 1

1

1 0

1 0 0

1 0 0 0

Replic

ation

delay

(sec

onds

)


(g) delaytolerance = 500 milliseconds


0 6 0 0 1 2 0 0 1 8 0 0 2 4 0 0 3 0 0 01 E - 4

1 E - 3

0 . 0 1

0 . 1

1

1 0

1 0 0

1 0 0 0

Replic

ation

delay

(sec

onds

)


(h) delaytolerance = 2000 milliseconds


0 6 0 0 1 2 0 0 1 8 0 0 2 4 0 0 3 0 0 01 E - 4

1 E - 3

0 . 0 1

0 . 1

1

1 0

1 0 0

1 0 0 0

Replic

ation

delay

(sec

onds

)


(i) delaytolerance = 4000 milliseconds

Fig. 9: The performance of the the adaptive management of the replication delay for the cloud-hosted database replicas.

different replicas. The results show that us-west-2 is alwaysthe first location that add a new replica because it is theclosest location to us-west-1 which hosts the replica that firstlyviolates its defined SLA data freshness. The results also showthat as the monitor interval increases, the triggering pointsfor adding new replicas are usually delayed. On the contrary,the results of Figure (9c) and Figures (9g) to (9i) show thatincreasing the value of the tolerance of the replication delayparameter (delaytolerance) does not necessarily cause a delayin the triggering point for adding new replicas.

In general, the results of our experiments show that theadaptive replication controller can play an effective role onreducing the replication delay of the underlying replicas byadding new replicas when necessary. It is also observedthat with more replicas added, the replication delay for theoverloaded replicas can dramatically drop. Moreover, it ismore cost-effective in comparison to the over-provisioningapproach for the number of database replicas that can ensurelow replication delay because it adds new replicas only whennecessary based on the application-defined SLA of data fresh-ness for the different underlying database replicas.VIII. PROVISIONING THE DATABASE TIER BASED ON SLA

OF TRANSACTION RESPONSE TIMES

Another consumer-centric SLA metric that we considerin our framework is the total execution times of database

transactions (response time). In practice, this metric has agreat impact on the user experience and thus satisfaction ofthe underlying services. In other words, individual users aregenerally more concerned about when their transaction willcomplete rather than how many transactions the system willbe able to execute in a second (system throughput) [22].To illustrate, assuming a transaction (T ) with an associatedSLA for its execution time (S) is presented to the systemat time 0, if the system is able to finish the execution ofthe transaction at time (t ≤ S) then the service provider hasachieved his target otherwise if (t > S) then the transactionresponse cannot be delivered within the defined SLA andhence a penalty p is incurred. In practice, the SLA require-ments can vary between the different types of applicationtransactions (for example, a login application request mayhave an SLA of 100 ms execution time, a search requestmay have an SLA of 600 ms while a request of submittingan order information would have 1500 ms). Obviously, thevariations in the SLA of different applications transactionsis due to their different natures and their differences in theconsumption behaviour of system resources (e.g. disk I/O,CPU time). In practice, each application transaction can sendone or more operations to the underlying database system.Therefore, in our framework, consumer applications can defineeach transaction as pattern(s) of SQL commands where the

13

00:0500:0500:1000:1500:2000:2500:3000:3500:4000:4500:5000:5501:00

70

75

80

85

90

95

100

SLA

Satis

fact

ion

(%)

Time

R1

R2

R3

R4

(a) Workload: 80/20 ((r/w)

00:05 00:10 00:15 00:20 00:25 00:30 00:35 00:40 00:45 00:50 00:55 01:00

70

75

80

85

90

95

100

SLA

Satis

fact

ion

(%)

Time

R1

R2

R3

R4

(b) Workload: 50/50 ((r/w)

Fig. 10: Comparison of SLA-Based vs Resource-Based Database Provisioning Rules

transaction execution time is computed as the total executiontime of these individual operations in the described pattern.Thus, the monitoring module is responsible for correlatingthe received database operations based on their sender inorder to detect the transaction patterns [28]. Our frameworkalso enables the consumer application to declaratively defineapplication-specific action rules to adaptively scale out or scalein according to the monitored status of the response timesof application transactions. For example, an application candefine to scale out the underlying database tier if the averagepercentage of SLA violation for transactions T1 and T2 ex-ceeds 10% (of the total number of T1 and T2 transactions)for a continuous period of more than 8 minutes. Similarly,the application can define to scale in the database tier if theaverage percentage of SLA violation for transactions T1 andT2 is less than 2% for a continuous period that is more than8 minutes and the average number of concurrent users perdatabase replica is less than 25.

We conducted our experiments with 4 different rules forachieving elasticity and dynamic provisioning for the databasetier in the cloud. Two rules are defined based on the averageCPU utilization of allocated virtual machines for the databaseserver as follows: Scale out the database tier (add one morereplica) when the average CPU utilization of the virtualmachines exceeds of 75% for (R1) and 85% for (R2) overa continuous period of 5 minutes. Two other rules are definedbased on the percentage of the SLA satisfaction of the work-load transactions (the SLA values of the different transactionsare defined as specified in the Cloudstone benchmark) asfollows: Scale out the database tier when the percentage ofSLA satisfaction is less than 97% for (R3) and 90% for (R4)over a continuous period of 5 minutes. Our evaluation metricsare the overall percentage of SLA satisfaction and the numberof provisioned database replicas during the experimental time.

Figure 10 illustrates the results of running our experimentsover a period of one hour for the 80/20 workload (Figure 10a)and the 50/50 workload (Figure 10b). In these figures, theX-axis represents the elapsed time of the experiment whilethe Y-axis represents the SLA salification of the applicationworkload according to the different elasticity rules. In general,we see that, even for this relatively small deployment, SLA-based can show improved overall SLA satisfaction of differentworkloads of the application. The results show that the SLA-based rules (R3 and R4) are, by design, more sensitive for

Workload / Rule R1 R2 R3 R480/20 4 3 5 550/50 5 4 7 6

TABLE II: Number of Provisioned Database Replicas

achieving the SLA satisfaction and thus they react earlier thanthe resource-based rules. The resource-based rules (R1 andR2) can accept a longer period SLA violations before takingany necessary action (CPU utilization reaches the definedlimit). The benefits of SLA-based rules become clear withthe workload increase (increasing the number of users duringthe experiment time). The gap between the SLA-based rulesand SLA-based rules is smaller for the workload with thehigher write ratio (50/50) due to the higher contention of CPUresources for the write operations and thus the conditions ofthe resource-based rules can be satisfied earlier.

Table II shows the total number of provisioned databasereplicas using the different elasticity rules for the two differentworkloads. Clearly, while the SLA-based rules achieves betterSLA satisfaction, they may also provision more database repli-cas. This trade-off shows that there is no clear winner betweenthe two approaches and we can not favour one approachover the other. However, the declarative SLA-based approachempowers the cloud consumer with a more convenient andflexible mechanism for controlling and achieving their policiesin dynamic environments such as the Cloud.

IX. RELATED WORK

Several approaches have been proposed for dynamic pro-visioning of computing resources based on their effectiveutilization [29], [30], [31]. These approaches are mainlygeared towards the perspective of cloud providers. Wood et.al. [29] have presented an approach for dynamic provisioningof virtual machines. They define a unique metric based onthe data consumption of the three physical computing re-sources: CPU, network and memory to make the provisioningdecision. Padala et.al. [31] carried out black box profilingof the applications and built an approximated model whichrelates performance attributes such as the response time tothe fraction of processor allocated to the virtual machineon which the application is running. Dolly [14] is a virtualmachine cloning technique to spawn database replicas andprovisioning shared-nothing replicated databases in the cloud.The technique proposes database provisioning cost models

14

to adapt the provisioning policy to the low-level cloud re-sources according to the application requirements. Rogers etal. [32] proposed two approaches for managing the resourceprovisioning challenge for cloud databases. The Black-boxprovisioning uses end-to-end performance results of samplequery executions, whereas white-box provisioning uses afiner grained approach that relies on the DBMS optimizerto predict the physical resource (e.g., I/O, memory, CPU)consumption for each query. Floratou et al. [33] have studiedthe performance and cost in the relational database as a serviceenvironments. The results show that given a range of pricingmodels and the flexibility of the allocation of resources incloud-based environments, it is hard for a user to figure outtheir actual monthly cost upfront. Soror et al. [13] introduceda virtualization design advisor that uses information aboutthe database workloads to provide offline recommendationsof workload-specific virtual machines configurations. To thebest of our knowledge, our approach is the first that tacklethe problem of dynamic provisioning the cloud resources ofthe database tier based on consumer-centric and application-defined SLA metrics.

A common feature to the different cloud offerings of theplatform storage services and the relational database ser-vices is the creation and management of multiple replicasof the stored data while a replication architecture is runningbehind-the-scenes to enable automatic failover managementand ensure high availability of the service. In general, repli-cating for performance differs significantly from replicatingfor availability or fault tolerance. The distinction between thetwo situations is mainly reflected by the higher degree ofreplication, and as a consequence the need for supportingweak consistency when scalability is the motivating factorfor replication.In addition, the platform storage layer andthe relational database as a service are mainly designed formulti-tenancy environments and they are more centric to theperspective of the cloud provider. Therefore, they do notprovide support for any flexible mechanisms for scaling asingle-tenant system (consumer perspective).

X. CONCLUSIONS

In this paper, we presented the design and implementationdetails10 of an end-to-end framework that facilitates adaptiveand dynamic provisioning of the database tier of the softwareapplications based on consumer-centric policies for satisfyingtheir own SLA performance requirements, avoiding the costof any SLA violation and controlling the monetary cost ofthe allocated computing resources. The framework providesthe consumer applications with declarative and flexible mecha-nisms for defining their specific requirements for fine-granularSLA metrics at the application level. The framework isdatabase platform-agnostic, uses virtualization-based databasereplication mechanisms and requires zero source code changesof the cloud-hosted software applications.

REFERENCES

[1] M. Armbrust and al., “Above the Clouds: A Berkeley View of CloudComputing,” University of California, Berkeley, Tech. Rep. UCB/EECS-2009-28, 2009.

10http://cdbslaautoadmin.sourceforge.net/

[2] J. Schad, J. Dittrich, and J.-A. Quiane-Ruiz, “Runtime Measurementsin the Cloud: Observing, Analyzing, and Reducing Variance,” PVLDB,vol. 3, no. 1, 2010.

[3] B. F. Cooper, A. Silberstein, E. Tam, R. Ramakrishnan, and R. Sears,“Benchmarking cloud serving systems with YCSB,” in SoCC, 2010.

[4] B. Suleiman, S. Sakr, R. Jeffrey, and A. Liu, “On understanding theeconomics and elasticity challenges of deploying business applicationson public cloud infrastructure,” Internet Services and Applications, 2012.

[5] S. Sakr, A. Liu, D. M. Batista, and M. Alomari, “A survey of large scaledata management approaches in cloud environments,” IEEE Communi-cations Surveys and Tutorials, vol. 13, no. 3, 2011.

[6] W. Vogels, “Eventually consistent,” Queue, vol. 6, pp. 14–19, October2008. [Online]. Available: http://doi.acm.org/10.1145/1466443.1466448

[7] R. Cattell, “Scalable sql and nosql data stores,” SIGMOD Record,vol. 39, no. 4, 2010.

[8] H. Wada, A. Fekete, L. Zhao, K. Lee, and A. Liu, “Data ConsistencyProperties and the Trade-offs in Commercial Cloud Storage: the Con-sumers’ Perspective,” in CIDR, 2011.

[9] D. Bermbach and S. Tai, “Eventual consistency: How soon is eventual?”in MW4SOC, 2011.

[10] D. J. Abadi, “Data management in the cloud: Limitations and opportu-nities,” IEEE Data Eng. Bull., vol. 32, no. 1, 2009.

[11] D. Agrawal and al., “Database Management as a Service: Challengesand Opportunities,” in ICDE, 2009.

[12] S. Sakr, L. Zhao, H. Wada, and A. Liu, “CloudDB AutoAdmin: Towardsa Truly Elastic Cloud-Based Data Store,” in ICWS, 2011.

[13] A. A. Soror, U. F. Minhas, A. Aboulnaga, K. Salem, P. Kokosielis,and S. Kamath, “Automatic virtual machine configuration for databaseworkloads,” in SIGMOD Conference, 2008.

[14] E. Cecchet, R. Singh, U. Sharma, and P. J. Shenoy, “Dolly:virtualization-driven database provisioning for the cloud,” in VEE, 2011.

[15] P. Bodık, A. Fox, M. Franklin, M. Jordan, and D. Patterson, “Character-izing, modeling, and generating workload spikes for stateful services,”in SoCC, 2010.

[16] D. Durkee, “Why cloud computing will never be free,” Commun. ACM,vol. 53, no. 5, 2010.

[17] T. Ristenpart, E. Tromer, H. Shacham, and S. Savage, “Hey, you, getoff of my cloud: exploring information leakage in third-party computeclouds,” in ACM Conference on Computer and Communications Secu-rity, 2009.

[18] C. Plattner and G. Alonso, “Ganymed: Scalable Replication for Trans-actional Web Applications,” in Middleware, 2004.

[19] A. Elmore and al., “Zephyr: live migration in shared nothing databasesfor elastic cloud platforms,” in SIGMOD, 2011.

[20] Y. Wu and M. Zhao, “Performance modeling of virtual machine livemigration,” in IEEE CLOUD, 2011.

[21] E. Brewer, “Towards robust distributed systems,” in PODC, 2000.[22] D. Florescu and D. Kossmann, “Rethinking cost and performance of

database systems,” SIGMOD Record, vol. 38, no. 1, 2009.[23] T. Kraska and al., “Consistency Rationing in the Cloud: Pay only when

it matters,” PVLDB, vol. 2, no. 1, 2009.[24] K. Keeton, C. B. M. III, C. A. N. Soules, and A. C. Veitch, “LazyBase:

freshness vs. performance in information management,” Operating Sys-tems Review, vol. 44, no. 1, 2010.

[25] L. Zhao, S. Sakr, A. Fekete, H. Wada, and A. Liu, “Application-managed database replication on virtualized cloud environments,” inICDE Workshops, 2012.

[26] W. Sobel, S. Subramanyam, A. Sucharitakul, J. Nguyen, H. Wong,S. Patil, A. Fox, and D. Patterson, “Cloudstone: Multi-platform, multi-language benchmark and measurement tools for web 2.0,” in Proc. ofCloud Computing and Its Applications (CCA), 2008.

[27] L. Zhao, S. Sakr, and A. Liu, “Application-managed replication con-troller for cloud-hosted databases,” in IEEE Cloud, 2012.

[28] S. Sakr and A. Liu, “SLA-Based and Consumer-Centric DynamicProvisioning for Cloud Databases,” in IEEE Cloud, 2012.

[29] T. Wood, P. J. Shenoy, A. Venkataramani, and M. S. Yousif, “Black-boxand gray-box strategies for virtual machine migration,” in NSDI, 2007.

[30] S. Cunha, J. M. Almeida, V. Almeida, and M. Santos, “Self-adaptivecapacity management for multi-tier virtualized environments,” in Inte-grated Network Management, 2007.

[31] P. Padala and al., “Adaptive control of virtualized resources in utilitycomputing environments,” in EuroSys, 2007.

[32] J. Rogers, O. Papaemmanouil, and U. Cetintemel, “A generic auto-provisioning framework for cloud databases,” in ICDE Workshops, 2010.

[33] A. Floratou and al., “When free is not really free: What does it cost torun a database workload in the cloud?” in TPCTC, 2011.

A framework for consumer centric sla management of cloud hosted databases

Education

hosted applications

cloud databases

number of cloud

cloud computing paradigm

cloud services

cloud computing simplies

slabased management

number of applications