Trust evaluation in composite services selection and discovery

Lei Li; Yan Wang

doi:10.1109/SCC.2009.70

Trust evaluation in composite services selection and discovery

Lei Li^*, Yan Wang

^*Corresponding author for this work

School of Computing

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

26 Citations (Scopus)

37 Downloads (Pure)

Abstract

In Serviced-Oriented Computing (SOC) environments, the trust level of a service or a service provider is a critical issue for a service client to consider, particularly when the client is looking for a service from a large set of services or service providers. However, a service may invoke other services offered by different providers forming composite services. The complex invocation relations significantly increase the complexity of trust evaluation in composite services. In this paper, we propose a novel algorithm for trust evaluation in composite services that takes all atomic invocations into account, which is essential for composite services selection and discovery.

Original language	English
Title of host publication	SCC 2009 - 2009 IEEE International Conference on Services Computing
Place of Publication	Los Alamitos, CA, USA
Publisher	Institute of Electrical and Electronics Engineers (IEEE)
Pages	482-485
Number of pages	4
ISBN (Print)	9780769538112
DOIs	https://doi.org/10.1109/SCC.2009.70
Publication status	Published - 2009
Event	SCC 2009 - 2009 IEEE International Conference on Services Computing - Bangalore, India Duration: 21 Sept 2009 → 25 Sept 2009

Other

Other	SCC 2009 - 2009 IEEE International Conference on Services Computing
Country/Territory	India
City	Bangalore
Period	21/09/09 → 25/09/09

Bibliographical note

Copyright 2009 IEEE. Reprinted from 2009 IEEE International Conference on Services Computing : proceedings, Bangalore, India, 21-25 September 2009. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Macquarie Universityâ€™s products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

Access to Document

10.1109/SCC.2009.70

Publisher version (open access).pdfFinal published version, 293 KB

Cite this

@inproceedings{f26f7f128dc948b5b983d96e60d992f3,

title = "Trust evaluation in composite services selection and discovery",

abstract = "In Serviced-Oriented Computing (SOC) environments, the trust level of a service or a service provider is a critical issue for a service client to consider, particularly when the client is looking for a service from a large set of services or service providers. However, a service may invoke other services offered by different providers forming composite services. The complex invocation relations significantly increase the complexity of trust evaluation in composite services. In this paper, we propose a novel algorithm for trust evaluation in composite services that takes all atomic invocations into account, which is essential for composite services selection and discovery.",

author = "Lei Li and Yan Wang",

note = "Copyright 2009 IEEE. Reprinted from 2009 IEEE International Conference on Services Computing : proceedings, Bangalore, India, 21-25 September 2009. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Macquarie University{\^a}€{\texttrademark}s products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.; SCC 2009 - 2009 IEEE International Conference on Services Computing ; Conference date: 21-09-2009 Through 25-09-2009",

year = "2009",

doi = "10.1109/SCC.2009.70",

language = "English",

isbn = "9780769538112",

pages = "482--485",

booktitle = "SCC 2009 - 2009 IEEE International Conference on Services Computing",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

address = "United States",

}

Li, L & Wang, Y 2009, Trust evaluation in composite services selection and discovery. in SCC 2009 - 2009 IEEE International Conference on Services Computing., 5283918, Institute of Electrical and Electronics Engineers (IEEE), Los Alamitos, CA, USA, pp. 482-485, SCC 2009 - 2009 IEEE International Conference on Services Computing, Bangalore, India, 21/09/09. https://doi.org/10.1109/SCC.2009.70

Trust evaluation in composite services selection and discovery. / Li, Lei; Wang, Yan.
SCC 2009 - 2009 IEEE International Conference on Services Computing. Los Alamitos, CA, USA: Institute of Electrical and Electronics Engineers (IEEE), 2009. p. 482-485 5283918.

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - Trust evaluation in composite services selection and discovery

AU - Li, Lei

AU - Wang, Yan

N1 - Copyright 2009 IEEE. Reprinted from 2009 IEEE International Conference on Services Computing : proceedings, Bangalore, India, 21-25 September 2009. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Macquarie Universityâ€™s products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

PY - 2009

Y1 - 2009

N2 - In Serviced-Oriented Computing (SOC) environments, the trust level of a service or a service provider is a critical issue for a service client to consider, particularly when the client is looking for a service from a large set of services or service providers. However, a service may invoke other services offered by different providers forming composite services. The complex invocation relations significantly increase the complexity of trust evaluation in composite services. In this paper, we propose a novel algorithm for trust evaluation in composite services that takes all atomic invocations into account, which is essential for composite services selection and discovery.

AB - In Serviced-Oriented Computing (SOC) environments, the trust level of a service or a service provider is a critical issue for a service client to consider, particularly when the client is looking for a service from a large set of services or service providers. However, a service may invoke other services offered by different providers forming composite services. The complex invocation relations significantly increase the complexity of trust evaluation in composite services. In this paper, we propose a novel algorithm for trust evaluation in composite services that takes all atomic invocations into account, which is essential for composite services selection and discovery.

UR - https://www.scopus.com/pages/publications/74049146699

U2 - 10.1109/SCC.2009.70

DO - 10.1109/SCC.2009.70

M3 - Conference proceeding contribution

AN - SCOPUS:74049146699

SN - 9780769538112

SP - 482

EP - 485

BT - SCC 2009 - 2009 IEEE International Conference on Services Computing

PB - Institute of Electrical and Electronics Engineers (IEEE)

CY - Los Alamitos, CA, USA

T2 - SCC 2009 - 2009 IEEE International Conference on Services Computing

Y2 - 21 September 2009 through 25 September 2009

ER -

Trust evaluation in composite services selection and discovery

Abstract

Other

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this