WNChord: A Weighted Nodes Based Peer-to-Peer Routing Algorithm
暂无分享,去创建一个
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.
[1] Ellen W. Zegura,et al. How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.
[2] David R. Karger,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.
[3] Stefan Saroiu,et al. A Measurement Study of Peer-to-Peer File Sharing Systems , 2001 .