2009 | OriginalPaper | Chapter
Asymmetric DHT Based on Performance of Peers
Authors : Kazunori Ueda, Kazuhisa Kawada
Published in: Management Enabling the Future Internet for Changing Business and New Computing Services
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.