Asymmetric DHT based on performance of peers

Authors:
Kazunori Ueda;Kazuhisa Kawada
Affiliations:
Electronic and Photonic Systems Engineering, Kochi University of Technology, Kami, Kochi, Japan;NTT Software Corporation
Venue:
APNOMS'09 Proceedings of the 12th Asia-Pacific network operations and management conference on Management enabling the future internet for changing business and new computing services
Year:
2009

Citing 2
Cited 0

Kademlia: A Peer-to-Peer Information System Based on the XOR Metric

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Overlay Weaver: An overlay construction toolkit

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, a distributed hash table (DHT) has been used to construct peer-to-peer (P2P) overlay networks. DHT has high scalability for the number of peers, and peers can efficiently retrieve contents from the overlay network. Since DHT algorithms are used to construct symmetric network models, the communication cost of maintaining the routing table is low for peers that have a large computing or network resource and vice versa. We propose an asymmetric DHT network model that can be used to allocate appropriate jobs to a peer according to its performance.