Campus Units

Electrical and Computer Engineering

Document Type

Conference Proceeding

Conference

International Conference on High-Performance Computing: HiPC 2004

Publication Version

Accepted Manuscript

Link to Published Version

https://doi.org/10.1007/978-3-540-30474-6_7

Publication Date

2004

Journal or Book Title

High Performance Computing - HiPC 2004

Volume

3296

First Page

8

Last Page

18

DOI

10.1007/978-3-540-30474-6_7

Conference Title

International Conference on High-Performance Computing: HiPC 2004

Conference Date

December 19-22, 2004

City

Bangalore, India

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.

Comments

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) High Performance Computing - HiPC 2004. HiPC 2004. Lecture Notes in Computer Science, vol 3296. Springer, Berlin, Heidelberg. (2004): 8-18. The final authenticated version is available online at DOI: 10.1007/978-3-540-30474-6_7. Posted with permission.

Copyright Owner

Springer-Verlag Berlin Heidelberg

Language

en

File Format

application/pdf

Published Version

Share

Article Location

 
COinS