CSE 461: Interdomain Routing

Slides:



Advertisements
Similar presentations
CS Summer 2003 CS672: MPLS Architecture, Applications and Fault-Tolerance.
Advertisements

Network Layer: Internet-Wide Routing & BGP Dina Katabi & Sam Madden.
Lecture 9 Overview. Hierarchical Routing scale – with 200 million destinations – can’t store all dests in routing tables! – routing table exchange would.
© 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.
INTERDOMAIN ROUTING POLICY COS 461: Computer Networks Spring 2010 (MW 3:00-4:20 in COS 105) Mike Freedman
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.
4a-1 CSE401: Computer Networks Hierarchical Routing & Routing in Internet S. M. Hasibul Haque Lecturer Dept. of CSE, BUET.
CS 164: Global Internet Slide Set In this set... More about subnets Classless Inter Domain Routing (CIDR) Border Gateway Protocol (BGP) Areas with.
Mini Introduction to BGP Michalis Faloutsos. What Is BGP?  Border Gateway Protocol BGP-4  The de-facto interdomain routing protocol  BGP enables policy.
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.
INTERDOMAIN ROUTING POLICY READING: SECTIONS PLUS OPTIONAL READING COS 461: Computer Networks Spring 2009 (MW 1:30-2:50 in COS 105) Mike Freedman.
CS335 Networking & Network Administration Tuesday, May 18, 2010.
Inherently Safe Backup Routing with BGP Lixin Gao (U. Mass Amherst) Timothy Griffin (AT&T Research) Jennifer Rexford (AT&T Research)
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 Exterior Gateway Protocols: EGP, BGP-4, CIDR Shivkumar Kalyanaraman Rensselaer Polytechnic Institute.
IP Addressing & Interdomain Routing. Next Topic  IP Addressing  Hierarchy (prefixes, class A, B, C, subnets)  Interdomain routing Physical Data Link.
Spring Routing & Switching Umar Kalim Dept. of Communication Systems Engineering 04/05/2007.
14 – Inter/Intra-AS 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.
© 2009 Cisco Systems, Inc. All rights reserved. ROUTE v1.0—6-1 Connecting an Enterprise Network to an ISP Network Considering the Advantages of Using BGP.
Interdomain Routing Policy COS 461: Computer Networks Spring 2011 Mike Freedman 1.
1 Internet Topology COS 461: Computer Networks Spring 2006 (MW 1:30-2:50 in Friend 109) Jennifer Rexford Teaching Assistant: Mike Wawrzoniak
Stable Internet Routing Without Global Coordination Jennifer Rexford AT&T Labs--Research Joint work with Lixin Gao.
1 ECE453 – Introduction to Computer Networks Lecture 10 – Network Layer (Routing II)
Computer Networks Layering and Routing Dina Katabi
Inter-domain Routing Outline Border Gateway Protocol.
1 Chapter 27 Internetwork Routing (Static and automatic routing; route propagation; BGP, RIP, OSPF; multicast routing)
Dr. John P. Abraham Professor University of Texas Pan American Internet Routing and Routing Protocols.
1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)
Introduction to BGP.
1 Interdomain Routing (BGP) By Behzad Akbari Fall 2008 These slides are based on the slides of Ion Stoica (UCB) and Shivkumar (RPI)
1 Chapter 27 Internetwork Routing (Static and automatic routing; route propagation; BGP, RIP, OSPF; multicast routing)
CS 3700 Networks and Distributed Systems Inter Domain Routing (It’s all about the Money) Revised 8/20/15.
Routing protocols Basic Routing Routing Information Protocol (RIP) Open Shortest Path First (OSPF)
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks BGP.
Border Gateway Protocol
Routing in the Internet The Global Internet consists of Autonomous Systems (AS) interconnected with eachother: Stub AS: small corporation Multihomed AS:
David Wetherall Professor of Computer Science & Engineering Introduction to Computer Networks Hierarchical Routing (§5.2.6)
1 Internet Routing. 2 Terminology Forwarding –Refers to datagram transfer –Performed by host or router –Uses routing table Routing –Refers to propagation.
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.
Network Layer4-1 Intra-AS Routing r Also known as Interior Gateway Protocols (IGP) r Most common Intra-AS routing protocols: m RIP: Routing Information.
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.
Internet Protocols. ICMP ICMP – Internet Control Message Protocol Each ICMP message is encapsulated in an IP packet – Treated like any other datagram,
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.
Routing in the Inernet Outcomes: –What are routing protocols used for Intra-ASs Routing in the Internet? –The Working Principle of RIP and OSPF –What is.
CS 640: Introduction to Computer Networks Aditya Akella Lecture 11 - Inter-Domain Routing - BGP (Border Gateway Protocol)
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.
Network Layer4-1 Chapter 4: Network Layer r 4. 1 Introduction r 4.2 Virtual circuit and datagram networks r 4.3 What’s inside a router r 4.4 IP: Internet.
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
Spring 2008CPE Computer Networks1 Routing: Part II Outline Algorithms Scalability Reading: Section 4.3.
Inter-domain Routing Outline Border Gateway Protocol.
CS 640: Introduction to Computer Networks Aditya Akella Lecture 11 - Inter-Domain Routing - BGP (Border Gateway Protocol)
Border Gateway Protocol BGP-4 BGP environment How BGP works BGP information BGP administration.
1 Internet Routing 4/12/2012. Admin. r Exam 2 date: m Wednesday, May 2 at 2:00 p.m. m If you want to take the exam in another day (e.g. due to travel),
1 Network Layer: Routing Intra- and Inter-Domain Routing Y. Richard Yang 4/18/2016.
1 Internet Routing 11/11/2009. Admin. r Assignment 3 2.
1 CS716 Advanced Computer Networks By Dr. Amir Qayyum.
Chapter 4: Network Layer
Border Gateway Protocol
ICMP ICMP – Internet Control Message Protocol
Chapter 4: Network Layer
COMP 3270 Computer Networks
Department of Computer and IT Engineering University of Kurdistan
COS 561: Advanced Computer Networks
Chapter 4: Network Layer
Chapter 4: Network Layer
COS 561: Advanced Computer Networks
Chapter 4: Network Layer
Network Layer: Internet Inter-Domain Routing
Presentation transcript:

CSE 461: Interdomain Routing

TCP Review: Thought Questions 1. Why do wireless networks often do link-layer re-tx? Hint: is loss always correlated with load? Write a server that accepts new TCP connections but never reads data. Then write a client that opens a TCP connection to that server, and writes forever. Why does write() finally stop working? Where is data stored at that point?

Routing: Scalability Concerns Routing burden grows with size of an inter-network Size of routing tables Volume of routing messages CPU time required for routing computation To scale to the size of the Internet, apply: Hierarchical addressing Route aggregation

Advantages: We can now aggregate routing information. 1/nth as many networks as hosts  fewer updates, smaller tables. Local changes don’t cause global updates. Networks 2, 3

2 2.2 2.3 2.4 2.1 Network 1 Network 3 Network 5 Network 4 The original Internet had exactly 1 level of hierarchy: Network Address and Host Address (Class A, B, C…) From the mid-90’s: CIDR allows arbitrary sub-networking. Further improves route aggregation in the Internet core. Network 4 Network 3 Network 5 Network 1 2 2.2 2.1.1 2.3 2.4 2.1 2.1.2 2.1.3

CIDR Example 128.220.192.0/20 128.220.192.0/19 Decimal Binary X and Y routes can be aggregated because they form a bigger contiguous range. Can only aggregate powers of 2  Corporation X (128.220.192.0 -> 128.220.207.255) 128.220.192.0/20 Border gateway Regional network (advertises path to 128.220.192.0 -> 128.220.223.255) Corporation Y 128.220.192.0/19 (128.220.208.0 -> 128.220.223.255) Decimal Binary 128.192 10000000 11000000 128.207 10000000 11001111 128.208 10000000 11010000 128.223 10000000 11011111 128.220.208.0/20

IP Forwarding Revisited Routing table now contains routes to “prefixes” IP address and length indicating what bits are fixed Now need to “search” routing table for longest matching prefix, only at routers Search routing table for the prefix that the destination belongs to, and use that to forward as before There can be multiple matches; take the longest prefix This is the IP forwarding routine used at routers.

Structure of the Internet Many (~30k) Autonomous Systems (ASes) or domains To scale, use hierarchy: separate inter-domain and intra-domain routing IGP (Interior gateway, within an AS) = RIP, OSPF EGP (Exterior gateway, between Ass) = BGP, EGP (obsolete) Large corporation “ Consumer ” ISP Peering point Backbone service provider Peering point “ Consumer ” ISP “ Consumer ” ISP Large corporation Small corporation

Internet Routing Architecture Divided into Autonomous Systems Distinct regions of administrative control Routers/links managed by a single “institution” Service provider, company, university, … Hierarchy of Autonomous Systems Large, tier-1 provider with a nationwide backbone Medium-sized regional provider with smaller backbone Small network run by a single company or university Interaction between Autonomous Systems Internal topology is not shared between ASes … but, neighboring ASes interact to coordinate routing

Inter-Domain Routing AS1 AS2 Border router Border router Border routers summarize and advertise internal routes to external neighbors and vice-versa Border routers apply policy Internal routers can use notion of default routes Core is “default-free”; routers must have a route to all networks in the world AS1 Border router Border router AS2

AS Topology Node: Autonomous System Edge: Two ASes that connect to each other 1 2 3 4 5 6 7

Interdomain Paths Path: 6, 5, 4, 3, 2, 1 Web server Client 4 3 5 2 7 6

Hierarchical Routing May Pay a Price for Path Quality AS path may be longer than shortest AS path Router path may be longer than shortest path 2 AS hops, 8 router hops d s 3 AS hops, 7 router hops

Border Gateway Protocol (BGP-4) Features: Path vector routing Application of policy Operates over reliable transport (TCP) Uses route aggregation (CIDR)

Internet Interdomain Routing: BGP BGP (Border Gateway Protocol): the de facto standard Path Vector protocol: similar to Distance Vector protocol a border gateway sends to a neighbor entire path (i.e., a sequence of ASes) to a destination, e.g., gateway X sends to neighbor N its path to dest. Z: path (X,Z) = X,Y1,Y2,Y3,…,Z if N selects path(X, Z) advertised by X, then: path (N,Z) = N, path (X,Z) Question: what are the implications of path vector? Z N X

Convergence Prefix P In AS X 1 2 X View from here 4 3 Recently, it was realized that BGP convergence can undergo a process analogous to count-to-infinity! AS 4 uses path 4 1 X. A link fails and 1 withdraws 4 1 X. So 4 uses 4 2 1 X, which is soon withdrawn, then 4 3 2 1 X, … Result is many invalid paths can be explored before convergence Prefix P In AS X 1 2 X View from here 4 3

BGP Routing Decision Process route selection policy: rank paths select best path routing cache export policy: which paths to export to which neighbors export path to neighbors

Business Relationships Neighboring ASes have business contracts How much traffic to carry Which destinations to reach How much money to pay Common business relationships Provider Customer E.g., UW is a customer of NTT E.g., MIT is a customer of Level 3 Peer E.g., AT&T is a peer of Sprint

Customer-Provider Relationship Customer needs to be reachable from everyone Provider tells all neighbors how to reach the customer Customer does not want to provide transit service Customer does not let its providers route through it Traffic to the customer Traffic from the customer advertisements d provider traffic provider customer d customer

Multi-Homing: Two or More Providers Motivations for multi-homing Extra reliability, survive single ISP failure Financial leverage through competition Better performance by selecting better path Gaming the 95th-percentile billing model What implication does this have for routing table size? Provider 1 Provider 2

Peer-Peer Relationship Peers exchange traffic between customers AS exports only customer routes to a peer AS exports a peer’s routes only to its customers Often the relationship is settlement-free (i.e., no $$$) Traffic to/from the peer and its customers advertisements peer peer traffic d

Implication of Business Relationship on Policies Route selection (ranking) policy: the typical route selection policy is to prefer customers over peers/providers to reach a destination, i.e., Customer > Peer > Provider Route export policy: since the export of a path to a neighbor is an indication that the AS is willing to transport traffic for the neighbor, an AS may not export routes to all neighbors

Typical Export Policies customer provider peer case 1: routes learned from customer routes learned from a customer are sent to all other neighbors case 2: routes learned from provider case 3: routes learned from peer provider customer peer peer provider customer routes learned from a provider are sent only to customers routes learned from a peer are sent only to customers

Example Export Policy: No-Valley Routing IP traffic A advertises path to C, but not P2 A advertises path to C, but not P1 A learns paths to C, P1, P2 A A advertises to C paths to P1 and P2 C Suppose P1 and P2 are providers of A; A is a provider of C

AS Structure: Tier-1 Providers Has no upstream provider of its own Typically has a national or international backbone UUNET, Sprint, AT&T, Level 3, … Top of the Internet hierarchy of 9-15 ASes Full peer-peer connections between tier-1 providers

AS Structure: Other ASes Tier-2 and Tier-3 providers Provide transit service to downstream customers … but, need at least one provider of their own Typically have national or regional scope E.g., Minnesota Regional Network Includes a few thousand of the Ases Stub ASes Do not provide transit service to others Connect to one or more upstream providers Includes vast majority (e.g., 85-90%) of the ASes

Characteristics of the AS Graph AS graph structure High variability in node degree (“power law”) A few very highly-connected ASes Many ASes have only a few connections 1 All ASes have 1 or more neighbors 0.1 CCDF 0.01 Very few have degree >= 100 0.001 AS degree 1 10 100 1000

www.cidr-report.org November 2008 Core BGP Table Growth 1994 - 2008 www.cidr-report.org November 2008

% of Entries that advertise /24s www.cidr-report.org November 2008

Begging for Aggregation --- 13Nov08 --- ASnum   NetsNow   NetsAggr   NetGain   % Gain   Description   Table   287512   176594   110918   38.6%   All ASes AS4538   5057   874   4183   82.7%   ERX-CERNET-BKB China Education and Research Network Center AS6389   4372   358   4014   91.8%   BELLSOUTH-NET-BLK - BellSouth.net Inc. AS209   3038   1350   1688   55.6%   ASN-QWEST - Qwest Communications Corporation AS6298   2100   729   1371   65.3%   ASN-CXA-PH-6298-CBS - Cox Communications Inc. AS17488   1409   290   1119   79.4%   HATHWAY-NET-AP Hathway IP Over Cable Internet AS4755   1320   239   1081   81.9%   TATACOMM-AS TATA Communications formerly VSNL is Leading ISP AS1785   1695   618   1077   63.5%   AS-PAETEC-NET - PaeTec Communications, Inc. www.cidr-report.org November 2008

Key Concepts Internet is a collection of Autonomous Systems (ASes) Policy dominates routing at the AS level Structural hierarchy helps make routing scalable BGP routes between autonomous systems (ASes)