Skip to main content
Book cover

International Conference on Parallel Processing and Applied Mathematics

PPAM 2009: Parallel Processing and Applied Mathematics pp 260–269Cite as

HyCube: A DHT Routing System Based on a Hierarchical Hypercube Geometry

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 6068)

Abstract

This paper presents a DHT routing system based on a hierarchical hypercube geometry. An approach employing a novel variable metric adopting the Steinhaus transform is presented. The use of this metric and the hierarchical hypercube geometry allows to reach very good performance of the network and a very high level of resilience to node failures. The architecture of the network and the routing algorithm are presented. The results of the simulations have been included in the paper and compared with existing solutions.

Keywords

  • peer-to-peer network
  • distributed hash table
  • Steinhaus transform
  • hierarchical hypercube

This is a preview of subscription content, access via your institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-642-14403-5_28
  • Chapter length: 10 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   84.99
Price excludes VAT (USA)
  • ISBN: 978-3-642-14403-5
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   109.99
Price excludes VAT (USA)
Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In: Proc. of the ACM SIGCOMM 2001 Technical Conference, pp. 149–160 (2001)

    Google Scholar 

  2. Maymounkov, P., Mazières, 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, p. 53. Springer, Heidelberg (2002)

    CrossRef  Google Scholar 

  3. Rowstron, A.I., Druschel, P.: Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)

    CrossRef  Google Scholar 

  4. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A Scalable Content-Addressable Network. In: Proc. of the ACM SIGCOMM 2001 Technical Conference (2001)

    Google Scholar 

  5. Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: A Scalable and Dynamic Emulation of the Butterfly. In: Proc. of the 21st ACM Symposium on Principles of Distributed Computing, PODC 2002 (2002)

    Google Scholar 

  6. Gummadi, K., Gummadi, R., Gribble, S., Ratnasamy, S., Shenker, S., Stoica, I.: The impact of DHT routing geometry on resilience and proximity. In: Proc. of the 2003 Conference on Applications, Technologies, Architectures, and Protocols For Computer Communications, SIGCOMM 2003 (2003)

    Google Scholar 

  7. Plaxton, C.G., Rajaraman, R., Richa, A.W.: Accessing Nearby Copies of Replicated Objects in a Distributed Environment. In: Proc. of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 311–320 (1997)

    Google Scholar 

  8. Clarkson, K.L.: Nearest-Neighbor Searching and Metric Space Dimensions. In: Nearest-Neighbor Methods for Learning and Vision: Theory and Practice. MIT Press, Cambridge (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Warsaw University of Technology,  

    Artur Olszak

Authors
  1. Artur Olszak
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computational and Information Sciences,, Czestochowa University of Technology,  

    Roman Wyrzykowski

  2. Department of Electrical Engineering and Computer Science, University of Tennessee, 37996-3450, Knoxville, TN, USA

    Jack Dongarra

  3. Institute of Computer and Information Science, Czestochowa University of Technology, Dabrowskiego 73, PL-42-200, Czestochowa, Poland

    Konrad Karczewski

  4. Department of Informatics and Mathematical Modeling, Technical University of Denmark, Richard Petersens Plads, Building 321, 2800, Kongens Lyngby, Denmark

    Jerzy Wasniewski

Rights and permissions

Reprints and Permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Olszak, A. (2010). HyCube: A DHT Routing System Based on a Hierarchical Hypercube Geometry. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wasniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2009. Lecture Notes in Computer Science, vol 6068. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14403-5_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14403-5_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14402-8

  • Online ISBN: 978-3-642-14403-5

  • eBook Packages: Computer ScienceComputer Science (R0)