Advertisement
Published in:
2010 | OriginalPaper | Chapter
D2-Tree: A New Overlay with Deterministic Bounds
Authors : Gerth Stølting Brodal, Spyros Sioutas, Kostas Tsichlas, Christos Zaroliagis
Published in: Algorithms and Computation
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We present a new overlay, called the
Deterministic Decentralized tree
(
D
2
-tree). The
D
2
-tree compares favourably 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.