Distributed hash table

HyCube

A DHT built on hierarchical hypercube geometry and a variable Steinhaus metric, designed for efficient routing and strong resilience under churn.

Overview

Routing that stays efficient when the network moves.

HyCube models the address space as a hierarchical hypercube of nested cubes whose vertices are lower-level cubes, and routes with a variable multidimensional metric that adopts the Steinhaus transform. Together, the geometry and the metric deliver strong lookup performance and a high level of resilience to node failures, even without relying on sequential neighbors.

Publications

Related papers

Primary reference first, please cite it if you use HyCube in your research.

  1. HyCube: A distributed hash table based on a variable metric

    A. Olszak · Peer-to-Peer Networking and Applications, Vol. 10, Issue 4, pp. 954–982, Springer, July 2017

    DOI: 10.1007/s12083-016-0455-2

    Cite this paper when using HyCube in research.

  2. HyCube: A distributed hash table based on a hierarchical hypercube geometry

    A. Olszak · ICS Research Report 2/2013, Warsaw University of Technology, Institute of Computer Science, Feb. 2013

    PDF
  3. HyCube: A DHT routing system based on a hierarchical hypercube geometry

    A. Olszak · 8th International Conference On Parallel Processing and Applied Mathematics (PPAM 2009), Part II, LNCS 6068, pp. 260–269, 2010

    The original publication is available at www.springerlink.com. DOI: 10.1007/978-3-642-14403-5_28

    PDF

Get started

Library, releases, and simulation.

Source, binaries, Maven artifacts, and a dedicated simulator for experiments.