D2-Tree: A New Overlay with Deterministic Bounds

Gerth Stølting Brodal, Spyros Sioutas, Kostas Tsichlas, and Christos D. Zaroliagis

In Proc. 21th Annual International Symposium on Algorithms and Computation, Part II, volume 6507 of Lecture Notes in Computer Science, pages 1-12. Springer Verlag, Berlin, 2010.

Abstract

We present a new overlay, called the Deterministic Decentralized tree (D2-tree). The D2-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.

Copyright notice

© Springer-Verlag Berlin Heidelberg 2010. All rights reserved.

Online version

isaac10overlay.pdf (206 Kb)

DOI

10.1007/978-3-642-17514-5_1

Links

BIBTEX entry

@incollection{isaac10overlay,
  author = "Gerth St{\o}lting Brodal and Spyros Sioutas and Kostas Tsichlas and Christos D. Zaroliagis",
  booktitle = "Proc. 21th Annual International Symposium on Algorithms and Computation, Part II",
  doi = "10.1007/978-3-642-17514-5_1",
  isbn = "978-3-642-17513-8",
  pages = "1-12",
  publisher = "Springer {V}erlag, Berlin",
  series = "Lecture Notes in Computer Science",
  title = "$D^2$-Tree: A New Overlay with Deterministic Bounds",
  volume = "6507",
  year = "2010"
}