On-line change detection for resource allocation in service-oriented systems

7Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, an on-line change detection algorithm for resource allocation in service-oriented systems is presented. The change detection is made basing on a dissimilarity measure between two estimated probability distributions. In our approach we take advantage of the fact that streams of requests in service-oriented systems can be modeled by non-homogenous Poisson processes. Thus, for Bhattacharyya distance measure and Kullback-Leibler divergence analytical expressions can be given. At the end of the paper a simulation study is presented. The aim of the simulation is to demonstrate an effect of applying adaptive approach in resource allocation problem. © 2012 IFIP International Federation for Information Processing.

Cite

CITATION STYLE

APA

Tomczak, J. M. (2012). On-line change detection for resource allocation in service-oriented systems. In IFIP Advances in Information and Communication Technology (Vol. 372 AICT, pp. 51–58). https://doi.org/10.1007/978-3-642-28255-3_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free