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

Slides:



Advertisements
Similar presentations
Multihoming and Multi-path Routing
Advertisements

Path Splicing with Network Slicing Nick Feamster Murtaza Motiwala Santosh Vempala.
Multihoming and Multi-path Routing
Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan MIT and Berkeley presented by Daniel Figueiredo Chord: A Scalable Peer-to-peer.
1 Network Measurements in Overlay Networks Richard Cameron Craddock School of Electrical and Computer Engineering Georgia Institute of Technology.
1 Scalability is King. 2 Internet: Scalability Rules Scalability is : a critical factor in every decision Ease of deployment and interconnection The intelligence.
1 Experimental Study of Internet Stability and Wide-Area Backbone Failure Craig Labovitz, Abha Ahuja Merit Network, Inc Presented by Changchun Zou.
Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan Presented.
Lecture 6 Overlay Networks CPE 401/601 Computer Network Systems slides are modified from Jennifer Rexford.
The Structure of Networks with emphasis on information and social networks T-214-SINE Summer 2011 Chapter 8 Ýmir Vigfússon.
Towards a Logic for Wide-Area Internet Routing Nick Feamster and Hari Balakrishnan M.I.T. Computer Science and Artificial Intelligence Laboratory Kunal.
Reliable Distributed Systems Overlay Networks. Resilient Overlay Networks A hot new idea from MIT Shorthand name: RON Today: What’s a RON? Are these a.
The File Mover: An Efficient Data Transfer System for Grid Applications C. Anglano, M. Canonico Dipartimento di Informatica Universita' del Piemonte Orientale,
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Informed Detour Selection Helps Reliability Boulat A. Bash.
IPv6 and Overlays EE122 Introduction to Communication Networks Discussion Section.
New Routing Architectures Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.
L10: Protocols and Layering Dina Katabi Spring Some slides are from lectures by Nick Mckeown, Ion Stoica, Frans Kaashoek,
Part III: Overlays, peer-to-peer
Resilient Overlay Networks David Anderson, Hari Balakrishnan, Frank Kaashoek and Robert Morris. MIT Laboratory for Computer Science
E2E Routing Behavior in the Internet Vern Paxson Sigcomm 1996 Slides are adopted from Ion Stoica’s lecture at UCB.
A Routing Control Platform for Managing IP Networks Jennifer Rexford Princeton University
1 Routing as a Service Karthik Lakshminarayanan (with Ion Stoica and Scott Shenker) Sahara/i3 retreat, January 2004.
Reliable Transport Layers in Wireless Networks Mark Perillo Electrical and Computer Engineering.
Jennifer Rexford Princeton University MW 11:00am-12:20pm Wide-Area Traffic Management COS 597E: Software Defined Networking.
Bandwidth DoS Attacks and Defenses Robert Morris Frans Kaashoek, Hari Balakrishnan, Students MIT LCS.
The Structure of Networks with emphasis on information and social networks T-214-SINE Summer 2011 Chapter 8 Ýmir Vigfússon.
RON: Resilient Overlay Networks David Andersen, Hari Balakrishnan, Frans Kaashoek, and Robert Morris MIT Laboratory for Computer Science
Made with OpenOffice.org 1 TCP Multi-Home Options Arifumi Matsumoto Graduate School of Informatics, Kyoto University, Japan
Towards a Logic for Wide- Area Internet Routing Nick Feamster Hari Balakrishnan.
S305 – Network Infrastructure Chapter 5 Network and Transport Layers.
Improving the Reliability of Internet Paths with One-hop Source Routing Krishna Gummadi, Harsha Madhyastha Steve Gribble, Hank Levy, David Wetherall Department.
CS An Overlay Routing Scheme For Moving Large Files Su Zhang Kai Xu.
1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)
15-744: Computer Networking L-15 Changing the Network.
Web Application Firewall (WAF) RSA ® Conference 2013.
1 The Research on Analyzing Time- Series Data and Anomaly Detection in Internet Flow Yoshiaki HARADA Graduate School of Information Science and Electrical.
CCNA 1 Module 10 Routing Fundamentals and Subnets.
RON: Resilient Overlay Networks David Andersen, Hari Balakrishnan, Frans Kaashoek, Robert Morris MIT Laboratory for Computer Science
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks BGP.
L11: Link and Network layer Dina Katabi Spring Some slides are from lectures by Nick Mckeown, Ion Stoica, Frans Kaashoek,
A Routing Underlay for Overlay Networks Akihiro Nakao Larry Peterson Andy Bavier SIGCOMM’03 Reviewer: Jing lu.
Resilient Overlay Networks By David Andersen, Hari Balakrishnan, Frans Kaashoek, and Robert Morris MIT RON Paper from ACM Oct Advanced Operating.
Vytautas Valancius, Nick Feamster, Akihiro Nakao, and Jennifer Rexford.
A comparison of overlay routing and multihoming route control Hayoung OH
Reconsidering Internet Mobility Alex C. Snoeren, Hari Balakrishnan, M. Frans Kaashoek MIT Laboratory for Computer Science.
T. S. Eugene Ngeugeneng at cs.rice.edu Rice University1 COMP/ELEC 429/556 Introduction to Computer Networks Inter-domain routing Some slides used with.
Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan Presented.
Resilient Overlay Networks Robert Morris Frans Kaashoek and Hari Balakrishnan MIT LCS
CS 4396 Computer Networks Lab BGP. Inter-AS routing in the Internet: (BGP)
1 Wide Area Network Emulation on the Millennium Bhaskaran Raman Yan Chen Weidong Cui Randy Katz {bhaskar, yanchen, wdc, Millennium.
CS 6401 Overlay Networks Outline Overlay networks overview Routing overlays Resilient Overlay Networks Content Distribution Networks.
LOOKING UP DATA IN P2P SYSTEMS Hari Balakrishnan M. Frans Kaashoek David Karger Robert Morris Ion Stoica MIT LCS.
Peer-peer and Application-level Networking CS 218 Fall 2003 Multicast Overlays P2P applications Napster, Gnutella, Robust Overlay Networks Distributed.
© 2005 Cisco Systems, Inc. All rights reserved. BGP v3.2—2-1 BGP Transit Autonomous Systems Forwarding Packets in a Transit AS.
Overlay Networking Srinivasan Seetharaman Fall 2006.
1 Chapter 4: Internetworking (IP Routing) Dr. Rocky K. C. Chang 16 March 2004.
Chapter 4 Network Layer Computer Networking: A Top Down Approach 6th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 CPSC 335 Data Communication.
A Comparison of Overlay Routing and Multihoming Route Control
Kris, Karthik, Ansley, Sean, Jeremy Dick, David K, Frans, Hari
Overlay Networking Overview.
CPE 401/601 Computer Network Systems
15-744: Computer Networking
CS 268: Computer Networking
COS 561: Advanced Computer Networks
Overlay Infrastructure
COMP/ELEC 429/556 Introduction to Computer Networks
COS 461: Computer Networks
EE 122: Lecture 22 (Overlay Networks)
Exploiting Routing Redundancy via Structured Peer-to-Peer Overlays
Hari Balakrishnan Hari Balakrishnan Computer Networks
Presentation transcript:

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

Fault-tolerant Networking Network Any-to-any communication, routing around failures A B C D

The Internet Transit Mom-and-pop ISP Big ISP Really-big ISP everyone’s afraid of Peering Autonomous System (AS) BGP4 Scalability via aggressive aggregation and information hiding Commercial reality via peering & transit relationships Scalability via aggressive aggregation and information hiding Commercial reality via peering & transit relationships AS

How Robust is Internet Routing? 1.Slow outage detection and recovery 2.Inability to detect badly performing paths 3.Inability to efficiently leverage redundant paths 4.Inability to perform application-specific routing 5.Inability to express sophisticated routing policy Paxson % of all routes had serious problems Labovitz % of routes available < 95% of the time 65% of routes available < 99.9% of the time 3-min minimum detection+recovery time; often 15 mins 40% of outages took 30+ mins to repair Chandra 01 5% of faults last more than 2.75 hours

Our Goal To improve communication availability for small groups by at least a factor or 10 Many applications –Collaboration and conferencing –Virtual Private Networks (VPNs) across public Internet –Overlay Internet Service

RON: Routing Using Overlays Cooperating end-systems in different routing domains can conspire to do better than scalable wide-area protocols Types of failures –Outages: Configuration/operational errors, backhoes, etc. –Performance failures: Severe congestion, denial-of-service attacks, etc. Scalable BGP-based IP routing substrate Reliability via path monitoring and re-routing Reliability via path monitoring and re-routing Reliability via path monitoring and re-routing Reliability via path monitoring and re-routing

RON Design Prober Router Forwarder Conduit Link-state routing protocol, disseminates info using RON! Performance Database Application-specific routing tables Policy routing module RON library Nodes in different routing domains (ASes)

Many Research Questions Does the RON approach work at all? Each RON is small in size, no more than 50 or 100 nodes –How fast can failure detection & recovery happen? Policy routing –Doesn’t RON violate AUPs and other policies? Routing behavior –Can stable routing be achieved? –Implementing efficient multi-criteria routing Is it safe to deploy a large number of (small) interacting RONs on the Internet?

RON Deployment (19 sites).com (ca),.com (ca), dsl (or), cci (ut), aros (ut), utah.edu,.com (tx) cmu (pa), dsl (nc), nyu, cornell, cable (ma), cisco (ma), mit, vu.nl, lulea.se, ucl.uk, kaist.kr, univ-in-venezuela To vu.nl lulea.se ucl.uk To kaist.kr,.ve

RON Experiments Measure loss, latency, and throughput with and without RON 13 hosts in the US and Europe 3 days of measurements from data collected in March minute average loss rates –A 30 minute outage is very serious! Note: Experiments done with “No-Internet2- for-commercial-use” policy

RON greatly improves loss-rate 30-min average loss rate with RON 30-min average loss rate on Internet 13,000 samples RON loss rate never more than 30%

An order-of-magnitude fewer failures Loss Rate RON Better No Change RON Worse 10% % % % % % minute average loss rates 6,825 “path hours” represented here 12 “path hours” of essentially complete outage 76 “path hours” of TCP outage RON routed around all of these! One indirection hop provides almost all the benefit! 6,825 “path hours” represented here 12 “path hours” of essentially complete outage 76 “path hours” of TCP outage RON routed around all of these! One indirection hop provides almost all the benefit!

Resilience Against DoS Attacks

Conclusion Improved availability of Internet communication paths using small overlays –Layered above scalable IP substrate –RON provides a set of libraries and programs to facilitate this application-specific routing Experimental data suggest that this approach works –Over 10X availability –Outage detection and recovery in about 15 seconds –Able to route around certain denial-of-service attacks Many interesting questions remain…

Policy Routing Today, wide-area policy expression is a sledgehammer Policy control is important –From talking to some providers –E.g., rate control policy; Internet2, etc. True, RONs could violate AUPs But, the RON approach enables more flexible policies –More complex routing decisions; rate-based too –Multiple routing tables –Deeper packet inspection, etc.

Example

Throughput Improvement