July 7, 2008 to July 11, 2008
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SCC.2008.117
Specifying and monitoring Service Level Agreements (SLA) has been the subject of intensive research. However, methods of enforcing SLA have not addressed the specific issues of Composite Services (CS). Our work focuses on the problem of keeping prearranged SLAs for service workflows including workflows supporting long lived transactions (e.g. WS-BA). As a solution we offer scheduling of component service requests. The latter is based on regaining control over legacy services by means of transparent proxies and later scheduling of their invocations. Various heuristics based policies are evaluated under two different types of Service Level Agreements. The policies vary from the simpler, operating only on the base of business value, to the more complex which also consider Quality of Service requirements, topologies of workflows, utilization of components services, etc. The experiments conducted over the model, which precisely captures the behavior of web services, reveal the benefits of providing schedulers with various types of context.
Web Services, workflows, transactional workflows, scheduling, Service Level Agreements, Lawlers algorithm, deadline decomposition, static scheduling, Quality of Service
Dmytro Dyachuk, Ralph Deters, "Ensuring Service Level Agreements for Service Workflows", SCC, 2008, 2013 IEEE International Conference on Services Computing, 2013 IEEE International Conference on Services Computing 2008, pp. 333-340, doi:10.1109/SCC.2008.117