A Distributed Algorithm for Service Commitment in Allocating Services to Applications

In this paper, we extend our previous work on committing service instances to the applications in a service-oriented environment, and we propose a distributed heuristic algorithm which is able to estimate the number of future service instances needed by each application instance in a future time. Also, this algorithm does not assume any specific type of distribution function for services execution time and applications interarrival time. In this paper, after presenting the mathematical basis for the proposed distributed algorithm, we explain how this algorithm can be implemented in a distributed environment, and through the simulations and performance comparisons, we show that the proposed algorithm improves the performance of the system significantly, compared to a No commitment policy system and a full commitment policy system.