Probabilistic modelling
An admission control scheme for predictable server response time for web accesses
Proceedings of the 10th international conference on World Wide Web
On maximizing service-level-agreement profits
Proceedings of the 3rd ACM conference on Electronic Commerce
Managing energy and server resources in hosting centers
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Resource Allocation for Autonomic Data Centers using Analytic Performance Models
ICAC '05 Proceedings of the Second International Conference on Automatic Computing
Provisioning servers in the application tier for e-commerce systems
ACM Transactions on Internet Technology (TOIT)
Web Service Hosting and Revenue Maximization
ECOWS '07 Proceedings of the Fifth European Conference on Web Services
Dynamic resource allocation for shared data centers using online measurements
IWQoS'03 Proceedings of the 11th international conference on Quality of service
| Hi-index | 0.00 |
Customers submit streams of jobs of different types for execution at a service center. The number of jobs in each stream and the rate of their submission are specified. A service level agreement indicates the charge paid by the customer, the quality of service promised by the provider and the penalty to be paid by the latter if the QoS requirement is not met. To save energy, servers may be powered up and down dynamically. The objective is to maximize the revenues received while minimizing the penalties paid and the energy consumption costs of the servers used. To that end, heuristic policies are proposed for making decisions about stream admissions and server activation and deactivation. Those policies are motivated by queueing models. The results of several simulation experiments are described.