• DocumentCode
    2297552
  • Title

    An Incremental Graph-based Approach to Automatic Service Composition

  • Author

    Shiaa, M.M. ; Fladmark, J.O. ; Thiell, Benoit

  • Author_Institution
    Dept. of Telematics, NTNU, Trondheim
  • Volume
    1
  • fYear
    2008
  • fDate
    7-11 July 2008
  • Firstpage
    397
  • Lastpage
    404
  • Abstract
    In the Service Oriented Architecture paradigm services are self-contained software units of functionality. Several services can be composed to assemble a composite service that provides an overall functionality. This process is called Service Composition. The automation of the service composition process aims at decreasing the human intervention during the service discovery, matching, ranking, filtering and reasoning about the resulting composition candidates. The paper presents an innovative approach to automatic service composition. The discovery and matchmaking is based on semantic annotations of service properties, e.g. their inputs, outputs and goals. The approach uses a graph-based search algorithm to determine all possible composition candidates and applies certain measures to rank them. Filtering and reasoning is accomplished by validating the composition candidates using goal-based expressions.
  • Keywords
    graph theory; search problems; software architecture; automatic service composition; graph-based search algorithm; incremental graph; service oriented architecture; Application software; Automata; Automation; Context-aware services; Filtering; Impedance matching; Logic; Ontologies; Service oriented architecture; Web services; Automatic Service Composition; Telecommunication services; Web services; graph algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Services Computing, 2008. SCC '08. IEEE International Conference on
  • Conference_Location
    Honolulu, HI
  • Print_ISBN
    978-0-7695-3283-7
  • Type

    conf

  • DOI
    10.1109/SCC.2008.141
  • Filename
    4578487