1 Department of Computer Science, Science and Technology, Aarhus University2 Department of Computer Science - Center for Massive Data Algoritmics, Department of Computer Science, Science and Technology, Aarhus University3 Ionian University, Corfu4 Aristotle University of Thessaloniki5 University of Patras. CTI and Dept. of Computer Engineerings & Informatics6 Department of Computer Science, Science and Technology, Aarhus University
A new overlay with deterministic bounds
We present a new overlay, called the Deterministic Decentralized tree (D2-tree). The D2-tree compares favorably to other overlays for the following reasons: (a) it provides matching and better complexities, which are deterministic for the supported operations; (b) the management of nodes (peers) and elements are completely decoupled from each other; and (c) an efficient deterministic load-balancing mechanism is presented for the uniform distribution of elements into nodes, while at the same time probabilistic optimal bounds are provided for the congestion of operations at the nodes. The load-balancing scheme of elements into nodes is deterministic and general enough to be applied to other hierarchical tree-based overlays. This load-balancing mechanism is based on an innovative lazy weight-balancing mechanism, which is interesting in its own right.
Algorithmica, 2015, Vol 72, Issue 3, p. 860-883
Overlay; Indexing scheme; Decentralized system; Distributed data structure; Load-balancing