• DocumentCode
    3208469
  • Title

    Trust-Aware Component Service Selection Algorithm in Service Composition

  • Author

    Dai, Guiping ; Wang, Yong

  • Author_Institution
    Coll. of Electron. Inf. & Control Eng., Beijing Univ. of Technol., Beijing, China
  • fYear
    2009
  • fDate
    17-19 Dec. 2009
  • Firstpage
    613
  • Lastpage
    618
  • Abstract
    With trust degree set to be the foundation of component service selection in composite service, the execution and selection of composite services could be carried out more effectively based on the trust degree of service; It is favorable for those component services with higher trust degree to join into the process of service composition, thus, enhances the trustiness of composite service. Through introducing trust concept into service composition, two viewpoints of component service selection in composite service could be distinguished; this paper researches trust-aware component service selection problem based on these two viewpoints, establishes mathematical models of component service selection from these two viewpoints respectively, and then designs selection algorithm based on the ant colony system for viewpoint 2. Experiment results prove that the algorithms for trust-aware component service selection have a good optimizing performance.
  • Keywords
    Web services; quality of service; security of data; ant colony system; mathematical models; quality of service; trust concept; trust-aware component service selection algorithm; web service composition; web service trust degree; Algorithm design and analysis; Ant colony optimization; Availability; Computer science; Cost function; Delay; Educational institutions; Mathematical model; Ontologies; Quality of service; Ant Colony System; Service Composition; Trust; Web Service;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Frontier of Computer Science and Technology, 2009. FCST '09. Fourth International Conference on
  • Conference_Location
    Shanghai
  • Print_ISBN
    978-0-7695-3932-4
  • Electronic_ISBN
    978-1-4244-5467-9
  • Type

    conf

  • DOI
    10.1109/FCST.2009.41
  • Filename
    5392855