COMP/ELEC 429/556 Introduction to Computer Networks

Slides:



Advertisements
Similar presentations
Network Layer: Internet-Wide Routing & BGP Dina Katabi & Sam Madden.
Advertisements

CS540/TE630 Computer Network Architecture Spring 2009 Tu/Th 10:30am-Noon Sue Moon.
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.
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.
Chapter 4: Network Layer 4. 1 Introduction 4.2 Virtual circuit and datagram networks 4.3 What’s inside a router 4.4 IP: Internet Protocol –Datagram format.
CS 164: Global Internet Slide Set In this set... More about subnets Classless Inter Domain Routing (CIDR) Border Gateway Protocol (BGP) Areas with.
Ion Stoica October 2, 2002 (* this presentation is based on Lakshmi Subramanian’s slides) EE 122: Inter-domain routing – Border Gateway Protocol (BGP)
Computer Networks Layering and Routing Dina Katabi
Chapter 22 Network Layer: Delivery, Forwarding, and Routing
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)
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)
Routing in the Internet The Global Internet consists of Autonomous Systems (AS) interconnected with eachother: Stub AS: small corporation Multihomed AS:
1 Internet Routing. 2 Terminology Forwarding –Refers to datagram transfer –Performed by host or router –Uses routing table Routing –Refers to propagation.
More on Internet Routing A large portion of this lecture material comes from BGP tutorial given by Philip Smith from Cisco (ftp://ftp- eng.cisco.com/pfs/seminars/APRICOT2004.
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.
CS 4396 Computer Networks Lab BGP. Inter-AS routing in the Internet: (BGP)
ICS 156: Networking Lab Magda El Zarki Professor, ICS UC, Irvine.
Internet Protocols. ICMP ICMP – Internet Control Message Protocol Each ICMP message is encapsulated in an IP packet – Treated like any other datagram,
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.
Routing Algorithms and IP Addressing Routing Algorithms must be ▪ Correctness ▪ Simplicity ▪ Robustness ▪ Stability ▪ Fairness ▪ Optimality.
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.
1 © 2004, Cisco Systems, Inc. All rights reserved. CCNA 1 Module 10 Routing Fundamentals and Subnets.
Text BGP Basics. Document Name CONFIDENTIAL Border Gateway Protocol (BGP) Introduction to BGP BGP Neighbor Establishment Process BGP Message Types BGP.
1 Internet Routing 11/11/2009. Admin. r Assignment 3 2.
1 CS716 Advanced Computer Networks By Dr. Amir Qayyum.
Routing in the Internet
14 – Inter/Intra-AS Routing
Chapter 4: Network Layer
NAT – Network Address Translation
CS 3700 Networks and Distributed Systems
COMP/ELEC 429 Introduction to Computer Networks
2017 session 1 TELE3118: Network Technologies Week 6: Network Layer Control Plane Inter-Domain Routing Protocols Some slides have been adapted from:
Border Gateway Protocol
CS 3700 Networks and Distributed Systems
Homework 4 Out: Fri 2/26/2016 In: Fri 3/11/2016.
Border Gateway Protocol
ICMP ICMP – Internet Control Message Protocol
Chapter 4: Network Layer
CS4470 Computer Networking Protocols
COS 561: Advanced Computer Networks
BGP supplement Abhigyan Sharma.
Net 323 D: Networks Protocols
Lixin Gao ECE Dept. UMASS, Amherst
Routing.
Net 323 D: Networks Protocols
CSCI-1680 Network Layer: Inter-domain Routing
Department of Computer and IT Engineering University of Kurdistan
COS 561: Advanced Computer Networks
Routers Routing algorithms
Dynamic Routing and OSPF
Part 4: Network Layer Part B: The Internet Routing Protocols
Inter-domain Routing Outline Homework #3 solutions
Chapter 4: Network Layer
Chapter 4: Network Layer
Routing Fundamentals and Subnets
COS 561: Advanced Computer Networks
Chapter 4: Network Layer
CSCI-1680 Network Layer: Inter-domain Routing
CMPE 252A : Computer Networks
BGP Instability Jennifer Rexford
Computer Networks Protocols
Routing.
Network Layer: Internet Inter-Domain Routing
Presentation transcript:

COMP/ELEC 429/556 Introduction to Computer Networks Inter-domain routing Some slides used with permissions from Edward W. Knightly, T. S. Eugene Ng, Ion Stoica, Hui Zhang T. S. Eugene Ng eugeneng at cs.rice.edu Rice University

Previous focus: Intra-Domain Routing Interior router Border router AS-1 AS-3 AS-2 Intra-domain routing protocol aka Interior Gateway Protocol (IGP) T. S. Eugene Ng eugeneng at cs.rice.edu Rice University

Today’s focus: Inter-Domain Routing Interior router Border router AS-1 AS-3 AS-2 T. S. Eugene Ng eugeneng at cs.rice.edu Rice University

Inter-Domain Routing Considerations Global connectivity is at stake Inevitably leads to one single protocol that everyone must speak Unlike many choices in intra-domain routing What are the requirements? Scalability Flexibility in choosing routes If you were to choose, link state based or distance vector based? Border Gateway Protocol (BGP) A hybrid between link state and distance vector “Path vector” T. S. Eugene Ng eugeneng at cs.rice.edu Rice University

Border Gateway Protocol Part I: E-BGP AS2 AS1 E-BGP border router interior router Two types of routers Border router, Interior router T. S. Eugene Ng eugeneng at cs.rice.edu Rice University

Border Gateway Protocol Part II: I-BGP AS2 AS1 E-BGP I-BGP border router interior router Two types of routers Border router, Interior router T. S. Eugene Ng eugeneng at cs.rice.edu Rice University

BGP Operations (Simplified) Establish session on TCP port 179 AS1 BGP session Exchange all active routes AS2 While connection is ALIVE exchange route UPDATE messages Exchange incremental updates T. S. Eugene Ng eugeneng at cs.rice.edu Rice University

Destination IP address prefix + attributes values BGP Update Messages Update : Announcing new routes or withdrawing previously announced routes. Update = Destination IP address prefix + attributes values (e.g. a routing path) T. S. Eugene Ng eugeneng at cs.rice.edu Rice University

Part I: E-BGP, Share connectivity information across ASs you can reach net prefix A via addr and the path is “AS2” AS2 AS1 E-BGP addr A R1 BGP table at R1: dest network prefix AS path next hop A AS2 addr T. S. Eugene Ng eugeneng at cs.rice.edu Rice University

Part II: I-BGP, Carrying Info within an AS E-BGP update I-BGP used to disseminate learned routes to all routers in AS I-BGP updates T. S. Eugene Ng eugeneng at cs.rice.edu Rice University

Part II: I-BGP, Carrying Info within an AS you can reach net B via addr1 and the path is “AS3” you can reach net B via addr2 and the path is “AS3 AS2” E-BGP E-BGP you can reach net B via addr1 and the path is “AS3” addr2 A AS1 AS2 addr1 AS3 B T. S. Eugene Ng eugeneng at cs.rice.edu Rice University

Attributes are Used to Select Best Routes 192.0.2.0/24 pick me! 192.0.2.0/24 pick me! 192.0.2.0/24 pick me! Given multiple routes to the same prefix, a BGP speaker must pick at most one best route 192.0.2.0/24 pick me! T. S. Eugene Ng eugeneng at cs.rice.edu Rice University

Example: Multiple AS Paths 128.2/16 AS701 AS7018 128.2/16 9 701 128.2/16 9 7018 1239 AS1239 AS73 Default choice: Pick shortest path T. S. Eugene Ng eugeneng at cs.rice.edu Rice University

Shorter Doesn’t Always Mean better Is path 4 1 better than path 3 2 1? AS 4 AS 3 AS 2 AS 1 AS can use custom policies other than shortest path T. S. Eugene Ng eugeneng at cs.rice.edu Rice University

Benefits of BGP Design Path Vector style routing Advantages: Distance vector algorithm with extra information For each route, store the complete path (ASs) Advantages: can make policy choices (choose among many possible learned paths) based on set of ASs in path can easily avoid loops T. S. Eugene Ng eugeneng at cs.rice.edu Rice University

Announcing and Choosing Routes BGP may learn many different paths for a destination network Learns only reachability information, no performance metrics Not about optimizing anything All about policy (business and politics) What a BGP speaker announces or not announces to a neighbor determines what routes may get used by that neighbor Router chooses among paths based on policy T. S. Eugene Ng eugeneng at cs.rice.edu Rice University

Nontransit vs. Transit ASes ISP 2 Internet Service providers (often) are transit networks ISP 1 NET A Nontransit AS might be a corporate or campus network. Traffic NEVER flows from ISP 1 through NET A to ISP 2 (At least not intentionally!) IP traffic T. S. Eugene Ng eugeneng at cs.rice.edu Rice University

Selective Transit NET A NET B NET C NET A provides transit between NET B and NET C and between NET D and NET C NET A DOES NOT provide transit Between NET D and NET B NET A IP traffic NET D Most transit networks transit in a selective manner… T. S. Eugene Ng eugeneng at cs.rice.edu Rice University

Customers and Providers IP traffic Customer pays provider for access to the Internet T. S. Eugene Ng eugeneng at cs.rice.edu Rice University

The Peering Relationship customer provider Peers provide transit between their respective customers Peers do not provide transit between peers Peers (often) do not exchange $$$ traffic allowed traffic NOT allowed T. S. Eugene Ng eugeneng at cs.rice.edu Rice University

Peering Provides Shortcuts customer provider Peering also allows connectivity between the customers of “Tier 1” providers. T. S. Eugene Ng eugeneng at cs.rice.edu Rice University

Import Routes provider route customer route peer route ISP route From T. S. Eugene Ng eugeneng at cs.rice.edu Rice University

Export Routes provider route peer route customer route ISP route To From provider To peer To peer To customer To customer filters block T. S. Eugene Ng eugeneng at cs.rice.edu Rice University

How can routes be marked as “provider”, “peer”, “customer”, “isp” ? Use “Community Attribute” in route announcement Used for signaling within and between ASs A community attribute is 32 bits By convention, first 16 bits is ASN indicating who is giving it an interpretation community number Very flexible BECAUSE it has no predefined meaning T. S. Eugene Ng eugeneng at cs.rice.edu Rice University

BGP Issues BGP designed for policy not performance Susceptible to router misconfiguration Blackholes: announce a route you cannot reach Slow convergence time Rate limiting and route flap dampening T. S. Eugene Ng eugeneng at cs.rice.edu Rice University

Combining IGP and BGP BGP Process IGP Process OS kernel BGP Routing tables IGP Process IGP Routing tables OS kernel Forwarding Table Manager Forwarding Table T. S. Eugene Ng eugeneng at cs.rice.edu Rice University

Combine BGP and IGP Tables to Create Forwarding Table I-BGP: 135.207.0.0/16 Next Hop = 192.0.2.1 135.207.0.0/16 E-BGP IGP 10.10.10.10 192.0.2.0/30 destination next hop 10.10.10.10 AS 1 AS 2 192.0.2.1 192.0.2.0/30 Forwarding Table 135.207.0.0/16 destination next hop 10.10.10.10 192.0.2.0/30 BGP 192.0.2.1 135.207.0.0/16 destination next hop + T. S. Eugene Ng eugeneng at cs.rice.edu Rice University

Life Cycle of a Packet in the Internet Address Resolution Protocol (ARP) On the same subnet, need to map IP address to MAC (e.g. Ethernet) address Host and router have ARP cache to store the IP-MAC pairs In case of no match in ARP cache, broadcast an ARP request with the IP address in question and the device with the IP address will reply with its MAC address 192.168.0.3 10.0.88.6 168.7.151.15 79.1.21.46 168.7.151.12 192.168.0.9 10.0.88.1 10.0.88.10 79.1.21.56 192.168.0.1 192.168.0.16 10.0.88.14 T. S. Eugene Ng eugeneng at cs.rice.edu Rice University

Life Cycle of a Packet in the Internet For each hop in the network, do the following steps: Decapsulate the Ethernet frame to get the IP header (except no need to do this at the source) Check routing table by the destination IP address, get the next-hop IP address and the network interface Learn the MAC address of the next hop (look up in ARP cache or broadcast an ARP request) Encapsulate the IP packet into an Ethernet frame with the destination MAC address Send the Ethernet frame out from the next-hop network interface 192.168.0.3 10.0.88.6 168.7.151.15 79.1.21.46 168.7.151.12 192.168.0.9 10.0.88.1 10.0.88.10 79.1.21.56 192.168.0.1 192.168.0.16 10.0.88.14 T. S. Eugene Ng eugeneng at cs.rice.edu Rice University