Asymmetric DHT Based on Performance of Peers
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.
Unable to display preview. Download preview PDF.
- 1.Kawada, K., Ueda, K.: Asymmetric-DHT based on node capabilities. In: Technical report of IEICE. ICM, March 2009, vol. 108, pp. 69–74 (2009)Google Scholar