Anzeige
Erschienen in:
2010 | OriginalPaper | Buchkapitel
D2-Tree: A New Overlay with Deterministic Bounds
verfasst von : Gerth Stølting Brodal, Spyros Sioutas, Kostas Tsichlas, Christos Zaroliagis
Erschienen in: Algorithms and Computation
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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.