Related Experiment Videos
SLA-constrained service selection for minimizing costs of providing composite cloud services under stochastic runtime
Kuo-Chan Huang1, Mu-Jung Tsai1, Sin-Ji Lu1
1Department of Computer Science, National Taichung University of Education, No. 140, Min-Shen Road, Taichung, Taiwan.
Abstract:
Composite cloud services based on the methodologies of Software as a Service and Service-Oriented Architecture are transforming how people develop and use software. Cloud service providers are confronting the service selection problem when composing composite cloud services. This paper deals with an important type of service selection problem, minimizing the total cost of providing a composite cloud service with respect to the constraints of service level agreement (SLA). Two types of SLA are considered in the study: per-request-based SLA and ratio-based SLA. We present three service selection approaches for dynamic cloud environments where services' performance might vary with time. The first two are iterative compound approaches for per-request-based SLA and the third approach is a one-step method for ratio-based SLA based on the Chebyshev's theorem and nonlinear programming. Experimental results show that our approaches outperform the previous method significantly in terms of total cost reduction.
Related Concept Videos
Distributed Loads: Problem Solving
Constraints and Statical Determinacy
Elasticity in Concrete
Distributed Loads
For example, consider a bookshelf filled with books stacked vertically adjacent to each other. The weight of the books is evenly distributed over the length of the shelf. As a result, the pressure at different locations on the surface of the...
Statically Indeterminate Problem Solving
Maximum Power Flow and Line Loadability