Title :
Service Commitment Strategies in Allocating Services to Applications
Author :
Bannazadeh, Hadi ; Leon-Garcia, Alberto
Author_Institution :
Univ. of Toronto, Toronto
Abstract :
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.
Keywords :
Markov processes; business data processing; Markov decision process; business processes; full commitment policy; no commitment policy system; optimal policy; service commitment strategies; Application software; Collaboration; Computer architecture; Computer networks; Linear programming; Mashups; Middleware; Quality of service; Service oriented architecture; Web services; Composite Applications; Composition; Markov Decision Processes.; Service; Service-Oriented Architecture;
Conference_Titel :
Services Computing, 2007. SCC 2007. IEEE International Conference on
Conference_Location :
Salt Lake City, UT
Print_ISBN :
0-7695-2925-9
DOI :
10.1109/SCC.2007.98