Decoupling the permanent identifier of a node from the node's topology-dependent address
is a promising approach toward completely scalable self-organizing networks. Existing …

Abstract Self–Organized Networks are multi-hop networks that do not rely on any
infrastructure. Moreover, their topology is supposed to be flat since all nodes are equally in …

Decoupling the permanent identifier of a node from the node's topology-dependent address
is a promising approach toward completely scalable self-organizing networks. A group of …

The various proposed DHT routing algorithms embody several different underlying routing
geometries. These geometries include hypercubes, rings, tree-like structures, and butterfly …

Distributed hash tables have been proposed as flat, nonhierarchical structures, in contrast to
most scalable distributed systems of the past. We show how to construct hierarchical DHTs …

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 increase demand for flexibility, spontaneity, adaptability, independence of a wire
infrastructure, and easy-managed architectures are driving a revolutionary change in the …

Today an application developer using a distributed hash table (DHT) with n nodes must
choose a DHT protocol from the spectrum between O (1) lookup protocols [9, 18] and O (log …

Abstract Distributed Hash Tables (DHTs) enable fully distributed Peer-to-Peer network
construction and maintenance with name-driven routing. There exist very few DHT …

Recent research efforts have improved the existing flat distributed hash tables to
accommodate hierarchical structure. Nevertheless, many problems still remain to be solved …