By Topic

A Method of Automatic Web Services Composition Based on Directed Graph

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Li Ying ; Sch. of Econ. & Manage., Harbin Eng. Univ., Harbin, China

Existed methods for automatic web services composition based on output parameters and input parameters matching relations of services are limited to linear or tree composition plan and malfunction to the netty plan because they ignore relations between services participating in composition. In order to overcome the shortcoming of the existed methods, a new method is proposed in this paper. In this method, services composition is modeled as a directed graph, and the maximal services composition graph is constructed first, then all the minimal composition graphs will be abstracted from the maximal one by the shared nodes in it. This method can deal with linear/tree/netty composition plan because it finds out not only all services participating in composition, but also all relations between services. All composition plans can be acquired for user to choose by using this method.

Published in:

Communications and Mobile Computing (CMC), 2010 International Conference on  (Volume:1 )

Date of Conference:

12-14 April 2010