An Incentive Driven Lookup Protocol for Chord-Based Peer-to-Peer (P2P) Networks

Date
2004-01-01
Authors
Gupta, Rohit
Somani, Arun
Journal Title
Journal ISSN
Volume Title
Publisher
Source URI
Altmetrics
Authors
Research Projects
Organizational Units
Journal Issue
Series
Abstract

In this paper we describe a novel strategy for carrying out lookups in Chord-based peer-to-peer (P2P) networks, wherein nodes are assumed to behave selfishly. This is in contrast to the traditional lookup schemes, which assume that nodes cooperate with each other and truthfully follow a given protocol in carrying out resource lookups. The proposed scheme also provides efficient and natural means for preventing free-riding problem in Chord without requiring prior trust relationships among nodes. In addition, we evaluate the performance of Chord for providing routing service in a network of selfish nodes and prove that it has good structural properties to be used in uncooperative P2P networks.

Description
<p>This is a post-peer-review, pre-copyedit version of a proceeding published as Gupta, Rohit, and Arun K. Somani. "An incentive driven lookup protocol for chord-based peer-to-peer (P2P) networks." In: Bougé L., Prasanna V.K. (eds) <em>High Performance Computing - HiPC 2004</em>. HiPC 2004. <em>Lecture Notes in Computer Science</em>, vol 3296. Springer, Berlin, Heidelberg. (2004): 8-18. The final authenticated version is available online at DOI: <a href="https://doi.org/10.1007/978-3-540-30474-6_7" target="_blank">10.1007/978-3-540-30474-6_7</a>. Posted with permission.</p>
Keywords
Citation