Jennifer Rexford Fall 2010 (TTh 1:30-2:50 in COS 302) COS 561: Advanced Computer Networks Stub.

Slides:



Advertisements
Similar presentations
Multihoming and Multi-path Routing
Advertisements

Multihoming and Multi-path Routing
Multihoming and Multi-path Routing CS 7260 Nick Feamster January
Routing Basics.
1 Interdomain Traffic Engineering with BGP By Behzad Akbari Spring 2011 These slides are based on the slides of Tim. G. Griffin (AT&T) and Shivkumar (RPI)
Network Layer: Internet-Wide Routing & BGP Dina Katabi & Sam Madden.
© J. Liebeherr, All rights reserved 1 Border Gateway Protocol This lecture is largely based on a BGP tutorial by T. Griffin from AT&T Research.
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.
1 Adapting Routing to the Traffic COS 461: Computer Networks Spring 2006 (MW 1:30-2:50 in Friend 109) Jennifer Rexford Teaching Assistant: Mike Wawrzoniak.
Traffic Engineering Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.
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.
CCNA 2 v3.1 Module 6.
New Routing Architectures Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.
CS335 Networking & Network Administration Tuesday, May 18, 2010.
Internet Routing (COS 598A) Today: Interdomain Traffic Engineering Jennifer Rexford Tuesdays/Thursdays.
Inherently Safe Backup Routing with BGP Lixin Gao (U. Mass Amherst) Timothy Griffin (AT&T Research) Jennifer Rexford (AT&T Research)
Internet Routing (COS 598A) Today: Multi-Homing Jennifer Rexford Tuesdays/Thursdays 11:00am-12:20pm.
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.
Backbone Networks Jennifer Rexford COS 461: Computer Networks Lectures: MW 10-10:50am in Architecture N101
Multipath Routing Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.
Jennifer Rexford Princeton University MW 11:00am-12:20pm Wide-Area Traffic Management COS 597E: Software Defined Networking.
Lecture Week 3 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts.
Routing of Outgoing Packets with MP-TCP draft-handley-mptcp-routing-00 Mark Handley Costin Raiciu Marcelo Bagnulo.
1 Semester 2 Module 6 Routing and Routing Protocols YuDa college of business James Chen
Fundamentals of Networking Discovery 2, Chapter 6 Routing.
Computer Networks Layering and Routing Dina Katabi
Each computer and router interface maintains an ARP table for Layer 2 communication The ARP table is only effective for the broadcast domain (or LAN)
Chapter 22 Network Layer: Delivery, Forwarding, and Routing
Introduction to Routing and Routing Protocols By Ashar Anwar.
6: Routing Working at a Small to Medium Business.
1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)
9/15/2015CS622 - MIRO Presentation1 Wen Xu and Jennifer Rexford Department of Computer Science Princeton University Chuck Short CS622 Dr. C. Edward Chow.
Routing and Routing Protocols Routing Protocols Overview.
M.Menelaou CCNA2 ROUTING. M.Menelaou ROUTING Routing is the process that a router uses to forward packets toward the destination network. A router makes.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 2 Module 6 Routing and Routing Protocols.
Cisco – Chapter 11 Routers All You Ever Wanted To Know But Were Afraid to Ask.
Routing protocols Basic Routing Routing Information Protocol (RIP) Open Shortest Path First (OSPF)
CCNA 1 Module 10 Routing Fundamentals and Subnets.
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks BGP.
Border Gateway Protocol (BGP) W.lilakiatsakun. BGP Basics (1) BGP is the protocol which is used to make core routing decisions on the Internet It involves.
Controlling the Impact of BGP Policy Changes on IP Traffic Jennifer Rexford IP Network Management and Performance AT&T Labs – Research; Florham Park, NJ.
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.
CCNA 2 Week 6 Routing Protocols. Copyright © 2005 University of Bolton Topics Static Routing Dynamic Routing Routing Protocols Overview.
Intradomain Traffic Engineering By Behzad Akbari These slides are based in part upon slides of J. Rexford (Princeton university)
6: Routing Working at a Small to Medium Business.
Routing and Routing Protocols
Jennifer Rexford Fall 2010 (TTh 1:30-2:50 in COS 302) COS 561: Advanced Computer Networks Backbone.
1 Version 3.1 Module 6 Routed & Routing Protocols.
Mike Freedman Fall 2012 COS 561: Advanced Computer Networks Traffic Engineering.
© 2005 Cisco Systems, Inc. All rights reserved. BGP v3.2—5-1 Customer-to-Provider Connectivity with BGP Connecting a Multihomed Customer to a Single Service.
Michael Schapira, Princeton University Fall 2010 (TTh 1:30-2:50 in COS 302) COS 561: Advanced Computer Networks
CHAPTER 6: STATIC ROUTING Static Routing 2 nd semester
Border Gateway Protocol
COS 561: Advanced Computer Networks
Interdomain Traffic Engineering with BGP
Routing.
COS 561: Advanced Computer Networks
COS 561: Advanced Computer Networks
COS 561: Advanced Computer Networks
COS 561: Advanced Computer Networks
COS 561: Advanced Computer Networks
BGP Policies Jennifer Rexford
BGP Interactions Jennifer Rexford
COS 461: Computer Networks
COS 561: Advanced Computer Networks
BGP Instability Jennifer Rexford
Routing.
Presentation transcript:

Jennifer Rexford Fall 2010 (TTh 1:30-2:50 in COS 302) COS 561: Advanced Computer Networks Stub Traffic Engineering

Why Connect to Multiple Providers? Reliability –Reduced fate sharing –Survive ISP failure Performance –Multiple paths –Select the best Financial –Leverage through competition –Game 95 th -percentile billing model Provider 1 Provider 2 Stub: an Autonomous System that does not provide transit

Outline Outbound traffic –Shortest-path routing –Primary and backup providers –Load balancing over multiple links Inbound traffic –Primary and backup providers –Selective advertising –BGP communities Looking forward –Control by routers vs. end hosts –Exposing greater path diversity –Stability of selfish routing

Controlling Outbound Traffic

Outbound Traffic: Pick a BGP Route Easier to control than inbound traffic –IP routing is destination based –Sender determines where the packets go Control only by selecting the next hop –Border router can pick the next-hop AS –Cannot control selection of the entire path Provider 1 Provider 2 “(2, 7, 8, 4)” “(1, 3, 4)”

Outbound Traffic: Shortest AS Path No import policy on border router –Pick route with shortest AS path –Arbitrary tie break (e.g., router-id) Performance? –Shortest path is not necessarily best –Propagation delay or congestion Load balancing? –Could lead to uneven split in traffic –E.g., one provider with shorter paths –E.g., too many ties with a skewed tie-break s d

Outbound Traffic: Primary and Backup Single policy for all prefixes –High local-pref for session to primary provider –Low load-pref for session to backup provider Outcome of BGP decision process –Choose the primary provider whenever possible –Use the backup provider when necessary But… –What if you want to balance traffic load? –What if you want to select better paths?

Outbound Traffic: Load Balancing Selectively use each provider –Assign local-pref across destination prefixes –Change the local-pref assignments over time Useful inputs to load balancing –End-to-end path performance data  E.g., active measurements along each path –Outbound traffic statistics per destination prefix  E.g., packet monitors or router-level support –Link capacity to each provider –Billing model of each provider

Outbound Traffic: What Kind of Probing? Lots of options –HTTP transfer –UDP traffic –TCP traffic –Traceroute –Ping Pros and cons for each –Accuracy –Overhead –Dropped by routers –Sets off intrusion detection systems How to monitor the “paths not taken”?

Outbound Traffic: How Often to Change? Stub ASes have no BGP customers –So, routing changes do not trigger BGP updates TCP flows that switch paths –Out-of-order packets during transition –Change in round-trip-time (RTT) Impact on the providers –Uncertainty in the offered load –Interaction with their own traffic engineering? Impact on other end users –Good: move traffic off of congested paths –Bad: potential oscillation as other stub ASes adapt?

Controlling Inbound Traffic

Inbound Traffic: Influencing Others Harder to control than outbound traffic –IP routing is destination based –Sender determines where the packets go Control only by influencing others’ decisions –Static configuration of the providers –BGP route attributes sent by the stub –Selective advertising of destination prefixes Provider 1 Provider 2

Inbound Traffic: Primary and Backup Ask your provider to be a backup –Provider violates “prefer customer” policy –… by assigning lower local-pref to customer –Backup link is only used if the primary link fails Provider 1 Provider /24 local-pref=90 local-pref=100 traffic

Inbound Traffic: AS Prepending Make one path look longer –Advertise short path one way –… and longer path another –In the hope of influencing choices –But, how much prepending to do? Provider 1 Provider 2 “ : (3)” “ : (3, 3, 3)”

Inbound Traffic: Prepending Fail Example where prepending doesn’t work –Customer does prepending of AS path –Provider has a “prefer customer” policy –Provider 2 prefers the longer path Provider 1 Provider 2 “ : (3)” “ : (3, 3, 3)” “ : (1, 3)”

Inbound Traffic: Programming Your Provider Better to have selective control over provider –Tell the provider whether to prefer your route –… on a per-prefix basis, with changes over time Enables adaptive load balancing –Without asking provider to reconfigure policy Provider 1 Provider /24

Inbound Traffic: BGP Communities Provider and customer agree on a “tag” –One tag mean “primary” and the other “backup” –Customer includes tags in BGP advertisements –Provider sets local preference based on tags BGP community attribute –Opaque attribute with no real meaning  Two numbers: usually AS number and arbitrary number –Sprint example (  1239:70 means “assign local pref of 70”  …  1239:110 means “assign local pref of 110” See RFC 1998

Example: ISP Setting Local-Pref Peer Customer Customers –110: Primary path –100: Secondary path –80: Primary backup path –70: Secondary backup path Peers –81-99: In between –Range for traffic engineering

Inbound Traffic: Selective Advertising When you don’t have enough prefixes… –Advertise one subnet to each provider –Advertise the supernet to both providers –Traffic splits due to the longest-prefix match –Supernet ensures backup connectivity after failure Provider 1 Provider / / / /17 Causes unwanted increase in global routing tables

Inbound Traffic: Multiple Addresses Multiple external addresses for a service –One IP address for each entry point Use DNS to adjust mapping of name to address –Give different answers to different clients –Adjust over time to performance, cost, traffic, etc. 20 Provider 1 Provider / /

Inbound Traffic: Tunneling Cooperation with sender –Sending network picks the ingress point –Encapsulates the packet with the interface address Advantages –Sender may know best Disadvantages –Requires cooperation –Failure recovery 21 Provider 1 Provider Encapsulate with or

Looking Forward 22

Greater Path Diversity Performance depends on the end-to-end path –Need greater path diversity How to get more paths? –Add more providers? (expensive) –Support multipath routing? Ways to support multipath routing –Source routing –Provider offering multipath as a service –Overlays (e.g., RON) –Deflecting packets through intermediate Ases –Etc. 23

Overlay Example: RON 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

Overlay Example: RON 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

Discussion: Who’s in Charge? Routers –Reduces complexity and overhead the end hosts –Avoids placing (unwarranted?) trust in end hosts –Managed based on an organization’s goals –Lower performance measurement overhead End hosts –Best equipped to judge if performance is good enough –Decisions customized to the specific application –Finer-granularity of load-balancing decisions –Monitor performance by observing their own traffic 26

Other Discussion At what layer or component (e.g., DNS, BGP, overlays, application, etc.)? How to get extra path diversity? Who pays for extra resources? How to prevent global inefficiency or instability? What is a good clean-slate solution? 27