Asymmetric DHT Based on Performance of Peers

  • Kazunori Ueda
  • Kazuhisa Kawada
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5787)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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
  2. 2.
    Maymounkov, P., Mazieres, D.: Kademlia: A Peer-to-peer Information System Based on the XOR Metric. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 53–65. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  3. 3.
    Shudo, K., Tanaka, Y., Sekiguchi, S.: Overlay Weaver: An overlay construction toolkit. Computer Communications 31, 402–412 (2008)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Kazunori Ueda
    • 1
  • Kazuhisa Kawada
    • 2
  1. 1.Electronic and Photonic Systems EngineeringKochi University of TechnologyKochiJapan
  2. 2.NTT Software CorporationUSA

Personalised recommendations