D$^2$-Tree: A New Overlay with Deterministic Bounds

Details D$^2$-Tree: A New Overlay with Deterministic Bounds D$^2$-Tree: A New Overlay with Deterministic Bounds

2010-09-16

arxiv.org/abs/1009.3134v2

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

We present a new overlay, called the {\em 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. 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.

Affiliated with

Also associated with

No associations

Rating

D$^2$-Tree: A New Overlay with Deterministic Bounds does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with D$^2$-Tree: A New Overlay with Deterministic Bounds, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and D$^2$-Tree: A New Overlay with Deterministic Bounds will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-27457