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.

Slides:



Advertisements
Similar presentations
CPSC Network Layer4-1 IP addresses: how to get one? Q: How does a host get IP address? r hard-coded by system admin in a file m Windows: control-panel->network->configuration-
Advertisements

COS 461 Fall 1997 Routing COS 461 Fall 1997 Typical Structure.
Network Layer: Internet-Wide Routing & BGP Dina Katabi & Sam Madden.
Overlay/Underlay Interaction
Fundamentals of Computer Networks ECE 478/578 Lecture #18: Policy-Based Routing Instructor: Loukas Lazos Dept of Electrical and Computer Engineering University.
Lecture 6 Overlay Networks CPE 401/601 Computer Network Systems slides are modified from Jennifer Rexford.
1 Interdomain Routing Protocols. 2 Autonomous Systems An autonomous system (AS) is a region of the Internet that is administered by a single entity and.
TIE Breaking: Tunable Interdomain Egress Selection Renata Teixeira Laboratoire d’Informatique de Paris 6 Université Pierre et Marie Curie with Tim Griffin.
Traffic Engineering With Traditional IP Routing Protocols
Traffic Engineering Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.
Internet Routing (COS 598A) Today: Overlay Networks Jennifer Rexford Tuesdays/Thursdays 11:00am-12:20pm.
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.
1 Traffic Engineering for ISP Networks Jennifer Rexford IP Network Management and Performance AT&T Labs - Research; Florham Park, NJ
1 Policy-Based Path-Vector Routing Reading: Sections COS 461: Computer Networks Spring 2006 (MW 1:30-2:50 in Friend 109) Jennifer Rexford Teaching.
New Routing Architectures Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.
Dynamics of Hot-Potato Routing in IP Networks Renata Teixeira (UC San Diego) with Aman Shaikh (AT&T), Tim Griffin(Intel),
Link-State Routing Reading: Sections 4.2 and COS 461: Computer Networks Spring 2011 Mike Freedman
Internet Routing (COS 598A) Today: Multi-Homing Jennifer Rexford Tuesdays/Thursdays 11:00am-12:20pm.
Link-State Routing Reading: Sections 4.2 and COS 461: Computer Networks Spring 2010 (MW 3:00-4:20 in COS 105) Michael Freedman
Routing Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.
Network Monitoring for Internet Traffic Engineering Jennifer Rexford AT&T Labs – Research Florham Park, NJ 07932
Routing.
1 Interdomain Routing Policy Reading: Sections plus optional reading COS 461: Computer Networks Spring 2008 (MW 1:30-2:50 in COS 105) Jennifer Rexford.
Spring Routing & Switching Umar Kalim Dept. of Communication Systems Engineering 06/04/2007.
Backbone Networks Jennifer Rexford COS 461: Computer Networks Lectures: MW 10-10:50am in Architecture N101
Overlay Networks and Tunneling Reading: 4.5, 9.4 COS 461: Computer Networks Spring 2009 (MW 1:30-2:50 in COS 105) Mike Freedman Teaching Assistants: Wyatt.
Multipath Routing Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.
Multipath Protocol for Delay-Sensitive Traffic Jennifer Rexford Princeton University Joint work with Umar Javed, Martin Suchara, and Jiayue He
The Future of the Internet Jennifer Rexford ’91 Computer Science Department Princeton University
Stable Internet Routing Without Global Coordination Jennifer Rexford AT&T Labs--Research Joint work with Lixin Gao.
Interdomain Routing and the Border Gateway Protocol (BGP) Reading: Section COS 461: Computer Networks Spring 2011 Mike Freedman
Building a Strong Foundation for a Future Internet Jennifer Rexford ’91 Computer Science Department (and Electrical Engineering and the Center for IT Policy)
Jennifer Rexford Princeton University MW 11:00am-12:20pm Wide-Area Traffic Management COS 597E: Software Defined Networking.
ROUTING PROTOCOLS Rizwan Rehman. Static routing  each router manually configured with a list of destinations and the next hop to reach those destinations.
Jennifer Rexford Fall 2010 (TTh 1:30-2:50 in COS 302) COS 561: Advanced Computer Networks Stub.
Computer Networks Layering and Routing Dina Katabi
Chapter 22 Network Layer: Delivery, Forwarding, and Routing
Network Sensitivity to Hot-Potato Disruptions Renata Teixeira (UC San Diego) with Aman Shaikh (AT&T), Tim Griffin(Intel),
Authors Renata Teixeira, Aman Shaikh and Jennifer Rexford(AT&T), Tim Griffin(Intel) Presenter : Farrukh Shahzad.
Overlay network concept Case study: Distributed Hash table (DHT) Case study: Distributed Hash table (DHT)
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks BGP.
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.
Interdomain Routing Security. How Secure are BGP Security Protocols? Some strange assumptions? – Focused on attracting traffic from as many Ases as possible.
CSC 600 Internetworking with TCP/IP Unit 7: IPv6 (ch. 33) Dr. Cheer-Sun Yang Spring 2001.
Networking Fundamentals. Basics Network – collection of nodes and links that cooperate for communication Nodes – computer systems –Internal (routers,
Intradomain Traffic Engineering By Behzad Akbari These slides are based in part upon slides of J. Rexford (Princeton university)
Evolving Toward a Self-Managing Network Jennifer Rexford Princeton University
Data Communications and Computer Networks Chapter 4 CS 3830 Lecture 20 Omar Meqdadi Department of Computer Science and Software Engineering University.
Evolving Toward a Self-Managing Network Jennifer Rexford Princeton University
CS 6401 Overlay Networks Outline Overlay networks overview Routing overlays Resilient Overlay Networks Content Distribution Networks.
Mike Freedman Fall 2012 COS 561: Advanced Computer Networks Traffic Engineering.
1 Agenda for Today’s Lecture The rationale for BGP’s design –What is interdomain routing and why do we need it? –Why does BGP look the way it does? How.
Chapter 25 Internet Routing. Static Routing manually configured routes that do not change Used by hosts whose routing table contains one static route.
Michael Schapira, Princeton University Fall 2010 (TTh 1:30-2:50 in COS 302) COS 561: Advanced Computer Networks
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
1 Internet Routing: BGP Routing Convergence Jennifer Rexford Princeton University
CS 457 – Lecture 12 Routing Spring 2012.
Routing.
CPE 401/601 Computer Network Systems
COS 561: Advanced Computer Networks
Dynamic Routing and OSPF
COS 561: Advanced Computer Networks
Lecture 6 Overlay Networks
COS 561: Advanced Computer Networks
Backbone Networks Mike Freedman COS 461: Computer Networks
Lecture 6 Overlay Networks
EE 122: Lecture 22 (Overlay Networks)
BGP Instability Jennifer Rexford
Presentation transcript:

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

2 Goals of Today’s Lecture Limitations of IP routing and forwarding –Same paths used for all kinds of traffic –Routing protocols are oblivious to performance –Different ASes have different objectives –Routing changes lead to transient disruptions Motivations for overlay networks –Customized routing and forwarding solutions –Incremental deployment of new protocols Example overlay networks –Robust routing (e.g., Resilient Overlay Networks) –6Bone, Mbone, security, mobility

3 Two-Tiered Routing System IntradomainInterdomain ObjectivesEfficiency, performance, robustness Business relationships ScaleTens to hundreds of routers Tens of thousands of ASes TrustAll routers run by the same entity ASes run by different entities ProtocolsMetric-based (e.g., OSPF) Policy-based (e.g., BGP)

4 End-to-End Paths are a Composition Between the end hosts and the Internet Interdomain AS path across multiple ASes Intradomain path inside each transit ASes ClientWeb server

5 Delivering Packets in Stub Networks Inside the stub network –End hosts –Gateway routers gateway router campus Internet Gateway router picks from a small set of paths…

6 Interdomain Routing With BGP Each AS picks a “best path” to the destination Among the choices advertised by its neighbors Based on each ASes’ local policy objectives ClientWeb server

7 Intradomain Routing Routers compute shortest paths Based on configurable link weights Operators set weights to satisfy network goals

8 Routing Policy Constrains Paths Paths that violate policy cannot be used Some failures may disconnect hosts AT&T USLEC PU Yale AT&T Sprint Level3

9 Single-Path Routing is Restrictive BGP routers pick a single best path Shortest-path protocols use only shortest paths AT&T PU

10 Routing Doesn’t Consider Performance Routing protocols do not react to load –Routing based on routing policies or link weights –Static configuration that changes infrequently Routers have limited visibility –Routers cannot see the topology in other ASes –Routers do not keep state about performance Network operators weigh many objectives –Minimizing cost or maximizing revenue –Balancing load in the network –Not just the end-to-end performance

11 All Traffic Follows the Same Paths IP does destination-based forwarding –All traffic follows the same paths –Independent of the application requirements Yet, applications have different needs –Voice and gaming: low latency and loss –File sharing: high bandwidth low latency, but low throughput High throughput, but high latency

12 Disruptions During Convergence Changes to the network are disruptive –Topology changes, due to failures and recovery –Configuration changes, e.g., tweak link weights Routers have to reach agreement again –Detect the change in the network –Propagate new information among themselves In the meantime, performance suffers –Blackholes: packets dropped on the floor –Loops: packets spin around in a loop –Delays: packets take a circuitous path

13 Does IP Routing Really Stink? Some improvements would help –Multi-path routing –Adaptation to changes in load –Faster routing convergence But, IP routing is solving a hard problem –Decentralized control with common protocols –Different, sometime competing, objectives –Large scale (200,000 prefixes and 20,000 ASes) IP routing does an okay job for everyone –Rather than an optimal job for anyone –And leaves everything else to the end hosts…

14 Overlay Networks

15 Overlay Networks Focus at the application level

16 IP Tunneling to Build Overlay Links IP tunnel is a virtual point-to-point link –Illusion of a direct link between two separated nodes Encapsulation of the packet inside an IP datagram –Node B sends a packet to node E –… containing another packet as the payload A B E F tunnel Logical view: Physical view: A B E F

17 Tunnels Between End Hosts A C B Src: A Dest: B Src: A Dest: B Src: A Dest: C Src: A Dest: B Src: C Dest: B

18 Overlay Networks A logical network built on top of a physical network –Overlay links are tunnels through the underlying network Many logical networks may coexist at once –Over the same underlying network –And providing its own particular service Nodes are often end hosts –Acting as intermediate nodes that forward traffic –Providing a service, such as access to files Who controls the nodes providing service? –The party providing the service –Distributed collection of end users

19 Circumventing Policy Restrictions IP routing depends on AS routing policies –But hosts may pick paths that circumvent policies AT&T PU Patriot ISP me My buddy’s computer

20 Adapting to Network Conditions Start experiencing bad performance –Then, start forwarding through intermediate host A C B

21 Customizing to Applications VoIP traffic: low-latency path File sharing: high-bandwidth path A C B voice file sharing

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

23 How Does RON Work? Keeping it small to avoid scaling problems –A few friends who want better service –Just for their communication with each other –E.g., VoIP, gaming, collaborative work, etc. Send probes between each pair of hosts A C B

24 How Does Ron Work? Exchange the results of the probes –Each host shares results with every other host –Essentially running a link-state protocol! –So, every host knows the performance properties Forward through intermediate host when needed A C B B

25 RON Works in Practice Faster reaction to failure –RON reacts in a few seconds –BGP sometimes takes a few minutes Single-hop indirect routing –No need to go through many intermediate hosts –One extra hop circumvents the problems Better end-to-end paths –Circumventing routing policy restrictions –Sometimes the RON paths are actually shorter

26 RON Limited to Small Deployments Extra latency through intermediate hops –Software delays for packet forwarding –Propagation delay across the access link Overhead on the intermediate node –Imposing CPU and I/O load on the host –Consuming bandwidth on the access link Overhead for probing the virtual links –Bandwidth consumed by frequent probes –Trade-off between probe overhead and detection speed Possibility of causing instability –Moving traffic in response to poor performance –May lead to congestion on the new paths

27 Should All This Bother ISPs? Overlays circumventing routing policies –Sending traffic on paths that are not permitted –But, then again, the stub ASes are paying their bills! Overlays introducing unexpected shifts in traffic –Routing changes at multiple layers may interact –But, then again, small overlays may have little impact Overlays competing with provider services –Why pay for better performance, or commercial VoIP? –When you can get by with a little help from your friends –But, is the cost-performance trade-offs worth it?

28 Using Overlays to Evolve the Internet Internet needs to evolve –IPv6 –Security –Mobility –Multicast But, global change is hard –Coordination with many ASes –“Flag day” to deploy and enable the technology Instead, better to incrementally deploy –And find ways to bridge deployment gaps

29 6Bone: Deploying IPv6 over IP4 A B E F IPv6 tunnel Logical view: Physical view: A B E F IPv6 C D IPv4 Flow: X Src: A Dest: F data Flow: X Src: A Dest: F data Flow: X Src: A Dest: F data Src:B Dest: E Flow: X Src: A Dest: F data Src:B Dest: E A-to-B: IPv6 E-to-F: IPv6 B-to-C: IPv6 inside IPv4 B-to-C: IPv6 inside IPv4

30 Secure Communication Over Insecure Links Encrypt packets at entry and decrypt at exit Eavesdropper cannot snoop the data … or determine the real source and destination

31 Communicating With Mobile Users A mobile user changes locations frequently –So, the IP address of the machine changes often The user wants applications to continue running –So, the change in IP address needs to be hidden Solution: fixed gateway forwards packets –Gateway has a fixed IP address –… and keeps track of the mobile’s address changes gateway

32 IP Multicast Multicast –Delivering the same data to many receivers –Avoiding sending the same data many times IP multicast –Special addressing, forwarding, and routing schemes –Pretty complicated stuff (see Section 4.4) unicastmulticast

33 MBone: Multicast Backbone A catch-22 for deploying multicast –Router vendors wouldn’t support IP multicast –… since they weren’t sure anyone would use it –And, since it didn’t exist, nobody was using it Idea: software implementing multicast protocols –And unicast tunnels to traverse non-participants

34 Multicast Today Mbone applications starting in early 1990s –Primarily video conferencing –No longer operational Still many challenges to deploying IP multicast –Security vulnerabilities –Business models Application-layer multicast is more prevalent –Tree of servers delivering the content –Collection of end hosts cooperating to delivery video Some multicast within individual ASes –Financial sector: stock tickers –Within campuses or broadband networks: TV shows

35 Discussion Should we try to fix the underlying network? –Do overlays exist only because regular people aren’t allowed to change the way the network works? –Or, is it fundamentally hard to improve the network? Perhaps we can’t really do much better? –Even if we knew how to fix it, could we ever deploy the solution anyway? How should ISPs react to overlay services? –Happily charge money for the access bandwidth? –Offer overlay services of their own? –Make their networks simple and let the overlays adapt? –Add support to the routers to make overlays work better?

36 Conclusions Overlay networks –Tunnels between host computers –Hosts implement new protocols and services –Effective way to build networks on top of the Internet Benefits of overlay networks –Customization to the applications and users –Incremental deployment of new technologies –Ironically, may perform better than underlying network Next time –Peer-to-peer applications