scispace - formally typeset
Proceedings ArticleDOI

SLA-based resource allocation in cluster computing systems

TLDR
This paper presents an approach for computer resource allocation in such an environment that minimizes the total cost of computer resources used by a service provider for an e-business application while satisfying the quality of service (QoS) defined in an SLA.
Abstract
Resource allocation is a fundamental but challenging problem due to the complexity of cluster computing systems. In enterprise service computing, resource allocation is often associated with a service level agreement (SLA) which is a set of quality of services and a price agreed between a customer and a service provider. The SLA plays an important role in an e-business application. A service provider uses a set of computer resources to support e-business applications subject to an SLA. In this paper, we present an approach for computer resource allocation in such an environment that minimizes the total cost of computer resources used by a service provider for an e-business application while satisfying the quality of service (QoS) defined in an SLA. These QoS metrics include percentile response time, cluster utilization, packet loss rate and cluster availability. Simulation results show the applicability of the approach and validate its accuracy.

read more

Citations
More filters
Proceedings ArticleDOI

Service Performance and Analysis in Cloud Computing

TL;DR: In this paper, the authors present an approach for studying computer service performance in cloud computing, in an effort to deliver QoS guaranteed services in such a computing environment, they find the relationship among the maximal number of customers, the minimal service resources and the highest level of services.
Journal ArticleDOI

SLA-based admission control for a Software-as-a-Service provider in Cloud computing environments

TL;DR: An extensive evaluation study is conducted to analyse which solution suits best in which scenario to maximize SaaS [email protected]?s profit and shows that the proposed algorithms provide substantial improvement over reference ones across all ranges of variation in QoS parameters.
Journal ArticleDOI

Optimizing Cloud-Service Performance: Efficient Resource Provisioning via Optimal Workload Allocation

TL;DR: A stochastic multi-tenant framework is proposed to model the service of customer requests in a cloud infrastructure composed of heterogeneous virtual machines and a workload allocation algorithm, termed max-min-cloud algorithm, is devised to optimize the performance of the cloud service.
Posted Content

Ad hoc Cloud Computing

TL;DR: In this article, the authors present the first complete, integrated and end-to-end solution for ad hoc cloud computing environments, which is based on BOINC, and discuss the problems ad hoc Cloud Computing solves and outline their architecture.
Journal ArticleDOI

Profit and Penalty Aware Scheduling for Real-Time Online Services

TL;DR: The simulation results clearly demonstrate the advantages of the proposed algorithms, with respect to the system total accrued profit, over other commonly used scheduling algorithms, such as Earliest Deadline First (EDF) and Utility Accrual (UA) algorithms.
References
More filters
Book

Numerical Recipes in FORTRAN

TL;DR: The Diskette v 2.04, 3.5'' (720k) for IBM PC, PS/2 and compatibles [DOS] Reference Record created on 2004-09-07, modified on 2016-08-08.
Book

Queueing Systems. Volume 1: Theory

TL;DR: The purpose of this document is to summarize the main points of the book written by Leonard Kleinrock, titled, ‘Queueing Systems’, which is about queueing systems.
Proceedings ArticleDOI

Modeling TCP throughput: a simple model and its empirical validation

TL;DR: In this article, the authors developed a simple analytic characterization of the steady state throughput, as a function of loss rate and round trip time for a bulk transfer TCP flow, i.e., a flow with an unlimited amount of data to send.
Proceedings ArticleDOI

End-to-end Internet packet dynamics

TL;DR: The prevalence of unusual network events such as out-of-order delivery and packet corruption are characterized and a robust receiver-based algorithm for estimating "bottleneck bandwidth" is discussed that addresses deficiencies discovered in techniques based on "packet pair".
Journal ArticleDOI

Modeling TCP Reno performance: a simple model and its empirical validation

TL;DR: A simple analytic characterization of the steady-state send rate as a function of loss rate and round trip time for a bulk transfer TCP flow is developed and is able to more accurately predict TCP send rate and is accurate over a wider range of loss rates.
Related Papers (5)