[p2p-hackers] RE: p2p-hackers Digest, Vol 19, Issue 7

[Anwitaman Datta]

There are several DHT based broadcasting mechanisms in the literature, which 
may also interest you.

The first that I came across was "structella": 
http://nms.lcs.mit.edu/HotNets-II/papers/structella.pdf

Also, we use such a scheme for range queries in
P-Grid: http://www.p-grid.org/Papers/TR-IC-2004-111.pdf

as also used in prefix hash tree

http://berkeley.intel-research.net/sylvia/pht.pdf

- Anwitaman

Today's Topics:

    1. Re: gossiping in a DHT (Paul Campbell)


A faster way is to use the DHT structure where some nodes broadcast multiple
messages. For instance, the source could conceptually break the DHT ring up
into arcs and broadcast a message to a node residing on each arc along with
the arc length. In turn, the next layer of nodes can broadcast the message
across their respective arcs, subdividing the problem by another level. With
log(N) known neighbors, it should take log(N) rounds to reach every node and
again, N-1 messages. Contrast this with N*log(N) messages in an unstructured
gossipping system with log(N) rounds. Thus, without structure, the load is
much higher.

_________________________________________________________________
Trailblazer Narain Karthikeyan. Know more about him ‘n his life. 
http://server1.msn.co.in/sp04/tataracing/ Stay in the loop with Tata Racing!