loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
10th IEEE International Enterprise Distributed Object Computing Conference Workshops (EDOCW'06)
Web Services Selection and Composition based on the Routing Algorithm
Hong Kong, China
October 16-October 20
ISBN: 0-7695-2743-4
Yifei Wang, Southeast University, Nanjing 210096, China
Hongbing Wang, Southeast University, Nanjing 210096, China
Xun Xu, Southeast University, Nanjing 210096, China
In recent years, a growing number of Web services have emerged as the Internet develops at a fast rate. With the growing number of Web services, it is necessary to compose existing Web services dynamically. Selecting and composing individual Web services into more complicated and more useful Web processes is an important challenge. This paper model those composition processes as a graph problem. Based on the model, routing algorithms are discussed for static and dynamic services selection. Experiment is conducted based on the model and the algorithm.
Citation:
Yifei Wang, Hongbing Wang, Xun Xu, "Web Services Selection and Composition based on the Routing Algorithm," edocw, pp.69, 10th IEEE International Enterprise Distributed Object Computing Conference Workshops (EDOCW'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.