CS 457 Lecture 17 Global Internet. Fall 2011

Similar documents
Inter-domain Routing. Outline. Border Gateway Protocol

Outline. Internet Routing. Alleviating the Problem. DV Algorithm. Routing Information Protocol (RIP) Link State Routing. Routing algorithms

CSC458 Lecture 6. Homework #1 Grades. Inter-domain Routing IP Addressing. Administrivia. Midterm will Cover Following Topics

Route Discovery Protocols

Routing in Small Networks. Internet Routing Overview. Agenda. Routing in Large Networks

Exterior Gateway Protocols (BGP)

Lecture 8: Routing I Distance-vector Algorithms. CSE 123: Computer Networks Stefan Savage

ITRI CCL. IP Routing Primer. Paul C. Huang, Ph.D. ITRI / CCL / N300. CCL/N300; Paul Huang 1999/6/2 1

Routing with OSPF. Introduction

Internetworking and Internet-1. Global Addresses

Computer Network Foundation. Chun-Jen (James) Chung. Arizona State University

Module 7. Routing and Congestion Control. Version 2 CSE IIT, Kharagpur

6.263 Data Communication Networks

Introduction to TCP/IP

Border Gateway Protocol (BGP)

BGP. 1. Internet Routing

CLASSLESS INTER DOMAIN ROUTING - CIDR

CS Computer Networks 1: Routing Algorithms

VLSM and CIDR Malin Bornhager Halmstad University

COMP 631: COMPUTER NETWORKS. IP Addressing. Jasleen Kaur. Fall How to Deal With Heterogeneity & Scale?

Based on Computer Networking, 4 th Edition by Kurose and Ross

Routing Protocols (RIP, OSPF, BGP)

Distance Vector Routing Protocols. Routing Protocols and Concepts Ola Lundh

Cisco CCNP Optimizing Converged Cisco Networks (ONT)

Outline. EE 122: Interdomain Routing Protocol (BGP) BGP Routing. Internet is more complicated... Ion Stoica TAs: Junda Liu, DK Moon, David Zats

Computer Networks 1 (Mạng Máy Tính 1) Lectured by: Dr. Phạm Trần Vũ

Computer Networks. Main Functions

Introduction to Dynamic Routing Protocols

Dynamic Routing Protocols II OSPF. Distance Vector vs. Link State Routing

Network layer: Overview. Network layer functions IP Routing and forwarding

Router and Routing Basics

IP addressing. Interface: Connection between host, router and physical link. IP address: 32-bit identifier for host, router interface

Chapter 4. Distance Vector Routing Protocols

1. How many unique network IDs are there in class A addresses? # of unique hosts?

Routing Protocols. Interconnected ASes. Hierarchical Routing. Hierarchical Routing

Understanding Route Aggregation in BGP

OSPF Version 2 (RFC 2328) Describes Autonomous Systems (AS) topology. Propagated by flooding: Link State Advertisements (LSAs).

Inter-domain Routing Basics. Border Gateway Protocol. Inter-domain Routing Basics. Inter-domain Routing Basics. Exterior routing protocols created to:

Lecture 13: Distance-vector Routing. Lecture 13 Overview. Bellman-Ford Algorithm. d u (z) = min{c(u,v) + d v (z), c(u,w) + d w (z)}

Border Gateway Protocol (BGP-4)

Advanced Networking Routing: RIP, OSPF, Hierarchical routing, BGP

Internet Protocol (IP) IP - Network Layer. IP Routing. Advantages of Connectionless. CSCE 515: Computer Network Programming IP routing

Network layer. Assignment 3

IP Routing Configuring RIP, OSPF, BGP, and PBR

Advanced IP Addressing

CS551 External v.s. Internal BGP

O /27 [110/129] via , 00:00:05, Serial0/0/1

Internet Firewall CSIS Packet Filtering. Internet Firewall. Examples. Spring 2011 CSIS net15 1. Routers can implement packet filtering

Lecture 18: Border Gateway Protocol"

Active measurements: networks. Prof. Anja Feldmann, Ph.D. Dr. Nikolaos Chatzis Georgios Smaragdakis, Ph.D.

Address Scheme Planning for an ISP backbone Network

(Refer Slide Time: 02:17)

Introduction. Internet Address Depletion and CIDR. Introduction. Introduction

Transitioning to BGP. ISP Workshops. Last updated 24 April 2013

Layer 3 Routing User s Manual

BGP overview BGP operations BGP messages BGP decision algorithm BGP states

Week 4 / Paper 1. Open issues in Interdomain Routing: a survey

Introduction to LAN/WAN. Network Layer (part II)

IP Subnetting and Addressing

Computer Networks. Lecture 3: IP Protocol. Marcin Bieńkowski. Institute of Computer Science University of Wrocław

The Internet. Internet Technologies and Applications

BGP Terminology, Concepts, and Operation. Chapter , Cisco Systems, Inc. All rights reserved. Cisco Public

ICS 351: Today's plan

Course Overview: Learn the essential skills needed to set up, configure, support, and troubleshoot your TCP/IP-based network.

CSE331: Introduction to Networks and Security. Lecture 8 Fall 2006

Tutorial (03) IP addresses & Sub netting

Internet Control Message Protocol (ICMP)

IP Addressing Introductory material.

Chapter 10 Link-State Routing Protocols

AT&T IP Address Allocation/Assignment Policy

Internet Addresses (You should read Chapter 4 in Forouzan)

Introduction to Routing

OSPF Configuring Multi-Area OSPF

Datagram-based network layer: forwarding; routing. Additional function of VCbased network layer: call setup.

Administrative Distance

Computer Networks II Master degree in Computer Engineering Exam session: 11/02/2009 Teacher: Emiliano Trevisani. Student Identification number

IP Addressing. IP Addresses. Introductory material.

Introduction to The Internet

Introduction to The Internet. ISP/IXP Workshops

WHITE PAPER. Understanding IP Addressing: Everything You Ever Wanted To Know

Internet inter-as routing: BGP

Internet Protocol version 4 Part I

CS 348: Computer Networks. - IP addressing; 21 st Aug Instructor: Sridhar Iyer IIT Bombay

APNIC elearning: BGP Basics. Contact: erou03_v1.0

CS 5480/6480: Computer Networks Spring 2012 Homework 4 Solutions Due by 1:25 PM on April 11 th 2012

How To Understand Bg

Chapter 49 Border Gateway Protocol version 4 (BGP-4)

Interconnecting Cisco Networking Devices Part 2

Internet Protocol Address

BGP Best Path Selection Algorithm

CIDR: Classless Interdomain Routing

Lecture 12: Link-state Routing"

On Characterizing BGP Routing Table Growth Tian Bu, Lixin Gao, and Don Towsley University of Massachusetts, Amherst, MA 01003

A Case Study Design of Border Gateway Routing Protocol Using Simulation Technologies

256 4 = 4,294,967,296 ten billion = 18,446,744,073,709,551,616 ten quintillion. IP Addressing. IPv4 Address Classes

Chapter 3: Review of Important Networking Concepts. Magda El Zarki Dept. of CS UC Irvine

Link-State Routing Protocols

Dove siamo? Architecture of Dynamic Routing

Internet Peering, IPv6, and NATs. Mike Freedman V Networks

Transcription:

CS 457 Lecture 17 Global Internet Fall 2011

Distance Vector: Poison Reverse If Z routes through Y to get to X : Z tells Y its (Z s) distance to X is infinite (so Y won t route to X via Z) Still, can have problems when more than 2 routers are involved 60 X 4 Y 50 1 Z algorithm terminates

Comparison of LS and DV Message complexity LS: with n nodes, E links, O(nE) messages sent DV: exchange between neighbors only Convergence time varies Speed of Convergence LS: O(n 2 ) algorithm requires O(nE) messages DV: convergence time varies May be routing loops Count-to-infinity problem algorithms Robustness: what happens if router malfunctions? LS: Node can advertise incorrect link cost Each node computes only its own table DV: DV node can advertise incorrect path cost Each node s table used by others (error propagates)

Address Allocation

Hierarchical Addressing: IP Prefixes Divided into network & host portions (left and right) 12.34.158.0/24 is a 24-bit prefix with 2 8 addresses 12 34 158 5 00001100 00100010 10011110 00000101 Network (24 bits) Host (8 bits)

IP Address and 24-bit Subnet Mask Address! 12 34 158 5 00001100 00100010 10011110 00000101 11111111 11111111 11111111 00000000 Mask! 255 255 255 0

Classful Addressing In the olden days, only fixed allocation sizes Class A: 0* Very large /8 blocks (e.g., MIT has 18.0.0.0/8) Class B: 10* Large /16 blocks (e.g,. Princeton has 128.112.0.0/16) Class C: 110* Small /24 blocks (e.g., AT&T Labs has 192.20.225.0/24) Class D: 1110* Multicast groups Class E: 11110* Reserved for future use This is why folks use dotted-quad notation!

Classless Inter-Domain Routing (CIDR) Use two 32-bit numbers to represent a network. Network number = IP address + Mask IP Address : 12.4.0.0 IP Mask: 255.254.0.0 Address 00001100 00000100 00000000 00000000 Mask 11111111 11111110 00000000 00000000 Network Prefix for hosts Written as 12.4.0.0/15 8

CIDR: Hierarchal Address Allocation Prefixes are key to Internet scalability Address allocated in contiguous chunks (prefixes) Routing protocols and packet forwarding based on prefixes Today, routing tables contain ~250,000-300,00 prefixes 12.0.0.0/8 12.0.0.0/16 12.1.0.0/16 12.2.0.0/16 12.3.0.0/16 : : 12.254.0.0/16 12.3.0.0/24 12.3.1.0/24 : 12.3.254.0/24 12.253.0.0/19 12.253.32.0/19 12.253.64.0/19 12.253.96.0/19 12.253.128.0/19 12.253.160.0/19 : : : 9

Scalability Through Hierarchy Hierarchical addressing Critical for scalable system Don t require everyone to know everyone else Reduces amount of updating when something changes Non-uniform hierarchy Useful for heterogeneous networks of different sizes Initial class-based addressing was far too coarse Classless Inter Domain Routing (CIDR) helps Next few slides History of the number of globally-visible prefixes Plots are # of prefixes vs. time

Pre-CIDR (1988-1994): Steep Growth Growth faster than improvements in equipment capability

CIDR Deployed (1994-1996): Much Flatter Efforts to aggregate (even decreases after IETF meetings!)

CIDR Growth (1996-1998): Roughly Linear Good use of aggregation, and peer pressure in CIDR report

Boom Period (1998-2001): Steep Growth Internet boom and increased multi-homing

Long-Term View (1989-2011) From: http://bgp.potaroo.net/

Obtaining a Block of Addresses Separation of control Prefix: assigned to an institution Addresses: assigned by the institution to their nodes Who assigns prefixes? Internet Corporation for Assigned Names and Numbers Allocates large address blocks to Regional Internet Registries Regional Internet Registries (RIRs) E.g., ARIN (American Registry for Internet Numbers) Allocates address blocks within their regions Allocated to Internet Service Providers and large institutions Internet Service Providers (ISPs) Allocate address blocks to their customers Who may, in turn, allocate to their customers

Figuring Out Who Owns an Address Address registries Public record of address allocations Internet Service Providers (ISPs) should update when giving addresses to customers However, records are notoriously out-of-date Ways to query UNIX: whois h whois.arin.net 128.112.136.35 http://www.arin.net/whois/ http://www.geektools.com/whois.php

Example Output for 128.112.136.35 OrgName: Princeton University OrgID: PRNU Address: Office of Information Technology Address: 87 Prospect Avenue City: Princeton StateProv: NJ PostalCode: 08544-2007 Country: US NetRange: 128.112.0.0-128.112.255.255 CIDR: 128.112.0.0/16 NetName: PRINCETON NetHandle: NET-128-112-0-0-1 Parent: NET-128-0-0-0-0 NetType: Direct Allocation RegDate: 1986-02-24

Hard Policy Questions How much address space per geographic region? Equal amount per country? Proportional to the population? What about addresses already allocated? Address space portability? Keep your address block when you change providers? Pro: avoid having to renumber your equipment Con: reduces the effectiveness of address aggregation Keeping the address registries up to date? What about mergers and acquisitions? Delegation of address blocks to customers? As a result, the registries are horribly out of date Many Of These Questions Still Being Answered Let s understand how Internet routing works

Global Internet Routing Objective is to provide routes to prefixes Could be an IPv4 prefix Could be an IPv6 prefix Route should get you to the right?? Route to 129.82.0.0/16 should get you to ColoState Once here, packet may follow a RIP or OSPF route to the right subnet

Autonomous Systems What is an AS? a set of routers under a single technical administration uses an interior gateway protocol (IGP) and common metrics to route packets within the AS uses an exterior gateway protocol (EGP) to route packets to other AS s AS may use multiple IGPs and metrics, but appears as single AS to other AS s

Example 1 2 IGP 1.1 1.2 EGP IGP 2.1 2.2 2.2.1 5 IGP EGP EGP EGP 3 3.1 3.2 IGP EGP IGP 4.1 4.2 4 5.1 5.2

BGP Routing Choices Link state or distance vector? no universal metric - policy decisions Problems with distance-vector: Bellman-Ford algorithm slow to converge (counting to infinity problem) Problems with link state: metric used by routers not the same - loops LS database too large - entire Internet may expose policies to other AS s

What s Next Read Chapter 1, 2, 3, and 4.1-4.3 Next Lecture Topics from Chapter 4.4-4.6 Multicast, MPLS, and Routing Wrap-up Homework Due Thursday in lecture Project 2 Due Friday