Hot Topics in Peer-to-Peer Computing (HOT-P2P 2004) Volendam 08 October 2004 Non-uniform deterministic routing on F-Chord(  ) Gennaro Cordasco, Luisa.

Slides:



Advertisements
Similar presentations
Università di Salerno GL7 Distributed Adaptive Directory (DAD) F-Chord: Improved Uniform Routing on Chord Meeting Firb - Genova, 5-6 luglio 2004.
Advertisements

Salerno, 20/21/22 giugno Meeting WEBMINDS 2005 Degree-Optimal Deterministic Routing for P2P Systems Meeting WEBMINDS 2005 Salerno, 20/21/22 giugno Università
Routing in Poisson small-world networks A. J. Ganesh Microsoft Research, Cambridge Joint work with Moez Draief.
1 Analyzing Kleinberg’s Small-world Model Chip Martel and Van Nguyen Computer Science Department; University of California at Davis.
Pastry Peter Druschel, Rice University Antony Rowstron, Microsoft Research UK Some slides are borrowed from the original presentation by the authors.
Peter Druschel, Rice University Antony Rowstron, Microsoft Research UK
Scalable Content-Addressable Network Lintao Liu
Routing in a Parallel Computer. A network of processors is represented by graph G=(V,E), where |V| = N. Each processor has unique ID between 1 and N.
SKIP GRAPHS Slides adapted from the original slides by James Aspnes Gauri Shah.
Online Social Networks and Media Navigation in a small world.
Fabian Kuhn, Microsoft Research, Silicon Valley
1 David Liben-Nowell, Hari Balakrishnan, David Karger Analysis of the Evolution of Peer-to-Peer Systems Speaker: Jan Conrad.
1 PASTRY Partially borrowed from Gabi Kliot ’ s presentation.
1 Accessing nearby copies of replicated objects Greg Plaxton, Rajmohan Rajaraman, Andrea Richa SPAA 1997.
Common approach 1. Define space: assign random ID (160-bit) to each node and key 2. Define a metric topology in this space,  that is, the space of keys.
1 Data Persistence in Large-scale Sensor Networks with Decentralized Fountain Codes Yunfeng Lin, Ben Liang, Baochun Li INFOCOM 2007.
Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems Antony Rowstron and Peter Druschel Proc. of the 18th IFIP/ACM.
1 Analyzing Kleinberg’s (and other) Small-world Models Chip Martel and Van Nguyen Computer Science Department; University of California at Davis.
Fault-tolerant Routing in Peer-to-Peer Systems James Aspnes Zoë Diamadi Gauri Shah Yale University PODC 2002.
Spring 2003CS 4611 Peer-to-Peer Networks Outline Survey Self-organizing overlay network File system on top of P2P network Contributions from Peter Druschel.
A Scalable Content- Addressable Network Sections: 3.1 and 3.2 Καραγιάννης Αναστάσιος Α.Μ. 74.
Secure routing for structured peer-to-peer overlay networks (by Castro et al.) Shariq Rizvi CS 294-4: Peer-to-Peer Systems.
SCALLOP A Scalable and Load-Balanced Peer- to-Peer Lookup Protocol for High- Performance Distributed System Jerry Chou, Tai-Yi Huang & Kuang-Li Huang Embedded.
Know thy neighbor’s neighbor: Better Routing for Skip-Graphs and Small Worlds Αθανασόπουλος Διονύσης Καμωνά Λαμπρινή Φωτιάδου Αικατερίνη Moni Nao, Udi.
SkipNet: A Scaleable Overlay Network With Practical Locality Properties Presented by Rachel Rubin CS294-4: Peer-to-Peer Systems By Nicholas Harvey, Michael.
The Small World Phenomenon: An Algorithmic Perspective by Anton Karatoun.
1 CS 194: Distributed Systems Distributed Hash Tables Scott Shenker and Ion Stoica Computer Science Division Department of Electrical Engineering and Computer.
P2P Course, Structured systems 1 Skip Net (9/11/05)
1 Peer-to-Peer Networks Outline Survey Self-organizing overlay network File system on top of P2P network Contributions from Peter Druschel.
CPSC 689: Discrete Algorithms for Mobile and Wireless Systems Spring 2009 Prof. Jennifer Welch.
1 Koorde: A Simple Degree Optimal DHT Frans Kaashoek, David Karger MIT Brought to you by the IRIS project.
1 A scalable Content- Addressable Network Sylvia Rathnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Shenker Pirammanayagam Manickavasagam.
1 PASTRY. 2 Pastry paper “ Pastry: Scalable, decentralized object location and routing for large- scale peer-to-peer systems ” by Antony Rowstron (Microsoft.
Using the Small-World Model to Improve Freenet Performance Hui Zhang Ashish Goel Ramesh Govindan USC.
Optimisation des DHT à partir des propriétés physiques, logiques et sociologiques des clients Pierre Fraigniaud CNRS LRI, Univ. Paris-Sud
Searching via Your Neighbor’s Neighbor: The Power of Lookahead in P2P Networks Moni Naor Udi Wieder The Weizmann Institute of Science Gurmeet Manku Stanford.
CCAN: Cache-based CAN Using the Small World Model Shanghai Jiaotong University Internet Computing R&D Center.
Content Addressable Network CAN. The CAN is essentially a distributed Internet-scale hash table that maps file names to their location in the network.
A Scalable Content-Addressable Network (CAN) Seminar “Peer-to-peer Information Systems” Speaker Vladimir Eske Advisor Dr. Ralf Schenkel November 2003.
Gennaro Cordasco - How Much Independent Should Individual Contacts be to Form a Small-World? - 19/12/2006 How Much Independent Should Individual Contacts.
Online Social Networks and Media
An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks Seema Bandyopadhyay and Edward J. Coyle Presented by Yu Wang.
An IP Address Based Caching Scheme for Peer-to-Peer Networks Ronaldo Alves Ferreira Joint work with Ananth Grama and Suresh Jagannathan Department of Computer.
Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications.
The new protocol of freenet Taken from Ian Clarke and Oskar Sandberg (The Freenet Project)
1 Distributed Hash Table CS780-3 Lecture Notes In courtesy of Heng Yin.
Chord Fay Chang, Jeffrey Dean, Sanjay Ghemawat, Wilson C. Hsieh, Deborah A. Wallach, Mike Burrows, Tushar Chandra, Andrew Fikes, Robert E. Gruber Google,
Idit Keidar, Principles of Reliable Distributed Systems, Technion EE, Spring Principles of Reliable Distributed Systems Lecture 2: Distributed Hash.
Gennaro Cordasco - Degree–Optimal Routing for P2P Systems - 28/10/2006 Degree–Optimal Routing for P2P Systems Giovanni Chiola, Gennaro Cordasco, Luisa.
Plethora: Infrastructure and System Design. Introduction Peer-to-Peer (P2P) networks: –Self-organizing distributed systems –Nodes receive and provide.
Dynamic Networks for Peer-to-Peer Systems Pierre Fraigniaud CNRS Lab. de Recherche en Informatique (LRI) Univ. Paris-Sud, Orsay Joint work with Philippe.
Two Peer-to-Peer Networking Approaches Ken Calvert Net Seminar, 23 October 2001 Note: Many slides “borrowed” from S. Ratnasamy’s Qualifying Exam talk.
INTERNET TECHNOLOGIES Week 10 Peer to Peer Paradigm 1.
P2P Search COP6731 Advanced Database Systems. P2P Computing  Powerful personal computer Share computing resources P2P Computing  Advantages: Shared.
1 Plaxton Routing. 2 History Greg Plaxton, Rajmohan Rajaraman, Andrea Richa. Accessing nearby copies of replicated objects, SPAA 1997 Used in several.
CS694 - DHT1 Distributed Hash Table Systems Hui Zhang University of Southern California.
Incrementally Improving Lookup Latency in Distributed Hash Table Systems Hui Zhang 1, Ashish Goel 2, Ramesh Govindan 1 1 University of Southern California.
Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications * CS587x Lecture Department of Computer Science Iowa State University *I. Stoica,
Peer-to-Peer Networks 07 Degree Optimal Networks
Pastry Scalable, decentralized object locations and routing for large p2p systems.
Know thy Neighbor’s Neighbor Better Routing for Skip Graphs and Small Worlds Moni Naor Udi Wieder.
Peer-to-Peer and Social Networks
Plethora: Infrastructure and System Design
Accessing nearby copies of replicated objects
SKIP GRAPHS James Aspnes Gauri Shah SODA 2003.
A Scalable content-addressable network
Koorde: A simple degree optimal DHT
Introduction Wireless Ad-Hoc Network
Koorde: A Simple Degree Optimal DHT
A Scalable Content Addressable Network
Presentation transcript:

Hot Topics in Peer-to-Peer Computing (HOT-P2P 2004) Volendam 08 October 2004 Non-uniform deterministic routing on F-Chord(  ) Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Alberto Negro, Vittorio Scarano Dipartimento di Informatica e Applicazioni “R.M. Capocelli” Università di Salerno, 84081, Baronissi (SA) - Italy

Hot Topics in Peer-to-Peer Computing (HOT-P2P 2004) Volendam 08 October 2004Outline  P2P e DHT  DHT performance metrics  Uniform Routing Algorithm vs Non-uniform Routing Algorithm  F-Chord  F-Chord [CGHNS04]  Neighbor of Neighbor routing algorithm  Neighbor of Neighbor routing algorithm [MNW04]  Our Proposal  H-schemes  H-F-Chord

Hot Topics in Peer-to-Peer Computing (HOT-P2P 2004) Volendam 08 October 2004 Distributed Hash Table (DHT)  Distributed version of a hash table data structure  Stores (key, value) pairs  The key is like a filename  The value can be file contents  Goal: Efficiently insert/lookup/delete (key, value) pairs  Each peer stores a subset of (key, value) pairs in the system  Core operation: Find node responsible for a key  Map key to node  Efficiently route insert/lookup/delete requests to this node

Hot Topics in Peer-to-Peer Computing (HOT-P2P 2004) Volendam 08 October 2004 DHT performance metrics  Three performance metrics:  Routing table size (degree)  Storage cost  Measure the cost of self-stabilization for adapting to node joins/leaves  Diameter and Average path length  Time cost  Fault tolerance

Hot Topics in Peer-to-Peer Computing (HOT-P2P 2004) Volendam 08 October 2004 Uniform Routing Algorithm  We consider a ring of N identifiers labeled from 0 to N-1  A routing algorithm is uniform if for each identifier x, x is connected to y iff x+z is connected to y+z (i.e. : all the connection are symmetric).  Advantages  Easy to implement  Greedy algorithm is optimal  Simple – to understand and implement  Local – routing occurs inside the portion of ring that is delimited by source and destination  No node congestion  Drawback  Less powerful (De Bruijn Graph and Neighbor of Neighbor Greedy routing are more powerful) Routing is not greedy

Hot Topics in Peer-to-Peer Computing (HOT-P2P 2004) Volendam 08 October 2004 Asymptotic tradeoff curve Routing table size 1 1 N -1 O(log N) Chord et al. Ring O(log N) Diameter Uniform Routing algorithm Non-Uniform Routing algorithm Totally connected graph

Hot Topics in Peer-to-Peer Computing (HOT-P2P 2004) Volendam 08 October 2004 F-Chord(  ) [CGHNS04] F-Chord(1) even jumps all jumps  F-Chord(  ) Fib(2i), for i = 1,2, …,  (1-  )(m-2)  Fib(i), for i = 2  (1-  )(m-2)  +2, …, m-1  Degree: F-Chord(  ) use  (m-2)  jumps  Diameter: For any value of , the diameter of F-Chord(  ) is  m/2   log N  Average Path Length: The average path length of the F-Chord(  ) scheme is bounded by log N + (1-  ) log N+1 The average path length of the F-Chord(  ) scheme is bounded by log N + (1-  ) log N+1  [1/2,1]

Hot Topics in Peer-to-Peer Computing (HOT-P2P 2004) Volendam 08 October 2004  Let N( ,d) denote the maximum number of consecutive identifiers obtainable trough a uniform algorithm using up to  jumps (i.e. degree  ) and diameter d. For any  0, d  0, it holds that N( ,d)  Fib(  +d+1)  For each  [ , ] the F-Chord(  ) schemes improve on Chord in all parameters (number of jumps, diameter, and average path length) F-Chord(1/2) is optimal F-Chord(  ) [CGHNS04]

Hot Topics in Peer-to-Peer Computing (HOT-P2P 2004) Volendam 08 October 2004  hops x log n Graphical results Lower is better

Hot Topics in Peer-to-Peer Computing (HOT-P2P 2004) Volendam 08 October 2004 The Small World Phenomena  The “six degree of separation” experiment S. Milgram [M67].  The sociological experiment relied on social networks to transmit a letter from a person to unfamiliar targets by passing the letter only via acquaintances.  Only a small number (around 6) of steps was needed.  Recent work [DRW03], shows that, in the first steps the message was forwarded to a person P by using a guess on who P knew or, in other words, on his/her neighbors.

Hot Topics in Peer-to-Peer Computing (HOT-P2P 2004) Volendam 08 October 2004 Small World Nodes  points in a two dimensional grid Grid edge  short range Each edge (x, y) appears independently with probability 1/d(x,y) 2 Degree of each node  (log N)

Hot Topics in Peer-to-Peer Computing (HOT-P2P 2004) Volendam 08 October 2004R-Schemes  R-Chord N=2 m [MNW04]  For each 0 ≤ i < m, let r(i) denote an integer chosen uniformly at random from the interval [0,2 i ), node x is connected by edges to the nodes x+2 i +r(i);  R-Hypercube [MNW04]  For each 0 ≤ i ≤ m, node x is connected with y where y is defined as follows: the top i-1 bits of y are identical to those of x. The i th is flipped. The remaining m - i bits are chosen uniformly at random. x2i2i 2 i+1

Hot Topics in Peer-to-Peer Computing (HOT-P2P 2004) Volendam 08 October 2004 Neighbor of Neighbor (NoN) Greedy Routing Neighbor of Neighbor (NoN) Greedy Routing [MNW04] Let d(x,y) be a metric for the nodes in the network. 1. Assume the message is currently at node u ≠ target. 2. Let N = {v 1, v 2, …, v k } be the neighbors of u. 3. For each 1 ≤ i ≤ k, let w i1, w i2, …, w ik be the neighbors of v i and let N'= { w ij  1 ≤ i, j ≤ k}. 4. Among these k 2 +k nodes, assume that z is the one closest to the target (with respect to metric d). 5. If z  N route the message from u to z else z = w ij, for some i and j, and we route the message from u via v i to z.

Hot Topics in Peer-to-Peer Computing (HOT-P2P 2004) Volendam 08 October 2004 [MNW04]DegreeGreedy NoN Greedy R-Chord,R-Hypercube, Small World Percolation, Skip Graphs Symphony k < log N k < log N NoN-Greedy Routing

Hot Topics in Peer-to-Peer Computing (HOT-P2P 2004) Volendam 08 October 2004 Neighbor of Neighbor (NoN) Degree Cost of Neighbor of Neighbor lists: Memory: O(log 2 n) Maintenance: O(log n) must be updated Neighbor lists should be maintained (open connection, pinging, etc.) SMLKKDB03 “In practice, a Chord ring will never be in a stable state; instead, joins and departures will occur continuously, interleaved with the stabilization algorithm. The ring will not have time to stabilize before new changes happen.” [SMLKKDB03]

Hot Topics in Peer-to-Peer Computing (HOT-P2P 2004) Volendam 08 October 2004H-Schemes  We denote by j 1, j 2, …, j d all the jumps of our schemes (ordered by their size);  Let H() a good hash function that map an id on a sequence of m bits, for each 1 ≤ i ≤ d, node x is connected by edges to node x + j i +  (H(x)/2 m )*(j i+1 - j i )  x + j i +  (H(x)/2 m )*(j i+1 - j i )  [0,1) ijiiji i+1 j i+1

Hot Topics in Peer-to-Peer Computing (HOT-P2P 2004) Volendam 08 October 2004H-Schemes  Deterministic network  No additional information is transmitted nor stored:  Each node x, knowing y, can compute H(y) and then can estimate y’s neighbors.

Hot Topics in Peer-to-Peer Computing (HOT-P2P 2004) Volendam 08 October 2004 H-SchemesDegreeGreedy NoN Greedy H-Chord,H-Hypercube, H-Symphony k < log N k < log N NoN-Greedy Routing

Hot Topics in Peer-to-Peer Computing (HOT-P2P 2004) Volendam 08 October 2004 H-F-Chord(  ) Theorem 1: The average path length is O(log N/ log log N) hops for the NoN Greedy algorithm on H-F-Chord(  ) in a ring of size Fib(m) where the number of nodes alive is N < Fib(m). We show, by simulation, that H-F-Chord(  ) is more efficient than the corresponding F-Chord(  ) by a percentage that goes from 10% to 25% even for small N.

Hot Topics in Peer-to-Peer Computing (HOT-P2P 2004) Volendam 08 October 2004 H-F-Chord(  ) – APL optimality Case 1: d=d(s,t)<O(2 log n / loglog n ) we can use greedy routing d=d(s,t)<O(2 log n / loglog n ) we can use greedy routing Case 2: d’=d loglog n / log n Let v  [s, t] and let jv i a jump of v Pr[  i st jv i  ] > loglog n / log n Pr[  i st jv i  I ] > loglog n / log n s t s t d’ I d

Hot Topics in Peer-to-Peer Computing (HOT-P2P 2004) Volendam 08 October 2004 H-F-Chord(  ) – APL optimality s t d’ I Pr[s can reach I in two hops when d ≥O(2 log n / loglog n )] ≥ 1 – e -1 Hence after O(log d / loglog n) hops the distance is decreased to O(log n / loglog n) and we have reduced case 2 to case 1.

Hot Topics in Peer-to-Peer Computing (HOT-P2P 2004) Volendam 08 October 2004 Lower is better

Hot Topics in Peer-to-Peer Computing (HOT-P2P 2004) Volendam 08 October 2004 Lower is better

Hot Topics in Peer-to-Peer Computing (HOT-P2P 2004) Volendam 08 October 2004 Lower is better

Hot Topics in Peer-to-Peer Computing (HOT-P2P 2004) Volendam 08 October 2004 Lower is better

Hot Topics in Peer-to-Peer Computing (HOT-P2P 2004) Volendam 08 October 2004 Higher is better

Hot Topics in Peer-to-Peer Computing (HOT-P2P 2004) Volendam 08 October 2004Conclusions  H-F-Chord(  ):  Deterministic P2P network  Asymptotically optimal with respect to average path length and degree (No hidden constant)  Allows a trade-off between efficiency and maintenance  No overhead with respect to greedy routing system