article

Cooperative peer groups in NICE

Authors:

Bobby BhattacharjeeAuthors Info & Claims

Computer Networks: The International Journal of Computer and Telecommunications Networking, Volume 50, Issue 4

Pages 523 - 544

Published: 15 March 2006 Publication History

Abstract

We present a distributed scheme for trust inference in peer-to-peer networks. Our work is in the context of the NICE system, which is a platform for implementing cooperative applications over the Internet. We describe a technique for efficiently storing user reputation information in a completely decentralized manner, and show how this information can be used to efficiently identify non-cooperative users in NICE. We present a simulation-based study of our algorithms, in which we show our scheme scales to thousands of users using modest amounts of storage, processing, and bandwidth at any individual node. Lastly we show that our scheme is robust and can form cooperative groups in systems where the vast majority of users are malicious.

References

[1]

A. Abdul-Rahman, S. Hailes. Supporting trust in virtual communities, in: Proceedings Hawaii International Conference on System Sciences, vol. 33, 2000.

Digital Library

[2]

Aberer, K. and Despotovic, Z., Managing trust in a Peer-2-Peer information system. In: Paques, H., Liu, L., Grossman, D. (Eds.), Proceedings of the Tenth International Conference on Information and Knowledge Management CIKM-01, ACM Press, New York. pp. 310-317.

Digital Library

[3]

E. Adar, B.A. Huberman, Free riding on gnutella, Technical report, Xerox PARC, August 2000.

[4]

S. Banerjee, B. Bhattacharjee, C. Kommareddy, Scalable application layer multicast, in: Proc. ACM Sig-comm, August 2002.

Digital Library

[5]

S. Bhattacharjee, K. Calvert, E. Zegura, Self-organizing wide-area network caches, in: IEEE In- focom'98, 1998.

[6]

Bloom, B.H., Space/time trade-offs in hash coding with allowable errors. Communications of the Association for Computing Machinery. v13 i7. 422-426.

Digital Library

[7]

Bollobas, B., Random Graphs. 2001. Cambridge University Press.

[8]

M. Faloutsos, P. Falouts, C. Faloutsos, On power-law relationship of the internet topology, in: SIGCOMM, 1999, pp. 251-262.

Digital Library

[9]

Fan, L., Cao, P., Almeida, J. and Broder, A.Z., Summary cache: a scalable wide-area web cache sharing protocol. Proc. SIGCOMM'98. v28 i4. 254-265.

Digital Library

[10]

Friedman, E. and Resnick, P., The social cost of cheap pseudonyms. Journal of Economics and Management Strategy. v10 i2. 173-199.

[11]

<http://gnutella.wego.com>.

[12]

S.D. Kamvar, M.T. Schlosser, H. Garcia-Molina, The EigenTrust algorithm for reputation management in P2P networks, in: World Wide Web (WWW), 2003.

Digital Library

[13]

L.P. Cox, B.D. Noble, Samsara: Honor among thieves in peer-to-peer storage, in: Symposium on Operating Systems Principals (SOSP), October 2003, pp. 120-132.

Digital Library

[14]

S. Marsh, Formalising Trust as a Computational Concept, Ph.D. thesis, University of Sterling 1994.

[15]

R. Morselli, B. Bhattacharjee, M. Marsh, A. Srinivasan, Efficient lookup on unstructured topologies, Technical Report CS-TR-4593, University of Maryland, 2004.

[16]

S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker, A scalable content addressable network, in: Proceedings of the ACM SIGCOMM 2001 Technical Conference, 2001.

Digital Library

[17]

S.C. Rhea, John Kubiatowicz, Probabilistic location and routing, in: Proceedings of INFOCOM 2002, 2002.

[18]

A. Rowstran, P. Druschel, Pastry: Scalable, distributed object location and routing for largescale peer-to-peer systems, in: Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001), 2001.

Digital Library

[19]

N. Shankar, C. Komareddy, B. Bhattacharjee, Finding close friends over the Internet, in: Proceedings of International Conference on Network Protocols, November 2001.

Digital Library

[20]

I.S.R. Morris, D. Karger, M.F. Kaashoek, H. Balakrishnan, Chord: A scalable peer-to-peer lookup service for internet applications, in: Proceedings of the ACM SIGCOMM '01 Conference, San Diego, California, August 2001.

Digital Library

[21]

<http://www.ebay.com>.

[22]

<http://www.mojonation.net>.

[23]

B. Yu, M.P. Singh, A social mechanism of reputation management in electronic communities, in: Proceedings of Fourth International Workshop on Cooperative Information Agents, 2000.

Digital Library

[24]

S.Q. Zhuang, B.Y. Zhao, A.D. Joseph, R. Katz, J. Kubiatowicz, Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination, in: Eleventh International Workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV 2001), 2001.

Digital Library

[25]

P. Zimmermann, Pretty good privacy user's guide, Distributed with PGP software, June 1993.

Cited By

Kapanova KKoidl KBujari AManzoni PForster AMota EGaggi O(2019)Towards a model of interpersonal trust in Social Media ApplicationsProceedings of the 5th EAI International Conference on Smart Objects and Technologies for Social Good10.1145/3342428.3342674(120-123)Online publication date: 25-Sep-2019
https://dl.acm.org/doi/10.1145/3342428.3342674
Khalil IYu TGuan BChen XWang XHuang X(2016)Discovering Malicious Domains through Passive DNS Data Graph AnalysisProceedings of the 11th ACM on Asia Conference on Computer and Communications Security10.1145/2897845.2897877(663-674)Online publication date: 30-May-2016
https://dl.acm.org/doi/10.1145/2897845.2897877
Koutrouli ETsalgatidou A(2015)Reputation Systems Evaluation SurveyACM Computing Surveys10.1145/283537348:3(1-28)Online publication date: 9-Dec-2015
https://dl.acm.org/doi/10.1145/2835373
Show More Cited By

Index Terms

Cooperative peer groups in NICE

Recommendations

An Efficient Hybrid Peer-to-Peer System for Distributed Data Sharing

Peer-to-peer overlay networks are widely used in distributed systems. Based on whether a regular topology is maintained among peers, peer-to-peer networks can be divided into two categories: structured peer-to-peer networks in which peers are connected ...
Subjective and Objective Types of Trustworthiness in Peer-to-Peer(P2P) Overlay Networks
WAINA '10: Proceedings of the 2010 IEEE 24th International Conference on Advanced Information Networking and Applications Workshops

Systems using peer-to-peer (P2P) overlay networks are getting a central position in information systems. P2P systems are in nature fully distributed with no centralized coordinator and each peer is autonomous. Each peer has to obtain information on ...
Trustworthiness of acquaintances in Peer-to-Peer overlay networks

Various types of applications manipulate objects distributed in Peer-to-Peer overlay networks. An acquaintance peer of a peer p is a peer whose service the peer p knows and with which the peer p can directly communicate. We discuss types of acquaintance ...

Comments

Information & Contributors

Information

Published In

cover image Computer Networks: The International Journal of Computer and Telecommunications Networking

Computer Networks: The International Journal of Computer and Telecommunications Networking Volume 50, Issue 4

Management in peer-to-peer systems

15 March 2006

129 pages

ISSN:1389-1286

Issue’s Table of Contents

Copyright © Elsevier B.V. © 2005.

Publisher

Elsevier North-Holland, Inc.

United States

Publication History

Published: 15 March 2006

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

17
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 07 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Kapanova KKoidl KBujari AManzoni PForster AMota EGaggi O(2019)Towards a model of interpersonal trust in Social Media ApplicationsProceedings of the 5th EAI International Conference on Smart Objects and Technologies for Social Good10.1145/3342428.3342674(120-123)Online publication date: 25-Sep-2019
https://dl.acm.org/doi/10.1145/3342428.3342674
Khalil IYu TGuan BChen XWang XHuang X(2016)Discovering Malicious Domains through Passive DNS Data Graph AnalysisProceedings of the 11th ACM on Asia Conference on Computer and Communications Security10.1145/2897845.2897877(663-674)Online publication date: 30-May-2016
https://dl.acm.org/doi/10.1145/2897845.2897877
Koutrouli ETsalgatidou A(2015)Reputation Systems Evaluation SurveyACM Computing Surveys10.1145/283537348:3(1-28)Online publication date: 9-Dec-2015
https://dl.acm.org/doi/10.1145/2835373
Yao YRuohomaa SXu F(2012)Addressing common vulnerabilities of reputation systems for electronic commerceJournal of Theoretical and Applied Electronic Commerce Research10.4067/S0718-187620120001000027:1(1-20)Online publication date: 1-Apr-2012
https://dl.acm.org/doi/10.4067/S0718-18762012000100002
Sreenu GDhanya PGopalan KThampi S(2012)Inference of peer temperament in unstructured peer-to-peer networks by creating a virtual multi layer structureProceedings of the International Conference on Advances in Computing, Communications and Informatics10.1145/2345396.2345463(405-408)Online publication date: 3-Aug-2012
https://dl.acm.org/doi/10.1145/2345396.2345463
Li YGruenbacher DScoglio C(2012)Evaluating stranger policies in P2P file-sharing systems with reciprocity mechanismsComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2011.12.01756:4(1470-1485)Online publication date: 1-Mar-2012
https://dl.acm.org/doi/10.1016/j.comnet.2011.12.017
Mejia MPeña NMuñoz JEsparza OAlzate M(2012)DECADEAd Hoc Networks10.1016/j.adhoc.2012.03.01710:7(1379-1398)Online publication date: 1-Sep-2012
https://dl.acm.org/doi/10.1016/j.adhoc.2012.03.017
Jin XChan S(2010)Detecting malicious nodes in peer-to-peer streaming by peer-based monitoringACM Transactions on Multimedia Computing, Communications, and Applications10.1145/1671962.16719656:2(1-18)Online publication date: 23-Mar-2010
https://dl.acm.org/doi/10.1145/1671962.1671965
Hussain FChang EHussain ODamiani EProctor S(2008)A robust methodology for prediction of trust and reputation valuesProceedings of the 2008 ACM workshop on Secure web services10.1145/1456492.1456507(97-108)Online publication date: 31-Oct-2008
https://dl.acm.org/doi/10.1145/1456492.1456507
Lax GSarné G(2008)CellTrustElectronic Commerce Research10.1007/s10660-008-9019-88:4(193-216)Online publication date: 1-Dec-2008
https://dl.acm.org/doi/10.1007/s10660-008-9019-8
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents