Scribd Logo
Upload

Welcome to Scribd!

  • An Effective and Scalable Web Service Composition Algorithm

    Uploaded by

    vishnupriya_bha
    18 views8 pages
    The document proposes a tree-based web service composition algorithm to aggregate various services into a larger course of action more effectively and at scale. It involves building an inverted index file of available web services and then constructing a web service composition tree using both backward and forward regression. The optimal path would be selected based on costs like execution time and response time. The algorithm aims to analyze and improve upon existing web service composition benchmarks.

    Original Description:

    Original Title

    Web Services

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document proposes a tree-based web service composition algorithm to aggregate various services into a larger course of action more effectively and at scale. It involves building an inverted index file of available web services and then constructing a web service composition tree using both backward and forward regression. The optimal path would be selected based on costs like execution time and response time. The algorithm aims to analyze and improve upon existing web service composition benchmarks.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as ppt, pdf, or txt
    18 views8 pages

    An Effective and Scalable Web Service Composition Algorithm

    Uploaded by

    vishnupriya_bha
    The document proposes a tree-based web service composition algorithm to aggregate various services into a larger course of action more effectively and at scale. It involves building an inverted index file of available web services and then constructing a web service composition tree using both backward and forward regression. The optimal path would be selected based on costs like execution time and response time. The algorithm aims to analyze and improve upon existing web service composition benchmarks.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as ppt, pdf, or txt
    of 8

    AN EFFECTIVE AND SCALABLE WEB SERVICE COMPOSITION ALGORITHM

    OBJECTIVE
    To design a tree based web service composition algorithm. To analyze and suggest several improvements to benchmark web service composition better.

    ABOUT WEB SERVICE COMPOSITION


    Aggregation of various services into a larger course of action is referred to as composition. When there are a large number of Web services available and no single Web service satisfies the given request, one has to compose multiple Web services to fulfill the goal.

    EXISTING WORK
    The existing works on web service composition includes: 1. A two step composition algorithm consisting of a forward search and a regressive composition . 2. A DuoParaInverted file is built based on the web services available. A web service composition tree is constructed each time a request is given. From the tree the path is selected.

    PROPOSED WORK
    The algorithm is based on the construction of DuoParaInverted file. Then a WSCT is constructed using both backward regression and forward regression. And finally finding the optimal path based on the cost (execution time, response time, throughput).

    Software Requirements
    Web Server : Sun Application Server Application Server : Axis 4.0 Database : MS Access Server Side Programming Language : Java Server Pages Programming Language : JAVA

    FURTHER ENCHANCEMENT
    Semantic matching can be employed for request analyses.

    REFERENCES
    Seog-Chan Oh, Dongwon Lee, Soundar R. T. Kumara, January-march 2007, Web Service Planner(WSPR): An Effective And Scalable Web Service Composition Algorithm, International Journal of Web Services Research,4(1), 1-23. Barbara Carminati, Elena Ferrari, Patrick C. K. Hung, 2006, Security Conscious Web Service Composition, IEEE International Conference on web Services(ICWS06). Macro BramBilla, Stefano Ceri, Sara Comai, Piero Fraternali, Ioana Manolescu Dip, 2006, Model-Driven Specification of Web Services Composition and Integration with Dataintensive Web Applications, Bulletin of the IEEE Computer Society Technical Committee on Data Engineering. Ethan Cerami,2002, Web Services Essentials, O,Reilly & Associates, Inc., Shroff Publishers & Distributers Pvt. Ltd.

    You might also like