Setup algorithm of web service composition

Authors:
YanPing Yang;QingPing Tan;Yong Xiao
Affiliations:
Computer College of National University of Defense Technology, Changsha, Hunan, P.R. China;Computer College of National University of Defense Technology, Changsha, Hunan, P.R. China;PDL Laboratory of National University of Defense Technology, Changsha, Hunan, P.R. China
Venue:
ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
Year:
2005

Citing 4
Cited 1

Practical performance of Bloom filters and parallel free-text searching

Communications of the ACM
Space/time trade-offs in hash coding with allowable errors

Communications of the ACM
DAML-S: Web Service Description for the Semantic Web

ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
Artificial Intelligence: A Modern Approach

Artificial Intelligence: A Modern Approach

Transformation-Driven development of composite web services

ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A number of web services are now available and it therefore seems natural to reuse existing web services to create composite web services. The pivotal problems of web services composition are how to model the input and output data dependency of candidate web services and how to satisfy that of a service request by composition efficiently. In this paper we present the concept of “invocation layer” based on data dependency between web services invocation and design the algorithms to get the least invocation layers of candidate web services satisfying the given service request.