| A trust management framework for service-oriented environments |
| Full text |
Pdf
(799 KB)
|
Source
|
International World Wide Web Conference
archive
Proceedings of the 18th international conference on World wide web
table of contents
Madrid, Spain
SESSION: Web engineering/session: service oriented development
table of contents
Pages 891-900
Year of Publication: 2009
ISBN:978-1-60558-487-4
|
|
Authors
|
|
William Conner
|
University of Illinois at Urbana-Champaign, Urbana, IL, USA
|
|
Arun Iyengar
|
IBM T. J. Watson Research Center, Yorktown Heights, NY, USA
|
|
Thomas Mikalsen
|
IBM T. J. Watson Research Center, Yorktown Heights, NY, USA
|
|
Isabelle Rouvellou
|
IBM T. J. Watson Research Center, Yorktown Heights, NY, USA
|
|
Klara Nahrstedt
|
University of Illinois at Urbana-Champaign, Urbana, IL, USA
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 53, Downloads (12 Months): 161, Citation Count: 0
|
|
|
ABSTRACT
Many reputation management systems have been developed under the assumption that each entity in the system will use a variant of the same scoring function. Much of the previous work in reputation management has focused on providing robustness and improving performance for a given reputation scheme. In this paper, we present a reputation-based trust management framework that supports the synthesis of trust-related feedback from many different entities while also providing each entity with the flexibility to apply different scoring functions over the same feedback data for customized trust evaluations. We also propose a novel scheme to cache trust values based on recent client activity. To evaluate our approach, we implemented our trust management service and tested it on a realistic application scenario in both LAN and WAN distributed environments. Our results indicate that our trust management service can effectively support multiple scoring functions with low overhead and high availability.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
ebay. In http://www.ebay.com.
|
| |
2
|
Google app engine. In http://code.google.com/appengine/.
|
| |
3
|
Ibm application hosting. In http://www-935.ibm.com/services/us/index.wss/offerfamily/ebhs/a1000394.
|
| |
4
|
Planetlab. In http://www.planet-lab.org.
|
| |
5
|
Sample applications working group of the web services interoperability organization. In http://www.wsi.org/deliverables/workinggroup.aspx?wg=sampleapps.
|
 |
6
|
|
 |
7
|
|
 |
8
|
Ernesto Damiani , De Capitani di Vimercati , Stefano Paraboschi , Pierangela Samarati , Fabio Violante, A reputation-based approach for choosing reliable resources in peer-to-peer networks, Proceedings of the 9th ACM conference on Computer and communications security, November 18-22, 2002, Washington, DC, USA
[doi> 10.1145/586110.586138]
|
| |
9
|
|
 |
10
|
Li Fan , Pei Cao , Jussara Almeida , Andrei Z. Broder, Summary cache: a scalable wide-area Web cache sharing protocol, Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication, p.254-265, August 31-September 04, 1998, Vancouver, British Columbia, Canada
|
| |
11
|
I. Gupta, K. Birman, P. Linga, A. Demers, and R. van Renesse. Kelips: Building an efficient and stable p2p dht through increased memory and background overhead. In International Workshop on Peer-to-Peer Systems, 2003.
|
 |
12
|
|
| |
13
|
|
| |
14
|
|
 |
15
|
|
 |
16
|
David Karger , Eric Lehman , Tom Leighton , Rina Panigrahy , Matthew Levine , Daniel Lewin, Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.654-663, May 04-06, 1997, El Paso, Texas, United States
[doi> 10.1145/258533.258660]
|
| |
17
|
|
| |
18
|
A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In International Middleware Conference, 2001.
|
| |
19
|
Ion Stoica , Robert Morris , David Liben-Nowell , David R. Karger , M. Frans Kaashoek , Frank Dabek , Hari Balakrishnan, Chord: a scalable peer-to-peer lookup protocol for internet applications, IEEE/ACM Transactions on Networking (TON), v.11 n.1, p.17-32, February 2003
[doi> 10.1109/TNET.2002.808407]
|
| |
20
|
Wei Wang , Haifeng Jiang , Hongjun Lu , Jeffrey Xu Yu, Bloom histogram: path selectivity estimation for XML data with updates, Proceedings of the Thirtieth international conference on Very large data bases, p.240-251, August 31-September 03, 2004, Toronto, Canada
|
| |
21
|
|
| |
22
|
|
 |
23
|
Liangzhao Zeng , Boualem Benatallah , Marlon Dumas , Jayant Kalagnanam , Quan Z. Sheng, Quality driven web services composition, Proceedings of the 12th international conference on World Wide Web, May 20-24, 2003, Budapest, Hungary
[doi> 10.1145/775152.775211]
|
| |
24
|
B. Zhao, L. Huang, J. Stribling, S. Rhea, A. Joseph, and J. Kubiatowicz. Tapestry: a resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications, 22(1), January 2004.
|
|