Scheduling of composite Web Services

9Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Composite Web Services (CWS) aggregate multiple Web Services (WS) in one logical unit to accomplish a complex task (e.g. business process). This aggregation is achieved by defining a workflow that orchestrates the underlying Web Services in a manner consistent with the desired functionality. Since CWS can aggregate atomic WS and/or other CWS they foster the development of service layers and reuse of already existing functionality. An important issue in the deployment of services is their run-time performance under various loads. Due to the complex interactions of the underlying services, a CWS they can exhibit problematic and often difficult to predict behaviours in overload situations. This paper focuses on the use of request scheduling for improving CWS performance in overload situations. Different scheduling policies are investigated in regards to their effectiveness in helping with bulk arrivals. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Dyachuk, D., & Deters, R. (2006). Scheduling of composite Web Services. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4277 LNCS-I, pp. 19–20). Springer Verlag. https://doi.org/10.1007/11915034_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free