skip to main content
10.1145/1341771.1341799acmotherconferencesArticle/Chapter ViewAbstractPublication PagescomputeConference Proceedingsconference-collections
poster

Result evaluation strategies for peer selection in P2P

Published: 18 January 2008 Publication History

Abstract

P2P networks provide a highly reliable way of sharing resources. For the peers to behave honestly trust needs to be incorporated. The trust framework should incorporate self-experience and reputation to calculate trustworthiness of a peer, in order to enable assessing the peers based on the services provided by them. Within the trust framework, various strategies for assessing the peers based on the performance shall be analysed which may result in selection of peers for providing certain type of services. This paper proposes Game Tree strategy, Tit for Tat strategy, Self Trust strategy, Dynamic strategy and Auditing strategy for selecting peers for doing job in trust-driven P2P networks.

References

[1]
Asad Awan, Ronaldo A. Ferreira, Suresh Jagannathan and Ananth Grama, "Unstructured peer-to-peer networks for sharing processor cycles", Parallel Computing, 32(2): 115--135, 2006.
[2]
Chiranjeeb Buragohain, Divyakant Agrawal and Subhash Suri, "A Game Theoretic Framework for Incentives in P2P Systems," Proc. of the 3rd International Conference on Peer-to-Peer Computing, ISBN:0-7695-2023-5, 2003.
[3]
Daniel W. Manchala, "E-Commerce Trust Metrics and Models", IEEE internet computing, Volume 4, no. 2, Pages: 36--44, ISSN:1089--7801, March 2000.
[4]
David Hales and Stefano Arteconi, "SLACER: A Self-Organizing Protocol for Coordination in Peer-to-Peer Networks," IEEE Intelligent Systems, vol. 21, no. 2, pp. 29--35, Mar/Apr, 2006.
[5]
Harish M., G. S. Mahalakshmi and T. V. Geetha, Game Theoretic Model for P2P Trust Management, In proceedings of the International Conference on Computational Intelligence and Multimedia Applications --- 2007 (ICCIMA'07), Sivakasi, India, IEEE CS Press, December 2007 (to appear)
[6]
Li Xiong and Ling Liu, "Building Trust in Decentralized Peer-to-Peer Electronic Communities," Proc. of 5th International Conference on Electronic Commerce Research (ICECR-5), 2002.
[7]
Li Xiong and Ling Liu, "PeerTrust: Supporting Reputation-Based Trust for Peer-to-Peer Electronic Communities," IEEE Transactions on Knowledge and Data Engineering (TKDE), Special Issue on Peer-to-Peer Based Data Management, 2004.
[8]
Paul Resnick, ichard Zeckhauser, Eric Friedman and Ko Kuwabara, "Reputation Systems:Facilitating Trust in Internet Interactions", Communications of the ACM, Vol. 43, No. 12, pp. 45--48, 2000.
[9]
Rohit Gupta and Arun K. Somani, "Game Theory as A Tool to Strategize As Well As Predict Nodes' Behavior in Peer-to-Peer Networks," Proceedings of the 2005 11th International Conference on Parallel and Distributed System, pp.244--249, 2005.
[10]
Ruggero Morselli Jonathan Katz Bobby Bhattacharjee, "A Game-Theoretic Framework for Analyzing Trust-Inference Protocols," in: Workshop on Economics of Peer-to-Peer Systems, 2004.

Cited By

View all
  • (2010)Advanced chord routing algorithm based on redundant information replaced and objective resource table2010 3rd International Conference on Computer Science and Information Technology10.1109/ICCSIT.2010.5563760(247-250)Online publication date: Jul-2010
  • (2007)Design and Analysis of a Game Theoretic Model for P2P Trust ManagementDistributed Computing and Internet Technology10.1007/978-3-540-77115-9_11(110-115)Online publication date: 17-Dec-2007

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
COMPUTE '08: Proceedings of the 1st Bangalore Annual Compute Conference
January 2008
195 pages
ISBN:9781595939500
DOI:10.1145/1341771
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

  • ACM Bangalore chapter

In-Cooperation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 18 January 2008

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. game tree
  2. peer-to-peer
  3. result evaluation strategies
  4. trust framework

Qualifiers

  • Poster

Conference

COMPUTE08
Sponsor:
COMPUTE08: ACM Bangalore Chapter COMPUTE 2008
January 18 - 20, 2008
Bangalore, India

Acceptance Rates

Overall Acceptance Rate 114 of 622 submissions, 18%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)1
Reflects downloads up to 03 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2010)Advanced chord routing algorithm based on redundant information replaced and objective resource table2010 3rd International Conference on Computer Science and Information Technology10.1109/ICCSIT.2010.5563760(247-250)Online publication date: Jul-2010
  • (2007)Design and Analysis of a Game Theoretic Model for P2P Trust ManagementDistributed Computing and Internet Technology10.1007/978-3-540-77115-9_11(110-115)Online publication date: 17-Dec-2007

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media