13
OPTIMAL SERVICE PRICING OPTIMAL SERVICE PRICING FOR A CLOUD CACHE FOR A CLOUD CACHE

Final Review

  • Upload
    228218

  • View
    7

  • Download
    0

Embed Size (px)

DESCRIPTION

ppt

Citation preview

Page 1: Final Review

OPTIMAL SERVICE PRICING OPTIMAL SERVICE PRICING FOR A CLOUD CACHEFOR A CLOUD CACHE

Page 2: Final Review

ABSTRACT:ABSTRACT:

Cloud applications that offer data management services are Cloud applications that offer data management services are emerging. Such clouds support caching of data in order to emerging. Such clouds support caching of data in order to provide quality query services. The users can query the cloud provide quality query services. The users can query the cloud data, paying the price for the infrastructure they use. Cloud data, paying the price for the infrastructure they use. Cloud management necessitates an economy that manages the service management necessitates an economy that manages the service of multiple users in an efficient, but also, resource economic way of multiple users in an efficient, but also, resource economic way that allows for cloud profit. Naturally, the maximization of cloud that allows for cloud profit. Naturally, the maximization of cloud profit given some guarantees for user satisfaction presumes an profit given some guarantees for user satisfaction presumes an appropriate price-demand model that enables optimal pricing of appropriate price-demand model that enables optimal pricing of query services. The model should be plausible in that it reflects query services. The model should be plausible in that it reflects the correlation of cache structures involved in the queries. the correlation of cache structures involved in the queries. Optimal pricing is achieved based on a dynamic pricing scheme Optimal pricing is achieved based on a dynamic pricing scheme that adapts to time changes. This paper proposes a novel price-that adapts to time changes. This paper proposes a novel price-demand model designed for a cloud cache and a dynamic pricing demand model designed for a cloud cache and a dynamic pricing scheme for queries executed in the cloud cache. The pricing scheme for queries executed in the cloud cache. The pricing solution employs a novel method that estimates the correlations solution employs a novel method that estimates the correlations of the cache services in an time-efficient manner. The of the cache services in an time-efficient manner. The experimental study shows the efficiency of the solution experimental study shows the efficiency of the solution

Page 3: Final Review

EXISTING SYSTEM:EXISTING SYSTEM:

Existing clouds focus on the provision of web services Existing clouds focus on the provision of web services targeted to developers, such as Amazon Elastic Compute targeted to developers, such as Amazon Elastic Compute Cloud (EC2), or the deployment of servers, such as Go Grid. Cloud (EC2), or the deployment of servers, such as Go Grid. There are two major challenges when trying to define an There are two major challenges when trying to define an optimal pricing scheme for the cloud caching service. The optimal pricing scheme for the cloud caching service. The first is to define a simplified enough model of the price first is to define a simplified enough model of the price demand dependency, to achieve a feasible pricing solution, demand dependency, to achieve a feasible pricing solution, but not oversimplified model that is not representative. but not oversimplified model that is not representative.

A static pricing scheme cannot be optimal if the demand for A static pricing scheme cannot be optimal if the demand for services has deterministic seasonal fluctuations. The second services has deterministic seasonal fluctuations. The second challenge is to define a pricing scheme that is adaptable tochallenge is to define a pricing scheme that is adaptable to

(i) Modeling errors, (ii) time-dependent model changes, and (i) Modeling errors, (ii) time-dependent model changes, and (iii) stochastic behavior of the application. The demand for (iii) stochastic behavior of the application. The demand for services, for instance, may depend in a nonpredictable way services, for instance, may depend in a nonpredictable way on factors that are external to the cloud application, such as on factors that are external to the cloud application, such as socioeconomic situations.socioeconomic situations.

Page 4: Final Review

Disadvantage:Disadvantage:

A static pricing scheme cannot be A static pricing scheme cannot be optimal if the demand for services optimal if the demand for services has deterministic seasonal has deterministic seasonal fluctuations.fluctuations.

Static pricing results in an Static pricing results in an unpredictable and, therefore, unpredictable and, therefore, uncontrollable behavior of profit.uncontrollable behavior of profit.

Page 5: Final Review

PROPOSED SYSTEMPROPOSED SYSTEM::

The cloud caching service can maximize its profit using an optimal The cloud caching service can maximize its profit using an optimal pricing scheme. Optimal pricing necessitates an appropriately pricing scheme. Optimal pricing necessitates an appropriately simplified price-demand model that incorporates the correlations of simplified price-demand model that incorporates the correlations of structures in the cache services. The pricing scheme should be structures in the cache services. The pricing scheme should be adaptable to time changes.adaptable to time changes.

Price adaptivity to time changes:Price adaptivity to time changes: Profit maximization is pursued in a finite long-term horizon. The Profit maximization is pursued in a finite long-term horizon. The

horizon includes sequential non-overlapping intervals that allow for horizon includes sequential non-overlapping intervals that allow for scheduling structure availability. At the beginning of each interval, scheduling structure availability. At the beginning of each interval, the cloud redefines availability by taking offlinethe cloud redefines availability by taking offline

some of the currently available structures and taking online some some of the currently available structures and taking online some of the unavailable ones. Pricing optimization proceeds in iterations of the unavailable ones. Pricing optimization proceeds in iterations on a sliding time-window that allows online corrections on the on a sliding time-window that allows online corrections on the predicted demand, via re-injection of the real demand values at predicted demand, via re-injection of the real demand values at each sliding instant. Also, theeach sliding instant. Also, the

iterative optimization allows for re-definition of the parameters in iterative optimization allows for re-definition of the parameters in the price-demand model, if the demand deviates substantially from the price-demand model, if the demand deviates substantially from the predicted.the predicted.

Page 6: Final Review

Advantage:Advantage:

A novel demand-pricing model designed for cloud A novel demand-pricing model designed for cloud caching services and the problem formulation for the caching services and the problem formulation for the dynamic pricing scheme that maximizes profit and dynamic pricing scheme that maximizes profit and incorporates the objective for user satisfaction.incorporates the objective for user satisfaction.

An efficient solution to the pricing problem, based on An efficient solution to the pricing problem, based on non-linear programming, adaptable to time changes.non-linear programming, adaptable to time changes.

A correlation measure for cache structures that is A correlation measure for cache structures that is suitable for the cloud cache pricing scheme and a suitable for the cloud cache pricing scheme and a method for its efficient computation.method for its efficient computation.

An experimental study which shows that the dynamic An experimental study which shows that the dynamic pricing scheme out-performs any static one by pricing scheme out-performs any static one by achieving 2 orders of magnitude more profit per time achieving 2 orders of magnitude more profit per time unit.unit.

Page 7: Final Review

Hardware Requirements:Hardware Requirements:

SystemSystem : Pentium IV 2.4 : Pentium IV 2.4 GHz.GHz.

Hard Disk Hard Disk : 40 GB.: 40 GB. Floppy DriveFloppy Drive : 1.44 Mb.: 1.44 Mb. MonitorMonitor : 15 VGA Colour.: 15 VGA Colour. MouseMouse : Logitech.: Logitech. RamRam : 512 Mb.: 512 Mb.

Page 8: Final Review

Software Requirements:Software Requirements:

Operating system Operating system : : Windows XP.Windows XP.

Coding LanguageCoding Language : ASP.Net : ASP.Net with C#with C#

Data BaseData Base : SQL : SQL Server 2005Server 2005

Page 9: Final Review

ALGORITHM:ALGORITHM: GlobalGlobal: cache structures : cache structures SS, prices , prices PP, availability Δ, availability Δ Query Execution Query Execution ( )( ) if if q q can be satisfied in the cache can be satisfied in the cache thenthen (result, cost)←runQueryInCache (q)(result, cost)←runQueryInCache (q) elseelse (result, cost)←runQueryInBackend (q)(result, cost)←runQueryInBackend (q) end ifend if SS←addNewStructures ()←addNewStructures () return return result, costresult, cost optimalPricing optimalPricing (horizon (horizon TT, intervals , intervals tt[[ii], ], SS)) (Δ,(Δ,PP)←determineAvailability&Prices (T, t,S))←determineAvailability&Prices (T, t,S) return return Δ,Δ,PP main main ()() execute in parallel tasks T1 and T2:execute in parallel tasks T1 and T2: T1:T1: for for every new every new i i dodo slide the optimization windowslide the optimization window OptimalPricin (OptimalPricin (TT, , tt[[ii],], S S)) end forend for T2:T2: While While new query new query q q dodo (Result, cost)←query Execution (q)(Result, cost)←query Execution (q) end whileend while if if q q executed in cache executed in cache thenthen Charge Charge cost cost to userto user elseelse Calculate total price and charge price to userCalculate total price and charge price to user end ifend if

Page 10: Final Review

Query Execution:Query Execution:

The cloud cache is a full-fledged DBMS along with a The cloud cache is a full-fledged DBMS along with a cache of data that reside permanently in back-end cache of data that reside permanently in back-end databases. The goal of the cloud cache is to offer databases. The goal of the cloud cache is to offer cheap efficient multi-user querying on the back-end cheap efficient multi-user querying on the back-end data, while keeping the cloud provider profitable. data, while keeping the cloud provider profitable. Service of queries is performed by executing them Service of queries is performed by executing them either in the cloud cache or in the back-end database. either in the cloud cache or in the back-end database. Query performance is measured in terms of execution Query performance is measured in terms of execution time. The faster the execution, the more data time. The faster the execution, the more data structures it employs, and therefore, the more structures it employs, and therefore, the more expensive the service. We assume that the cloud expensive the service. We assume that the cloud infrastructure provides sufficient amount of storage infrastructure provides sufficient amount of storage space for a large number of cache structures. Each space for a large number of cache structures. Each cache structure has a building and a maintenance cost.cache structure has a building and a maintenance cost.

Page 11: Final Review

Optimal Pricing:Optimal Pricing:

We assume that each structure is built from We assume that each structure is built from scratch in the cloud cache, as the cloud may not scratch in the cloud cache, as the cloud may not have administration rights on existing back-end have administration rights on existing back-end structures. Nevertheless, cheap computing and structures. Nevertheless, cheap computing and parallelism on cloud infrastructure may benefit parallelism on cloud infrastructure may benefit the performance of structure creation. For a the performance of structure creation. For a column, the building cost is the cost of column, the building cost is the cost of transferring it from the backendtransferring it from the backend and combining it and combining it with the currently cached columns. This cost may with the currently cached columns. This cost may contain the cost of nte grating the column in the contain the cost of nte grating the column in the existing cache table. For indexes, the building existing cache table. For indexes, the building cost involves fetching the data across the Internet cost involves fetching the data across the Internet and then building the index in the cache.and then building the index in the cache.

Page 12: Final Review

Conti..Conti..

Since sorting is the most important step in Since sorting is the most important step in building an index, the cost of building an index is building an index, the cost of building an index is approximated to the cost of sorting the indexed approximated to the cost of sorting the indexed columns. In case of multiple cloud databases, the columns. In case of multiple cloud databases, the cost of data movement is incorporated in the cost of data movement is incorporated in the building cost. The maintenance cost of a column building cost. The maintenance cost of a column or an index is just the cost of using disk space in or an index is just the cost of using disk space in the cloud. Hence, building a column or an index in the cloud. Hence, building a column or an index in the cache has a one-time static cost, whereas the cache has a one-time static cost, whereas their maintenance yields a storage cost that is their maintenance yields a storage cost that is linear with time.linear with time.

Page 13: Final Review

REFERENCE:REFERENCE:

Varena Kantere, Debabrata Dash, Varena Kantere, Debabrata Dash, Gregory Francois, Sofia Kyriakopolou Gregory Francois, Sofia Kyriakopolou an dAnastasia Ailmaki, “Optimal an dAnastasia Ailmaki, “Optimal Service Pricing for a Cloud Cache”, Service Pricing for a Cloud Cache”, IEEE Transactions on Knowledge IEEE Transactions on Knowledge and Data Engineering, Vol. 23, and Data Engineering, Vol. 23, No.9, September 2011.No.9, September 2011.