Routing. Info 341 Networking and Distributed Applications. Addresses, fragmentation, reassembly. end-to-end communication UDP, TCP

Similar documents
Routing in the Internet

Routing Protocols of IGP. Koji OKAMURA Kyushu University, Japan

Top-Down Network Design, Ch. 7: Selecting Switching and Routing Protocols. Top-Down Network Design. Selecting Switching and Routing Protocols

Why dynamic route? (1)

Antonio Cianfrani. Routing Protocols

Topics for This Week

Internet Routing : Fundamentals of Computer Networks Bill Nace

Computer Networks ICS 651. IP Routing RIP OSPF BGP MPLS Internet Control Message Protocol IP Path MTU Discovery

Open Shortest Path First (OSPF)

CSc 450/550 Computer Networks Internet Routing

CS 43: Computer Networks Internet Routing. Kevin Webb Swarthmore College November 16, 2017

ICS 351: Today's plan. OSPF BGP Routing in general

Chapter 4: outline. Network Layer 4-1

Routing Protocols. Autonomous System (AS)

Novell TCP IP for Networking Professionals.

Routing(2) Inter-domain Routing

Chapter 4: Network Layer

ICS 351: Today's plan. OSPF BGP Routing in general routing protocol comparison encapsulation network dynamics

Computer Networking Introduction

EECS 122, Lecture 16. Link Costs and Metrics. Traffic-Sensitive Metrics. Traffic-Sensitive Metrics. Static Cost Metrics.

Basic Idea. Routing. Example. Routing by the Network

Routing by the Network

Introduction to Computer Networks

Introduction to Routing

Last time. Transitioning to IPv6. Routing. Tunneling. Gateways. Graph abstraction. Link-state routing. Distance-vector routing. Dijkstra's Algorithm

Inter-domain Routing. Outline. Border Gateway Protocol

CS 43: Computer Networks. 24: Internet Routing November 19, 2018

Chapter 7 Routing Protocols

Routing Protocol. Seiya Tsubone. Apr The University of Tokyo. Seiya Tsubone (The University of Tokyo) Routing Protocol Apr. 25.

Chapter 4: Network Layer. Lecture 12 Internet Routing Protocols. Chapter goals: understand principles behind network layer services:

Initial motivation: 32-bit address space soon to be completely allocated. Additional motivation:

CS555, Spring /5/2005. April 12, 2005 No classes attend Senior Design Projects conference. Chapter 4 roadmap. Internet AS Hierarchy

Department of Computer and IT Engineering University of Kurdistan. Computer Networks II Border Gateway protocol (BGP) By: Dr. Alireza Abdollahpouri

CS 43: Computer Networks Internet Routing. Kevin Webb Swarthmore College November 14, 2013

What is the difference between unicast and multicast? (P# 114)

IP Protocols. ALTTC/Oct

Introduction to Dynamic Routing Protocols

Unicast Routing. TCP/IP class

Routing. Jens A Andersson Communication Systems

Ravi Chandra cisco Systems Cisco Systems Confidential

Planning for Information Network

TCPIP Protocol Suite & Utilities. Revision no.: PPT/2K403/02

! Distance vector routing! Link state routing.! Path vector routing! BGP: Border Gateway Protocol! Route aggregation

Most important (cont d) What s most important in Project 1. Important for individuals. From from Most Important

Chapter IV: Network Layer

BGP. Daniel Zappala. CS 460 Computer Networking Brigham Young University

Finish Network Layer Start Transport Layer. CS158a Chris Pollett Apr 25, 2007.

Unit 3: Dynamic Routing

Interplay Between Routing, Forwarding

Important Lessons From Last Lecture Computer Networking. Outline. Routing Review. Routing hierarchy. Internet structure. External BGP (E-BGP)

Chapter 7: Routing Dynamically. Routing & Switching

Routing(2) Inter-domain Routing

Chapter 2 - Part 1. The TCP/IP Protocol: The Language of the Internet

Routing Unicast routing protocols

Inter-networking. Problem. 3&4-Internetworking.key - September 20, LAN s are great but. We want to connect them together. ...

HY 335 Φροντιστήριο 8 ο

ICS 351: Today's plan. distance-vector routing game link-state routing OSPF

CSCE 463/612 Networks and Distributed Processing Spring 2018

IP Addressing & Interdomain Routing. Next Topic

Internet Routing Protocols Tuba Saltürk

Internetworking Part 2

ICMP, ARP, RARP, IGMP

Routing(2) Inter-domain Routing

Lecture 19: Network Layer Routing in the Internet

Hierarchical Routing. Our routing study thus far - idealization all routers identical network flat not true in practice

Top-Down Network Design

Routing Protocols and

CS610 Computer Network Final Term Papers Solved MCQs with reference by Virtualians Social Network

Which of the following describe the process identifier that is used to run OSPF on a router? (Choose two)

The Network Layer. Internet solutions. Nixu Oy PL 21. (Mäkelänkatu 91) Helsinki, Finland. tel fax.

Routing Basics ISP/IXP Workshops

Routing. Directly Connected IP Networks. Data link layer routing. ifconfig command

Routing Concepts. IPv4 Routing Forwarding Some definitions Policy options Routing Protocols

BTEC Level 3 Extended Diploma

OSPF Protocol Overview on page 187. OSPF Standards on page 188. OSPF Area Terminology on page 188. OSPF Routing Algorithm on page 190

Routing Basics ISP/IXP Workshops

Routing Protocols --- Exterior Gateway Protocol

Routing. Advanced Computer Networks: Routing 1

Chapter 4: Advanced Internetworking. Networking CS 3470, Section 1

The Internet. The Internet is an interconnected collection of netw orks.

Introduction to routing in the Internet

Table of Contents. Cisco Introduction to EIGRP

Network Protocols. Routing. TDC375 Winter 2002 John Kristoff - DePaul University 1

PART III. Implementing Inter-Network Relationships with BGP

Lecture 4. The Network Layer (cont d)

Routing Basics. Routing Concepts. IPv4. IPv4 address format. A day in a life of a router. What does a router do? IPv4 Routing

Internetworking. different kinds of network technologies that can be interconnected by routers and other networking devices to create an internetwork

Scalability of Routing Protocols

IP Routing. Bharat S. Chaudhari International Institute of Information Technology Pune, India

Two types of routing protocols are used in internetworks: interior gateway protocols (IGPs) and exterior gateway protocols (EGPs).

Routing, Routing Algorithms & Protocols

Computer Networks II IPv4 routing

DATA COMMUNICATOIN NETWORKING

Introduction to OSPF

Overview. Problem: Find lowest cost path between two nodes Factors static: topology dynamic: load

CS 640: Introduction to Computer Networks. Intra-domain routing. Inter-domain Routing: Hierarchy. Aditya Akella

Lecture 4 The Network Layer. Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it

Introduction to routing in the Internet

CCNA 3 (v v6.0) Chapter 5 Exam Answers % Full

Windows NT Server Operating System. Server. Unicast Routing Principles. White Paper. Abstract

Transcription:

outing Info 341 Networking and Distributed Applications Context Layer 3 Addresses, fragmentation, reassembly Layer 4 end-to-end communication UDP, TCP outing At layer 3 Often relies on layer 4 Application Transport Internetwork Network Access Physical Internet eference Model 1

Two Types of outes Static outes Set at boot, don t change Dynamic outes Set at boot e-calculated as the network changes Static outing Most hosts (machines) use a static route What does the netmask do? What happens when the the destination machine is not on the same network? 2

Dynamic outes outing Protocols Solve the routing problem by allowing routers to communicate with each other They facilitate the discovery of additional routing connections Two outing Domains Interior & Exterior outing Logically separate Interior routing is for routes among routers that you control IGP - Interior Gateway Protocols Exterior routing is for the larger global networks EGP - Exterior Gateway Protocols 3

Interior/Exterior outing IGP EGP IGP Organization A (Autonomous System) Organization B (Autonomous System) outing Metrics How can we get an optimal route? outing Metric is the measure (weight) of a path used when choosing a route Hop count The number of hops to a destination Number of intermediate routers (hops) to get to the destination Administrative cost Manually set weight on the link Used to specifically control quantity of traffic over a link 4

IGP/EGP Metrics IGP An organization managing a set of machines (Autonomous System) is free to set their own metrics for route calculation EGP EGPs rarely bother to use metrics, rather just looking for the existence of a path IGP/EGP The most common EGP BGP (Border Gateway Protocol) Specifically between large systems Common IGPs OSPF - Open Shortest Path First IP - outing Information Protocol 5

Border Gateway Protocol (BGP) Characteristics outing among Autonomous Systems Policy Enforcement - either sender or receiver can enforce policy. A manager could set BGP to restrict route advertisements to limited other networks Transit outing - BGP allows networks to specify if they will (or won t) pass traffic to other networks eliable Transport - BGP uses TCP for communication of route information Database of Known outes Two maintainers Known routes can be searched through whois IPE NCC http://www.ripe.net/db/index.html AIN - American egistry of Internet Numbers http://www.arin.net/registration/route_reg/help.html Must have a registered AS 6

OSPF OSPF is a standard Open Shortest Path First IETF (Internet Engineering Task Force) FCs (equest For Comment) 1131, 1247, 1583, 2328 OSPF Characteristcs Full CID and Subnet Support - OSPF supports 32 bit addresses and masks Authenticated Exchanges - outers can be set to authenticate to each other before exchanging route information Imported outes - OSPF can allow routes learned from other protocols Link-State algorithm Admin assigned metrics 7

OSPF Mechanics Hierarchical Assignment Each router is assigned a level in a hierarchy The number of levels in an organization define the administrative area (responsibility) for each router There must be at least 2 levels in the hierarchy Logically this corresponds to the Internet (outside the organization) and LAN (inside the organization) Only routers at the same level in the hierarchy exchange data OSPF Mechanics oute Determination outers at the same level in the hierarchy exchange Link-State Advertisements (LSAs) Sometimes you can see these in Wireshark! The LSA indicates a link is live after some time without an LSA the link is assumed to be dead outers use the LSAs to build a graph representation of the known networks The Shortest-Paths algorithm is used to determine the best route to a known location 8

Why use OSPF? Hierarchical strategy Good for scalability, can handle many routers in an organization Limits scope of LSAs High administrative overhead and complex to implement, only high end devices typically support OSPF Because of the overhead, smaller organizations often pick IP IP The most simple Interior Gateway Protocol (IGP) One of the first TCP/IP routing protocols Originated in BSD Unix routed Has become a standard over time two different versions, IP1 and IP2 9

IP Characteristics Hop Count Metric - distance in hops Unreliable delivery through UDP Broadcast or Multicast delivery Support for default route propagation Passive route detection - by listening to route information IP Mechanics Each IP router periodically broadcasts its whole route table Sometimes you can see these in Wireshark! When a IP message is received, the router compares its internal table with the route table it received If the router that sent the IP message knows a shorter path to a network, accounting for the cost of sending to that router, then the new route replaces the old route Any route longer than 16 hops on the network is considered unreachable 10

IP Packet Format Quick implementation (just turn it on) Simple to run, but No security, broadcasts go to everyone Why use IP? When you have a large number of routers running IP, the IP messages get to be large and it can use a lot of broadcast IP doesn t scale well due to limit of 16 hops IP doesn t support variable length subnet masks! IP can t calculate routes based on throughput, reliability, or delay just number of hops 11