An incentive driven lookup protocol for chord-based peer-to-peer (p2p) networks

Authors:
Rohit Gupta;Arun K. Somani
Affiliations:
Department of Electrical and Computer Engineering, Iowa State University, Ames, IA;Department of Electrical and Computer Engineering, Iowa State University, Ames, IA
Venue:
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
Year:
2004

Citing 5
Cited 0

Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Participation Incentive Mechanisms in Peer-to-Peer Subscription Systems

HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Stimulating cooperation in self-organizing mobile ad hoc networks

Mobile Networks and Applications
Replica management should be a game

EW 10 Proceedings of the 10th workshop on ACM SIGOPS European workshop
Algorithms for selfish agents mechanism design for distributed computation

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Quantified Score

Hi-index	0.00

Visualization

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.