The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007) (2007)
Tsukuba Science City, Japan
Dec. 11, 2007 to Dec. 14, 2007
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/APSCC.2007.29
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 algo- rithm 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 ap- plications interarrival time. In this paper, after presenting the mathematical basis for the proposed distributed algo- rithm, 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 signifi- cantly, compared to a No Commitment Policy System and a Full Commitment Policy system. Keywords--Service-Oriented Architecture, Service Composi- tion, Composite Applications
A. Leon-Garcia and H. Bannazadeh, "A Distributed Algorithm for Service Commitment in Allocating Services to Applications," The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007)(APSCC), Tsukuba Science City, Japan, 2007, pp. 446-453.