Peer-peer and Application-level Networking CS 218 Fall 2003 Multicast Overlays P2P applications Napster, Gnutella, Robust Overlay Networks Distributed.

Slides:



Advertisements
Similar presentations
3-1 Design Principles Goals: r identify, study common architectural components, protocol mechanisms r what approaches do we find in network architectures?
Advertisements

Logically Centralized Control Class 2. Types of Networks ISP Networks – Entity only owns the switches – Throughput: 100GB-10TB – Heterogeneous devices:
1 Network Measurements in Overlay Networks Richard Cameron Craddock School of Electrical and Computer Engineering Georgia Institute of Technology.
1 Experimental Study of Internet Stability and Wide-Area Backbone Failure Craig Labovitz, Abha Ahuja Merit Network, Inc Presented by Changchun Zou.
Data Communications and Computer Networks Chapter 4 CS 3830 Lecture 22 Omar Meqdadi Department of Computer Science and Software Engineering University.
Lecture 6 Overlay Networks CPE 401/601 Computer Network Systems slides are modified from Jennifer Rexford.
Courtesy: Nick McKeown, Stanford
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-6600: Internet Protocols Informal Quiz #13: P2P and Sensor Networks Shivkumar Kalyanaraman:
15-441: Computer Networking Lecture 26: Networking Future.
EECS 122 Communications Networks Department of Electrical Engineering and Computer Sciences University of California Berkeley Slides: K. Fall, K. Lai,
1 Overlay Networks Reading: 9.4 COS 461: Computer Networks Spring 2008 (MW 1:30-2:50 in COS 105) Jennifer Rexford Teaching Assistants: Sunghwan Ihm and.
Network Layer4-1 Chapter 4 roadmap 4.1 Introduction and Network Service Models 4.2 Routing Principles 4.3 Hierarchical Routing 4.4 The Internet (IP) Protocol.
1 Overlay Networks Reading: 9.4 COS 461: Computer Networks Spring 2007 (MW 1:30-2:50 in Friend 004) Jennifer Rexford Teaching Assistant: Ioannis Avramopoulos.
IPv6 and Overlays EE122 Introduction to Communication Networks Discussion Section.
New Routing Architectures Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.
Efficient Content Location Using Interest-based Locality in Peer-to-Peer Systems Presented by: Lin Wing Kai.
Part III: Overlays, peer-to-peer
CSE331: Introduction to Networks and Security Lecture 7 Fall 2002.
E2E Routing Behavior in the Internet Vern Paxson Sigcomm 1996 Slides are adopted from Ion Stoica’s lecture at UCB.
Routing.
ROUTING PROTOCOL IGRP. REVIEW 4 Purpose of Router –determine best path to destination –pass the frames to the destination 4 Protocols –routed - used by.
Multipath Routing Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.
3-1 Part 1: Design Principles Goals: r identify, study common architectural components, protocol mechanisms r what approaches do we find in network architectures?
ROUTING PROTOCOLS Rizwan Rehman. Static routing  each router manually configured with a list of destinations and the next hop to reach those destinations.
Bandwidth DoS Attacks and Defenses Robert Morris Frans Kaashoek, Hari Balakrishnan, Students MIT LCS.
CS 268: Lecture 18 Measurement Studies on Internet Routing Ion Stoica Computer Science Division Department of Electrical Engineering and Computer Sciences.
Jennifer Rexford Fall 2010 (TTh 1:30-2:50 in COS 302) COS 561: Advanced Computer Networks Stub.
RON: Resilient Overlay Networks David Andersen, Hari Balakrishnan, Frans Kaashoek, and Robert Morris MIT Laboratory for Computer Science
NET-REPLAY: A NEW NETWORK PRIMITIVE Ashok Anand Aditya Akella University of Wisconsin, Madison.
Chapter 5 Link Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 Link Layer data center.
Communications Recap Duncan Smeed. Introduction 1-2 Chapter 1: Introduction Our goal: get “feel” and terminology more depth, detail later in course.
Introduction to Routing and Routing Protocols By Ashar Anwar.
CS An Overlay Routing Scheme For Moving Large Files Su Zhang Kai Xu.
Adaptive Failover Mechanism Motivation End-to-end connectivity can suffer during net failures Internet path outage detection and recovery is slow (shown.
CS 3214 Computer Systems Godmar Back Lecture 23. Announcements Project 5 due Dec 8 Exercise 10 handed out Exercise 11 coming before Thanksgiving CS 3214.
4: Network Layer4a-1 Hierarchical Routing r aggregate routers into regions, “autonomous systems” (AS) r routers in same AS run same routing protocol m.
RON: Resilient Overlay Networks David Andersen, Hari Balakrishnan, Frans Kaashoek, Robert Morris MIT Laboratory for Computer Science
RON: Resilient Overlay Networks David Andersen, Hari Balakrishnan, Frans Kaashoek, Robert Morris MIT Laboratory for Computer Science
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Chapter 13 Routing Protocols (RIP, OSPF, BGP)
Routing in the Internet The Global Internet consists of Autonomous Systems (AS) interconnected with eachother: Stub AS: small corporation Multihomed AS:
A Routing Underlay for Overlay Networks Akihiro Nakao Larry Peterson Andy Bavier SIGCOMM’03 Reviewer: Jing lu.
OVERVIEW Lecture 6 Overlay Networks. 2 Focus at the application level.
Resilient Overlay Networks By David Andersen, Hari Balakrishnan, Frans Kaashoek, and Robert Morris MIT RON Paper from ACM Oct Advanced Operating.
A comparison of overlay routing and multihoming route control Hayoung OH
ITI-510 Computer Networks ITI 510 – Computer Networks Meeting 3 Rutgers University Internet Institute Instructor: Chris Uriarte.
Networking Fundamentals. Basics Network – collection of nodes and links that cooperate for communication Nodes – computer systems –Internal (routers,
TCOM 509 – Internet Protocols (TCP/IP) Lecture 06_a Routing Protocols: RIP, OSPF, BGP Instructor: Dr. Li-Chuan Chen Date: 10/06/2003 Based in part upon.
Resilient Overlay Networks Robert Morris Frans Kaashoek and Hari Balakrishnan MIT LCS
Routers Operate in a Mesh –Many possible alternative routes between two stations Only One of Many Possible Alternative Routes Packet.
4: Network Layer4b-1 OSPF (Open Shortest Path First) r “open”: publicly available r Uses Link State algorithm m LS packet dissemination m Topology map.
CS 6401 Overlay Networks Outline Overlay networks overview Routing overlays Resilient Overlay Networks Content Distribution Networks.
ITI-510 Computer Networks ITI 510 – Computer Networks Meeting 3 Rutgers University Internet Institute Instructor: Chris Uriarte.
Two Peer-to-Peer Networking Approaches Ken Calvert Net Seminar, 23 October 2001 Note: Many slides “borrowed” from S. Ratnasamy’s Qualifying Exam talk.
ECE 374: Computer Networks & Internet Introduction Spring 2012 Prof. Michael Zink.
Chapter 25 Internet Routing. Static Routing manually configured routes that do not change Used by hosts whose routing table contains one static route.
Routing Algorithms Lecture Static/ Dynamic, Direct/ Indirect, Shortest Path Routing, Flooding, Distance Vector Routing, Link State Routing, Hierarchical.
Autonomous Systems An autonomous system is a region of the Internet that is administered by a single entity. Examples of autonomous regions are: UVA’s.
Course Review 2015 Computer networks 赵振刚
Chapter 4: Network Layer
A Comparison of Overlay Routing and Multihoming Route Control
CPE 401/601 Computer Network Systems
15-744: Computer Networking
© 2006 ITT Educational Services Inc.
Lecture 6 Overlay Networks
Lecture 6 Overlay Networks
COMPUTER NETWORKS CS610 Lecture-41 Hammad Khalid Khan.
Chapter 4: Network Layer
A Comparison of Overlay Routing and Multihoming Route Control
Research Issues in Middleware (Bhaskar)
Hari Balakrishnan Hari Balakrishnan Computer Networks
Presentation transcript:

Peer-peer and Application-level Networking CS 218 Fall 2003 Multicast Overlays P2P applications Napster, Gnutella, Robust Overlay Networks Distributed Hash Tables (DHT) Chord CAN Much of this material comes from UMASS class slides

Resilient Overlay Networks Overlay network: r applications, running at various sites r create “logical” links (e.g., TCP or UDP connections) pairwise between each other r each logical link: multiple physical links, routing defined by native Internet routing r let’s look at an example:

Internet Routing r BGP defines routes between stub networks UCLA Noho.net Berkeley.net UMass.net Internet 2 Mediaone C&W

Internet Routing r BGP defines routes between stub networks UCLA Noho.net Berkeley.net UMass.net Internet 2 Mediaone C&W Noho-to-UMass

Internet Routing r BGP defines routes between stub networks UCLA Noho.net Berkeley.net UMass.net Internet 2 Mediaone C&W Noho-to-Berkeley

Internet Routing Congestion or failure: Noho to Berkely BGP- determined route may not change (or will change slowly) UCLA Noho.net Berkeley.net UMass.net Internet 2 Mediaone C&W Noho-to-Berkeley

Internet Routing Congestion or failure: Noho to Berkely BGP- determined route may not change (or will change slowly) UCLA Noho.net Berkeley.net UMass.net Internet 2 Mediaone C&W Noho-to-Berkeley Noho to UMass to Berkeley r route not visible or available via BGP! r MediaOne can’t route to Berkeley via Internet2

RON: Resilient Overlay Networks Premise: by building application overlay network, can increase performance, reliability of routing Two-hop (application-level) noho-to-Berkeley route application-layer router

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

An order-of-magnitude fewer failures % % % % % % RON WorseNo Change RON BetterLoss Rate 30-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!

RON Research Issues How to design overlay networks? Measurement and self-configuration Understanding performance of underlying net. Fast fail-over. Sophisticated metrics. application-sensitive (e.g., delay versus throughput) path selection. Effect of RON on underlying network If everyone does RON, are we better off?