loading...
Service Commitment Strategies in Allocating Services to Applications
Salt Lake City, Utah, USA July 09-July 13
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SCC.2007.98IEEE International Conference on Serv ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Hadi Bannazadeh, University of Toronto
Alberto Leon-Garcia, University of Toronto
In this paper, the problem of commitment in allocating services to different applications and business processes is introduced. We model the problem based on the assumption that the services? instances are not put on hold throughout the lifetime of an application or a business process. Our objective is to find an optimal policy for committing services? instances to different applications to maximize the utilization of available instances of services. We formulate this problem and propose a Markov Decision Process approach for it. We present the optimal solution for a sample case with two types of services and two classes of application, and compare the performance of this optimal policy with a system with a Full Commitment Policy as well as a No Commitment Policy system. The comparison results show that the policy obtained outperforms the other two policies. We also evaluate the performance of a system considering beta distribution for the service execution time, and we illustrate the effectiveness of applying the obtained policy on this system as well.
Index Terms:
Service-Oriented Architecture, Service Composition, Composite Applications, Markov Decision Processes.
Citation:
Hadi Bannazadeh, Alberto Leon-Garcia, "Service Commitment Strategies in Allocating Services to Applications," scc, pp.91-97, IEEE International Conference on Services Computing (SCC 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.