Kris, Karthik, Ansley, Sean, Jeremy Dick, David K, Frans, Hari

Slides:

Advertisements

Similar presentations

Brocade: Landmark Routing on Peer to Peer Networks Ben Y. Zhao Yitao Duan, Ling Huang, Anthony Joseph, John Kubiatowicz IPTPS, March 2002.

Advertisements

Geographic Routing Without Location Information AP, Sylvia, Ion, Scott and Christos.

Distributed Hash Tables

P2P data retrieval DHT (Distributed Hash Tables) Partially based on Hellerstein’s presentation at VLDB2004.

Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan MIT and Berkeley presented by Daniel Figueiredo Chord: A Scalable Peer-to-peer.

Pastry Peter Druschel, Rice University Antony Rowstron, Microsoft Research UK Some slides are borrowed from the original presentation by the authors.

Exploiting Route Redundancy via Structured Peer to Peer Overlays Ben Y. Zhao, Ling Huang, Jeremy Stribling, Anthony D. Joseph, and John D. Kubiatowicz.

Rapid Mobility via Type Indirection Ben Y. Zhao, Ling Huang, Anthony D. Joseph, John D. Kubiatowicz Computer Science Division, UC Berkeley IPTPS 2004.

Network Management Overview IACT 918 July 2004 Gene Awyzio SITACS University of Wollongong.

P2p, Spring 05 1 Topics in Database Systems: Data Management in Peer-to-Peer Systems March 29, 2005.

15-441: Computer Networking Lecture 26: Networking Future.

1 Link Layer & Network Layer Some slides are from lectures by Nick Mckeown, Ion Stoica, Frans Kaashoek, Hari Balakrishnan, and Sam Madden Prof. Dina Katabi.

Brocade Landmark Routing on Structured P2P Overlays Ben Zhao, Yitao Duan, Ling Huang Anthony Joseph and John Kubiatowicz (IPTPS 2002) Goals Improve routing.

1 Canon in G Major: Designing DHTs with Hierarchical Structure Prasanna Ganesan (Stanford University) Krishna Gummadi (U. of Washington) Hector Garcia-Molina.

Chord-over-Chord Overlay Sudhindra Rao Ph.D Qualifier Exam Department of ECECS.

SkipNet: A Scaleable Overlay Network With Practical Locality Properties Presented by Rachel Rubin CS294-4: Peer-to-Peer Systems By Nicholas Harvey, Michael.

Portland: A Scalable Fault-Tolerant Layer 2 Data Center Network Fabric Offense Kai Chen Shih-Chi Chen.

1 Routing as a Service Karthik Lakshminarayanan (with Ion Stoica and Scott Shenker) Sahara/i3 retreat, January 2004.

EPFL-I&C-LSIR [P-Grid.org] Workshop on Distributed Data and Structures ’04 NCCR-MICS [IP5] presented by Anwitaman Datta Joint work with Karl Aberer and.

Content Distribution March 8, : Application Layer1.

Peer-to-Peer Overlay Networks. Outline Overview of P2P overlay networks Applications of overlay networks Classification of overlay networks – Structured.

CS An Overlay Routing Scheme For Moving Large Files Su Zhang Kai Xu.

Overlay network concept Case study: Distributed Hash table (DHT) Case study: Distributed Hash table (DHT)

RON: Resilient Overlay Networks David Andersen, Hari Balakrishnan, Frans Kaashoek, Robert Morris MIT Laboratory for Computer Science

HAIR: Hierarchical Architecture for Internet Routing Anja Feldmann TU-Berlin / Deutsche Telekom Laboratories Randy Bush, Luca Cittadini, Olaf Maennel,

RON: Resilient Overlay Networks David Andersen, Hari Balakrishnan, Frans Kaashoek, Robert Morris MIT Laboratory for Computer Science

A Routing Underlay for Overlay Networks Akihiro Nakao Larry Peterson Andy Bavier SIGCOMM’03 Reviewer: Jing lu.

On Designing and Thwarting Worms using Co-ordination Jayanthkumar Kannan Karthik Lakshminarayanan {kjk,

Resilient Overlay Networks By David Andersen, Hari Balakrishnan, Frans Kaashoek, and Robert Morris MIT RON Paper from ACM Oct Advanced Operating.

Information-Centric Networks06b-1 Week 6 / Paper 2 A layered naming architecture for the Internet –Hari Balakrishnan, Karthik Lakshminarayanan, Sylvia.

Paper Survey of DHT Distributed Hash Table. Usages Directory service  Very little amount of information, such as URI, metadata, … Storage  Data, such.

Resilient Overlay Networks Robert Morris Frans Kaashoek and Hari Balakrishnan MIT LCS

Fundamental Network Improvements Summer 2012 Activity May 14, 2012.

1 Secure Peer-to-Peer File Sharing Frans Kaashoek, David Karger, Robert Morris, Ion Stoica, Hari Balakrishnan MIT Laboratory.

1 Distributed Hash Table CS780-3 Lecture Notes In courtesy of Heng Yin.

Protocol Requirements draft-bryan-p2psip-requirements-00.txt D. Bryan/SIPeerior-editor S. Baset/Columbia University M. Matuszewski/Nokia H. Sinnreich/Adobe.

Information-Centric Networks Section # 6.2: Evolved Naming & Resolution Instructor: George Xylomenos Department: Informatics.

Use Cases for High Bandwidth Query and Control of Core Networks Greg Bernstein, Grotto Networking Young Lee, Huawei draft-bernstein-alto-large-bandwidth-cases-00.txt.

On the Placement of Web Server Replicas Yu Cai. Paper On the Placement of Web Server Replicas Lili Qiu, Venkata N. Padmanabhan, Geoffrey M. Voelker Infocom.

IETF 55 Nov A Two-Level Architecture for Internet Signaling draft-braden-2level-signal-arch-01.txt Bob Braden, Bob Lindell USC Information.

1 Secure Peer-to-Peer File Sharing Frans Kaashoek, David Karger, Robert Morris, Ion Stoica, Hari Balakrishnan MIT Laboratory.

Querying the Internet with PIER CS294-4 Paul Burstein 11/10/2003.

Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.

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.

Naming for Mobile Systems

A Survey of Network Function Placement

Internet Indirection Infrastructure (i3)

Distributed Hash Tables

CS 268: Computer Networking

CHAPTER 3 Architectures for Distributed Systems

Plethora: Infrastructure and System Design

Infrastructure-based Resilient Routing

Early Measurements of a Cluster-based Architecture for P2P Systems

CPE 401/601 Computer Network Systems

Peer-to-Peer Protocol (P2PP)

Lecture 6 Overlay Networks

Structure Management for Scalable Overlay Service Construction

An Update on Multihoming in IPv6 Report on IETF Activity

Distributed Hash Tables

Rapid Mobility via Type Indirection

Lecture 6 Overlay Networks

Cross-Layer Interaction in Overlay Networks

EE 122: Lecture 22 (Overlay Networks)

Exploiting Routing Redundancy via Structured Peer-to-Peer Overlays

Structure Management for Scalable Overlay Service Construction

P2P: Distributed Hash Tables

Host and Small Network Relaying Howard C. Berkowitz

Research Issues in Middleware (Bhaskar)

Brocade: Landmark Routing on Peer to Peer Networks

Hari Balakrishnan Hari Balakrishnan Computer Networks

Presentation transcript:

Kris, Karthik, Ansley, Sean, Jeremy Dick, David K, Frans, Hari DHT Routing Kris, Karthik, Ansley, Sean, Jeremy Dick, David K, Frans, Hari

Churn Dealing w/ faults & failures App interface Proximity & topology Today’s Internet Tomorrow’s Internet Security

Churn Given: Evaluate performance in terms of: Churn model and rate Bandwidth consumption Application workload Evaluate performance in terms of: Lookup latency Insert latency Q: How do different techniques & protocols compare along these axes? What works best under each set of conditions? Example Structured DHT routing v. unstructured Do “ultra peers” make sense? One-hop routing v. log N routing + aggressive caching

Dealing with faults & failures Network partitions & failures Healing strategies Coping with non-transitive Internet routing Large discrepancies in node-to-node performance Mechanisms for choosing alternate paths when failures are detected?

Application Interface Generality How independent can applications be of DHT routing, and get acceptable performance? Should we study application-specific DHT routing? Should we shoot for one big DHT? Iterative v. recursive resolution Move the data through the overlay or not? Evolving the API from IPTPS-II k of N API Degree of redundancy in routing paths Traffic priorities within DHT

Proximity and topology Picking good Internet paths Picking good placement points Goal: Good performance & failure resilience What DHT techniques can be used? Scalable probing, synthetic coordinates,… What can the IP layer tell us (e.g., mapping info -- IP-layer topology, past failure statistics info, link bandwidths, etc.)

Interacting with today’s Internet Coping with network reality Coping with ISPs blocking/limiting P2P Coping with middleboxes, NATs, firewalls… Helping them cope Traffic engineering Congestion control, traffic prioritization within DHT P2P proxy caching Many coexisting, potentially competing

Internet architecture Q: Can DHTs help evolve the Internet architecture? Location-independent naming Use DHTs to enable informed application routing (e.g., weather service, outage avoidance, etc.) Stitching the Internet back together Across NATs, firewalls, middleboxes Do DHTs need policy routing?

Security See security group