Download presentation

Presentation is loading. Please wait.

1
Eddie Bortnikov/Aran Bergman, Principles of Reliable Distributed Systems, Technion EE, Spring 2006 1 Principles of Reliable Distributed Systems Recitation 5 Efficient Broadcast in Structured P2P Networks Spring 2008 Alex Shraer

2
Eddie Bortnikov/Aran Bergman, Principles of Reliable Distributed Systems, Technion EE, Spring 2006 2 Today’s Recitation “Efficient Broadcast in Structured P2P Networks” –El-Ansary et al. In 2nd International Workshop on Peer-to-Peer Systems (IPTPS '03) –See the web site

3
Eddie Bortnikov/Aran Bergman, Principles of Reliable Distributed Systems, Technion EE, Spring 2006 3 Motivation We would like to search the network using arbitrary queries. (Not only key lookups) –“Look for the nodes that hold ‘Kill Bill Vol*’ ” –Statistical gathering queries –notifications A possible solution – broadcast the query to all the nodes in the network –How do we do it efficiently?

4
Eddie Bortnikov/Aran Bergman, Principles of Reliable Distributed Systems, Technion EE, Spring 2006 4 Simple Solution Gnutella: Use a random connectivity graph and flood the query to all the neighbors –We can send arbitrary queries but, –Hit guarantees – Low, –Traffic – Enormous (not scalable). We would like to do better –Use a structured overlay network.

5
Eddie Bortnikov/Aran Bergman, Principles of Reliable Distributed Systems, Technion EE, Spring 2006 5 Problem Definition Given an overlay network constructed by a P2P DHT system, find an efficient algorithm for broadcasting messages. –The algorithm should not depend on global knowledge of membership and, –should be of equal cost for any member in the system. What’s the most efficient number of messages needed to broadcast a message to all the nodes?

6
Eddie Bortnikov/Aran Bergman, Principles of Reliable Distributed Systems, Technion EE, Spring 2006 6 Simple Solution (Take II) Ring traversal –Number of messages: N-1 (efficient) –Time: N-1 InitBroadcast

7
Eddie Bortnikov/Aran Bergman, Principles of Reliable Distributed Systems, Technion EE, Spring 2006 7 Another look at Chord Chord actually performs a binary search Look at a fully-populated 8-node network:

8
Eddie Bortnikov/Aran Bergman, Principles of Reliable Distributed Systems, Technion EE, Spring 2006 8 Constructing a spanning tree

9
Eddie Bortnikov/Aran Bergman, Principles of Reliable Distributed Systems, Technion EE, Spring 2006 9 Taking Advantage of Structure Gnutella-like Broadcast –We know that setting TTL = log 2 (N) guarantees (with high probability) flooding to all nodes. Efficient Broadcast –Based on the spanning tree

10
Eddie Bortnikov/Aran Bergman, Principles of Reliable Distributed Systems, Technion EE, Spring 2006 10 Initiating a Broadcast Notation:

11
Eddie Bortnikov/Aran Bergman, Principles of Reliable Distributed Systems, Technion EE, Spring 2006 11 Processing a Broadcast NewLimit := min{Finger[i+1], Limit}

12
Eddie Bortnikov/Aran Bergman, Principles of Reliable Distributed Systems, Technion EE, Spring 2006 12 Properties Coverage of all nodes. No redundancy. These properties are identical to the ring traversal algorithm. –Why use this algorithm? Is this algorithm fault tolerant?

13
Eddie Bortnikov/Aran Bergman, Principles of Reliable Distributed Systems, Technion EE, Spring 2006 13 Simulation Results

Similar presentations

© 2020 SlidePlayer.com Inc.

All rights reserved.

To make this website work, we log user data and share it with processors. To use this website, you must agree to our Privacy Policy, including cookie policy.

Ads by Google