WNChord: a weighted nodes based peer-to-peer routing algorithm

Authors:
Liang Zhang;Shudong Chen;Fanyuan Ma;Minglu Li
Affiliations:
Department of Computer Science & Engineering, Shanghai Jiao Tong University, Shanghai, China;Department of Computer Science & Engineering, Shanghai Jiao Tong University, Shanghai, China;Department of Computer Science & Engineering, Shanghai Jiao Tong University, Shanghai, China;Department of Computer Science & Engineering, Shanghai Jiao Tong University, Shanghai, China
Venue:
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
Year:
2004

Citing 2
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
How to model an internetwork

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

Considering the existing difference in load rates, computing performance and delivery latency between peers in Chord protocol, we present a weighted nodes based P2P routing algorithm(WNChord), in which each node could be treated respectively to make highly capable nodes take more tasks. Specifically speaking, the routing algorithm in peers is reformulated and is parameterized using a quantity C, which may control latency’s expected value such that P2P network’s total latency to become much lower by choosing proper C.