1 / 8

TCSS 559 Web Services Article Summary for Week Three

TCSS 559 Web Services Article Summary for Week Three. Qianhui Althea Liang, Stanley Y W Su. (2005).  AND/OR Graph and Search Algorithm for Discovering Composite Web Services.  International Journal of Web Services Research Vol. 2. No. 4. pp. 48 -67. By Robert Bunge, Team #5, Engineer B

darci
Download Presentation

TCSS 559 Web Services Article Summary for Week Three

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. TCSS 559 Web ServicesArticle Summary for Week Three Qianhui Althea Liang, Stanley Y W Su. (2005).  AND/OR Graph and Search Algorithm for Discovering Composite Web Services.  International Journal of Web Services Research Vol. 2. No. 4. pp. 48 -67. By Robert Bunge, Team #5, Engineer B January 23, 2006

  2. Web Service Composition Simple Service Discovery: • Description (e.g. WSDL) • Discovery (e.g. UDDI) • Communication (e.g. SOAP)

  3. Web Service Composition Composite Service Construction: • Manual – WSFL, BPEL • Automatic – discovery agent • Semi-automatic – Intelligent Registry

  4. Service Dependency Graph “SDG shows input and output data relationships among service operations.”

  5. SDGs and AND/OR Graphs Required inputs connected by AND Optional input sources connected by OR Input/output edges can loop between nodes Dummy nodes added to facilitate calculations.

  6. Search Algorithm • “Bottom-up” • Finds complete and minimal solution • Finds minimal cost solution • Time complexity = X* log |V| • (x = iterations, |V| = nodes)

  7. Conclusion • Need more research on ontologies • Not many services available on UDDI • Testing done on services designed specifically for the test

More Related