Know thy Neighbor’s Neighbor Better Routing for Skip Graphs and Small Worlds Moni Naor Udi Wieder.

Slides:



Advertisements
Similar presentations
Salerno, 20/21/22 giugno Meeting WEBMINDS 2005 Degree-Optimal Deterministic Routing for P2P Systems Meeting WEBMINDS 2005 Salerno, 20/21/22 giugno Università
Advertisements

Routing Complexity of Faulty Networks Omer Angel Itai Benjamini Eran Ofek Udi Wieder The Weizmann Institute of Science.
The Capacity of Wireless Networks
Routing and Congestion Problems in General Networks Presented by Jun Zou CAS 744.
Scalable and Dynamic Quorum Systems Moni Naor & Udi Wieder The Weizmann Institute of Science.
1 Analyzing Kleinberg’s Small-world Model Chip Martel and Van Nguyen Computer Science Department; University of California at Davis.
Viceroy: Scalable Emulation of Butterfly Networks For Distributed Hash Tables By: Dahlia Malkhi, Moni Naor & David Ratajzcak Nov. 11, 2003 Presented by.
SKIP GRAPHS Slides adapted from the original slides by James Aspnes Gauri Shah.
Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs Chenyu Yan, Yang Xiang, and Feodor F. Dragan (WADS 2009) Kent State University, Kent,
Online Social Networks and Media Navigation in a small world.
Lookup in Small Worlds -- A Survey -- Pierre Fraigniaud CNRS, U. Paris Sud.
CS38 Introduction to Algorithms Lecture 5 April 15, 2014.
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.
Small-World Graphs for High Performance Networking Reem Alshahrani Kent State University.
Ad-Hoc Networks Beyond Unit Disk Graphs
Parallel Architectures: Topologies Heiko Schröder, 2003.
Parallel Architectures: Topologies Heiko Schröder, 2003.
1 Analyzing Kleinberg’s (and other) Small-world Models Chip Martel and Van Nguyen Computer Science Department; University of California at Davis.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Mobile Ad Hoc Networks Theory of Interferences, Trade-Offs between.
Exploring Tradeoffs in Failure Detection in P2P Networks Shelley Zhuang, Ion Stoica, Randy Katz HIIT Short Course August 18-20, 2003.
Parallel Routing Bruce, Chiu-Wing Sham. Overview Background Routing in parallel computers Routing in hypercube network –Bit-fixing routing algorithm –Randomized.
CSE 522 – Algorithmic and Economic Aspects of the Internet Instructors: Nicole Immorlica Mohammad Mahdian.
Exploring Tradeoffs in Failure Detection in P2P Networks Shelley Zhuang, Ion Stoica, Randy Katz Sahara Retreat January, 2003.
Ecs289m Spring, 2008 Social Network Models S. Felix Wu Computer Science Department University of California, Davis
Aggregating Information in Peer-to-Peer Systems for Improved Join and Leave Distributed Computing Group Keno Albrecht Ruedi Arnold Michael Gähwiler Roger.
Dept. of Computer Science Distributed Computing Group Asymptotically Optimal Mobile Ad-Hoc Routing Fabian Kuhn Roger Wattenhofer Aaron Zollinger.
A Note on Finding the Nearest Neighbor in Growth-Restricted Metrics Kirsten Hildrum John Kubiatowicz Sean Ma Satish Rao.
Know thy neighbor’s neighbor: Better Routing for Skip-Graphs and Small Worlds Αθανασόπουλος Διονύσης Καμωνά Λαμπρινή Φωτιάδου Αικατερίνη Moni Nao, Udi.
Viceroy: A scalable and dynamic emulation of the Butterfly Presented in CS294-4 by Sailesh Krishnamurthy Sep 22, 2003.
The Small World Phenomenon: An Algorithmic Perspective by Anton Karatoun.
1 Analyzing Kleinberg’s (and other) Small-world Models Chip Martel and Van Nguyen Computer Science Department; University of California at Davis.
Greedy Routing with Bounded Stretch Roland Flury, Roger Wattenhofer (ETH Zurich), Sriram Pemmaraju (Iowa University) Published at IEEE Infocom 2009 Introduction.
CPSC 689: Discrete Algorithms for Mobile and Wireless Systems Spring 2009 Prof. Jennifer Welch.
1 HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Christian Schindelhauer Algorithms for Radio Networks Winter Term 2005/2006.
1 Koorde: A Simple Degree Optimal DHT Frans Kaashoek, David Karger MIT Brought to you by the IRIS project.
Energy Efficient Routing and Self-Configuring Networks Stephen B. Wicker Bart Selman Terrence L. Fine Carla Gomes Bhaskar KrishnamachariDepartment of CS.
Proof of Kleinberg’s small-world theorems
Distributed Coloring Discrete Mathematics and Algorithms Seminar Melih Onus November
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.
Hot Topics in Peer-to-Peer Computing (HOT-P2P 2004) Volendam 08 October 2004 Non-uniform deterministic routing on F-Chord(  ) Gennaro Cordasco, Luisa.
CCAN: Cache-based CAN Using the Small World Model Shanghai Jiaotong University Internet Computing R&D Center.
Distributed Algorithms Rajmohan Rajaraman Northeastern University, Boston May 2012 Chennai Network Optimization WorkshopDistributed Algorithms1.
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
Navigation in small worlds Social Networks: Models and Applications Seminar Toronto, Fall 2007 (based on a presentation by Stratis Ioannidis)
Dynamic Networks for Peer-to-Peer Systems Pierre Fraigniaud CNRS LRI, Univ. Paris Sud Joint work with Philippe Gauron.
Chord Advanced issues. Analysis Theorem. Search takes O (log N) time (Note that in general, 2 m may be much larger than N) Proof. After log N forwarding.
Dynamic Networks for Peer-to-Peer Systems Pierre Fraigniaud CNRS Lab. de Recherche en Informatique (LRI) Univ. Paris-Sud, Orsay Joint work with Philippe.
Performance Evaluation Lecture 1: Complex Networks Giovanni Neglia INRIA – EPI Maestro 10 December 2012.
IPTPS 2005 Mirek Korzeniowski: Page 1 International Graduate School of Dynamic Intelligent Systems HEINZ NIXDORF INSTITUT University of Paderborn Algorithms.
CS694 - DHT1 Distributed Hash Table Systems Hui Zhang University of Southern California.
1 dBBlue:Low Diameter and Self-routing Bluetooth Scatternet Wen-Zhan Song, Xiang-Yang Li, Yu Wang and Weizhao Wang Department of Computer Science Illinois.
1 HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Christian Schindelhauer Algorithms for Radio Networks Winter Term 2005/2006.
Small-world phenomenon: An Algorithmic Perspective Jon Kleinberg.
Peer-to-Peer Networks 07 Degree Optimal Networks
Lecture 1: Complex Networks
Peer-to-Peer Networks 07 Degree Optimal Networks
Peer-to-Peer and Social Networks
SKIP GRAPHS James Aspnes Gauri Shah SODA 2003.
Greedy Routing with Bounded Stretch
Enumerating Distances Using Spanners of Bounded Degree
Chord Advanced issues.
Koorde: A simple degree optimal DHT
Chord Advanced issues.
Introduction Wireless Ad-Hoc Network
Chord Advanced issues.
Koorde: A Simple Degree Optimal DHT
Proof of Kleinberg’s small-world theorems
ECE 753: FAULT-TOLERANT COMPUTING
Presentation transcript:

Know thy Neighbor’s Neighbor Better Routing for Skip Graphs and Small Worlds Moni Naor Udi Wieder

Properties of Greedy O(1) O(log2n) O(log n) O(log n) Scheme Degree Greedy – path length Kleinberg’s Small world O(1) O(log2n) Randomized Chord O(log n) Skip Graph O(log n) Simple – to understand and to implement. Local – If source and target are close, the path remains within a small area in the keyspace. Howver, route not optimal with respect to the degree.

Can Greedy Routing be further shortened Question Can Greedy Routing be further shortened Without compromising the good properties? This paper examines this issue.

Optimal diameter For a graph in which each node has degree d, The optimal diameter is O(logdn) When d=log n, the optimal diameter is O(log n/log log n) Proof?

Neighbor of Neighbor (NoN) Routing Each node has a list of its neighbor’s neighbors.The message is routed greedily to the closest neighbor of neighbor (2 hops). This means: Let w1, w2, … wk be the neighbors of current node u For each wi find zi, the closest neighbor to target t Let j be such that zj is the closest to target t Route the message from u via wj to zj The first hop may not be a greedy choice.

Degree Optimal P2P Routing Different routing schemes Viceroy emulates the butterfly network Constant degree O(log n) hops for routing Constructions emulating De-Bruijn graphs Can achieve any degree/number of hops tradeoff In particular degree O(log n) and O(log n/ log log n) hops Routing is not greedy

Each node chooses a random string of bits. Skip-Graphs Each node (resource) has a name. Nodes are arranged on a line sorted by name. a b c d e f 1 Each node chooses a random string of bits. An edge is established if two nodes share a prefix which is not shared by the nodes between them.

Routing in Skip-Graphs Greedy Routing – use longest edge possible. Path length is (log n) w.h.p. 1 The NoN algorithm optimizes over two hops. Theorem: Using the NoN algorithm, the expected path length of any lookup is .

Skip Graphs – degree optimality = l o g d X - # of two hop paths between d and D - the event a message reached the node d. [ d l o g ; ] Lemma: Prob [ ( X > ) j D ] ¸ 1 2 Sufficiency of lemma: Call a NoN 2-hop successful if it reduces the distance from d to log d . Need O(log log n) succesful 2-hops to get to distance 1.

The Cost/Performance of NoN Cost of Neighbor of Neighbor lists: Memory: O(log2n) - marginally higher. Communication: Is it tantamount to squaring the degree? Neighbor lists should be maintained (open connection, pinging, etc.) NoN lists should only be kept up-to-date. Lazy updates: Updates occur only when communication load is low – supported by simulations. Networks of size 217 show 30-40% improvement

Conclusions NoN Greedy seems like an almost free tweak that is a good idea in many settings.