Examining The Tradeoffs Of Structured Overlays In A Dynamic Non-transitive Network Steve Gerding Jeremy Stribling {sgerding,

Slides:



Advertisements
Similar presentations
Copyright © 2003 Pearson Education, Inc. Slide 1 Computer Systems Organization & Architecture Chapters 8-12 John D. Carpinelli.
Advertisements

1 Routing in Multi-Radio, Multi-Hop Wireless Mesh Networks Richard Draves, Jitendra Padhye, and Brian Zill Microsoft Research.
Peer-to-peer networks Ant Rowstron Microsoft Research 1.
Reconsidering Reliable Transport Protocol in Heterogeneous Wireless Networks Wang Yang Tsinghua University 1.
Implementing Declarative Overlays Boon Thau Loo 1 Tyson Condie 1, Joseph M. Hellerstein 1,2, Petros Maniatis 2, Timothy Roscoe 2, Ion Stoica 1 1 University.
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science R3: Robust Replication Routing in Wireless Networks with Diverse Connectivity Characteristics.
1 A. Sshaikh, A. Greenberg; Nov 01 UCSC Sigcomm IMW Experience in Black-box OSPF Measurement Aman Shaikh, UCSC Albert Greenberg, AT&T Labs-Research.
An Alliance based Peering Scheme for P2P Live Media Streaming Darshan Purandare Ratan Guha University of Central Florida August 31, P2P-TV, Kyoto.
Scalable Routing In Delay Tolerant Networks
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Title Subtitle.
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
FACTORING ax2 + bx + c Think “unfoil” Work down, Show all steps.
Addition Facts
Year 6 mental test 5 second questions
Around the World AdditionSubtraction MultiplicationDivision AdditionSubtraction MultiplicationDivision.
Correctness of Gossip-Based Membership under Message Loss Maxim GurevichIdit Keidar Technion.
Brocade: Landmark Routing on Peer to Peer Networks Ben Y. Zhao Yitao Duan, Ling Huang, Anthony Joseph, John Kubiatowicz IPTPS, March 2002.
17 th International World Wide Web Conference 2008 Beijing, China XML Data Dissemination using Automata on top of Structured Overlay Networks Iris Miliaraki.
Dynamic Replica Placement for Scalable Content Delivery Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy, EECS Department.
Peer-to-Peer and Social Networks An overview of Gnutella.
Juan-Antonio CorderoPhilippe JacquetEmmanuel Baccelli Orlando, FL -- March 29 th, 2012 Impact of Jitter-based Techniques on Flooding over Wireless Ad hoc.
13 Copyright © 2005, Oracle. All rights reserved. Monitoring and Improving Performance.
Seungmi Choi PlanetLab - Overview, History, and Future Directions - Using PlanetLab for Network Research: Myths, Realities, and Best Practices.
ABC Technology Project
1 Generating Network Topologies That Obey Power LawsPalmer/Steffan Carnegie Mellon Generating Network Topologies That Obey Power Laws Christopher R. Palmer.
KIT – University of the State of Baden-Wuerttemberg and National Research Center of the Helmholtz Association Institute of Telematics, Department of Computer.
© 2006 Cisco Systems, Inc. All rights reserved. MPLS v MPLS VPN Technology Introducing MPLS VPN Architecture.
Countering DoS Attacks with Stateless Multipath Overlays Presented by Yan Zhang.
IP Multicast Information management 2 Groep T Leuven – Information department 2/14 Agenda •Why IP Multicast ? •Multicast fundamentals •Intradomain.
1 Analysis of Random Mobility Models with PDE's Michele Garetto Emilio Leonardi Politecnico di Torino Italy MobiHoc Firenze.
Luca Maria Aiello, Università degli Studi di Torino, Computer Science department 1 Tempering Kademlia with a robust identity based system.
BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS Budapest University of Technology and Economics Verification of RSTP Convergence and Scalability by Measurements.
1..
GG Consulting, LLC I-SUITE. Source: TEA SHARS Frequently asked questions 2.
Addition 1’s to 20.
25 seconds left…...
Week 1.
We will resume in: 25 Minutes.
©Brooks/Cole, 2001 Chapter 12 Derived Types-- Enumerated, Structure and Union.
Mani Srivastava UCLA - EE Department Room: 6731-H Boelter Hall Tel: WWW: Copyright 2003.
One Hop Lookups for Peer-to-Peer Overlays Anjali Gupta, Barbara Liskov, Rodrigo Rodrigues Laboratory for Computer Science, MIT.
A Measurement Study of Available Bandwidth Estimation Tools MIT - CSAIL with Jacob Strauss & Frans Kaashoek Dina Katabi.
Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan MIT and Berkeley presented by Daniel Figueiredo Chord: A Scalable Peer-to-peer.
Kademlia: A Peer-to-peer Information System Based on the XOR Metric.
Exploiting Route Redundancy via Structured Peer to Peer Overlays Ben Y. Zhao, Ling Huang, Jeremy Stribling, Anthony D. Joseph, and John D. Kubiatowicz.
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.
The Impact of DHT Routing Geometry on Resilience and Proximity New DHTs constantly proposed –CAN, Chord, Pastry, Tapestry, Plaxton, Viceroy, Kademlia,
Handling Churn in a DHT USENIX Annual Technical Conference June 29, 2004 Sean Rhea, Dennis Geels, Timothy Roscoe, and John Kubiatowicz UC Berkeley and.
Positive Feedback Loops in DHTs or Be Careful How You Simulate January 13, 2004 Sean Rhea, Dennis Geels, Timothy Roscoe, and John Kubiatowicz From “Handling.
The Impact of DHT Routing Geometry on Resilience and Proximity Krishna Gummadi, Ramakrishna Gummadi, Sylvia Ratnasamy, Steve Gribble, Scott Shenker, Ion.
1 Characterizing Selfishly Constructed Overlay Routing Networks March 11, 2004 Byung-Gon Chun, Rodrigo Fonseca, Ion Stoica, and John Kubiatowicz University.
Tapestry: A Resilient Global-scale Overlay for Service Deployment Ben Y. Zhao, Ling Huang, Jeremy Stribling, Sean C. Rhea, Anthony D. Joseph, and John.
SIMULATING A MOBILE PEER-TO-PEER NETWORK Simo Sibakov Department of Communications and Networking (Comnet) Helsinki University of Technology Supervisor:
Distributed Hash Table Systems Hui Zhang University of Southern California.
1 PASTRY. 2 Pastry paper “ Pastry: Scalable, decentralized object location and routing for large- scale peer-to-peer systems ” by Antony Rowstron (Microsoft.
Impact of Neighbor Selection on Performance and Resilience of Structured P2P Networks IPTPS Feb. 25, 2005 Byung-Gon Chun, Ben Y. Zhao, and John Kubiatowicz.
The Impact of DHT Routing Geometry on Resilience and Proximity K. Gummadi, R. Gummadi..,S.Gribble, S. Ratnasamy, S. Shenker, I. Stoica.
Using the Small-World Model to Improve Freenet Performance Hui Zhang Ashish Goel Ramesh Govindan USC.
Paper Survey of DHT Distributed Hash Table. Usages Directory service  Very little amount of information, such as URI, metadata, … Storage  Data, such.
Click to edit Master title style Multi-Destination Routing and the Design of Peer-to-Peer Overlays Authors John Buford Panasonic Princeton Lab, USA. Alan.
LOOKING UP DATA IN P2P SYSTEMS Hari Balakrishnan M. Frans Kaashoek David Karger Robert Morris Ion Stoica MIT LCS.
Data Structure of Chord  For each peer -successor link on the ring -predecessor link on the ring -for all i ∈ {0,..,m-1} Finger[i] := the peer following.
CS694 - DHT1 Distributed Hash Table Systems Hui Zhang University of Southern California.
Peer-to-Peer Protocol (P2PP) Salman Baset, Henning Schulzrinne Columbia University.
Incrementally Improving Lookup Latency in Distributed Hash Table Systems Hui Zhang 1, Ashish Goel 2, Ramesh Govindan 1 1 University of Southern California.
Impact of Neighbor Selection on Performance and Resilience of Structured P2P Networks Sushma Maramreddy.
An Overlay Infrastructure for Decentralized Object Location and Routing Ben Y. Zhao University of California at Santa Barbara.
P2P: Distributed Hash Tables
Presentation transcript:

Examining The Tradeoffs Of Structured Overlays In A Dynamic Non-transitive Network Steve Gerding Jeremy Stribling {sgerding,

[2 / 24] [sgerding, strib | ] Motivation P2P overlays are a hot topic in networking research However, overlay performance research is still young Relatively unexplored areas: Comparing several overlays in a fair setting, with a unified metric Examining their behavior under real, pathological conditions Determining how parameter tuning affects performance Important for system designers and wide area deployment

[3 / 24] [sgerding, strib | ] Our Goal Compare the performance of several structured P2P overlays under real world network conditions Explore the effects of parameter tuning for individual overlays Accomplished by: Gathering and analyzing data about real world network conditions Using this data to compare the overlays in simulation Analyzing the simulation results and drawing conclusions

[4 / 24] [sgerding, strib | ] Presentation Overview Related work Real world dataset: PlanetLab Overlays in brief: Chord, Tapestry, Kademlia, Kelips Experimental methodology Results Discussion Conclusions and future work

[5 / 24] [sgerding, strib | ] Related Work Gummadi et. al.: Effect of routing geometry on resilience, proximity The impact of DHT routing geometry on resilience and proximity, SIGCOMM 2003 Rhea et. al.: App-level bmarks to encourage quality implementations Structured peer-to-peer overlays need application-driven benchmarks, IPTPS 2003 Liben-Nowell et. al.: Chord stabilization traffic, with churn Analysis of the evolution of peer-to-peer systems, PODC 2002 Xu: Routing state vs. network diameter: log(n) asymptotically optimal On the fundamental tradeoffs between routing table size and network diameter, Infocom 2003 Countless structured and unstructured P2P overlays

[6 / 24] [sgerding, strib | ] Topology data obtained from the PlanetLab federated testbed Extracted from PlanetLab All-Pairs-Pings data ( Why is this interesting? Global-scale testbed Non-transitive links Time-varying latency data Real-world rates of churn (node failure and recovery) A low-bar scenario not yet fully understood for overlays! The PlanetLab Dataset ABC

[7 / 24] [sgerding, strib | ] The PlanetLab Dataset Observed properties of the PlanetLab testbed: Size of datasets Fully-connected: 159 Non-transitive: 248 Non-transitivity 9.9% of combinations are non-transitive Mean round trip time Fully-connected : ms Non-transitive: ms Churn rate MTTF: hours MTTR: 2.7 hours (Blind submission, SIGMETRICS 2004)

[8 / 24] [sgerding, strib | ] Overlays Chord TapestryKademlia Kelips

[9 / 24] [sgerding, strib | ] Overlays Properties of Chord (Stoica et. al., SIGCOMM 2001): Ring/Skiplist geometry Separates correctness (successors) and performance (finger table) log(n) state, log(n) hops Parameters Explored: Chord TapestryKademlia Kelips # successors4 – 32 Finger base2 – 128 Finger stabilization2 – 32 min Succlist stabilization1 – 32 min Recursive routingYes / No

[10 / 24] [sgerding, strib | ] Overlays Properties of Tapestry (Zhao et. al., UC Berkeley TR 2001): Tree-like geometry Rtg. table used for both correctness and performance Recursive routing log(n) state, log(n) hops Parameters Explored: Chord TapestryKademlia Kelips ID Base Stabilization2 – 32 min Backups per entry1 – 4 Backups used in lookups1 – 4

[11 / 24] [sgerding, strib | ] Overlays Properties of Kademlia (Maymounkov & Mazières, IPTPS 2002): XOR routing metric Lookups refresh routing state Iterative routing log(n) state, log(n) hops Parameters Explored: Chord TapestryKademlia Kelips k (bucket size)8 – 32 α (parallel lookups)1 – 5 Stabilization timer2 – 32 min Refresh rate2 – 32 min

[12 / 24] [sgerding, strib | ] Overlays Properties of Kelips (Gupta et. al., IPTPS 2003) : Nodes hashed into n ½ groups Keep contacts in each other group Use p2p gossip state maintenance O(n ½ ) state, 2 hops (Some of the) Parameters Explored: Chord TapestryKademlia Kelips Gossip interval.125 – 24 min Contacts per group2 – 8 New item gossip count0 - 4 Routing entry timeout5 – 40 min

[13 / 24] [sgerding, strib | ] p2psim, a discrete event simulator ( Simulates network delay Nodes generate lookups for random keys every 116 seconds As observed by Saroiu et. al. for Kazaa traffic An analysis of content delivery systems, OSDI 2002 Observed tradeoff between bandwidth and latency Background maintenance traffic Timeouts incurred during lookups Experimental Methodology

[14 / 24] [sgerding, strib | ] Baseline Results – Chord (Recursive)

[15 / 24] [sgerding, strib | ] Baseline Results - Tapestry

[16 / 24] [sgerding, strib | ] Baseline Results - Kademlia k = 8 k = 16 k = 32

[17 / 24] [sgerding, strib | ] Baseline Results - Kelips

[18 / 24] [sgerding, strib | ] Baseline Results - All

[19 / 24] [sgerding, strib | ] Churn Results - All

[20 / 24] [sgerding, strib | ] Non-transitive Results - All

[21 / 24] [sgerding, strib | ] Non-transitive + Churn Results - All

[22 / 24] [sgerding, strib | ] Discussion Performance of a particular protocol can vary widely Careful tuning of parameters greatly improves performance Low rate of churn on PlanetLab has little effect on most protocols Optimal configuration: Large number of neighbors (base) Low maintenance traffic (stabilization) Non-transitivity has a greater effect Recursive routing a big win Strictness of Chord hinders its performance

[23 / 24] [sgerding, strib | ] Future Work By next Friday Analysis of overlays in the presence of variable-latency links Data for Kademlia in churn scenario Future research topics More overlays (Koorde, one-hop, etc.) Effects of link failures Effects of asymmetric links Scaling simulation up to thousands of nodes Adaptive, self-tuning parameters

[24 / 24] [sgerding, strib | ] Summary Our goal: Explore the effects of real world conditions and parameter tuning on the performance of structured overlays Real world data was collected from the PlanetLab testbed Illustrated tradeoffs within and between four overlay protocols Non-transitivity has a large effect on performance Recommendations for system designers: Choose an appropriate overlay for target environment Carefully tune parameters for that overlay

[25 / 24] [sgerding, strib | ] C D B A Why Non-transitivity Breaks Chord