Routing protocols Basic Routing Routing Information Protocol (RIP) Open Shortest Path First (OSPF)

Slides:



Advertisements
Similar presentations
Lecture 9 Overview. Hierarchical Routing scale – with 200 million destinations – can’t store all dests in routing tables! – routing table exchange would.
Advertisements

Courtesy: Nick McKeown, Stanford
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.1 Routing Working at a Small-to-Medium Business or ISP – Chapter 6.
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.
4a-1 CSE401: Computer Networks Hierarchical Routing & Routing in Internet S. M. Hasibul Haque Lecturer Dept. of CSE, BUET.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization –All routers are identical –Network is flat. Not true in Practice Hierarchical.
Routing So how does the network layer do its business?
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.
CSCE 515: Computer Network Programming Chin-Tser Huang University of South Carolina.
RD-CSY3021 Comparing Routing Protocols. RD-CSY3021 Criteria used to compare routing protocols includes  Time to convergence  Proprietary/open standards.
Routing and Routing Protocols
Routing.
COS 420 Day 17. Agenda Finished Grading Individualized Projects Very large disparity in student grading No two students had same ranking for other students.
14 – Inter/Intra-AS Routing
COS 420 Day 13. Agenda Assignment 3 Posted Covers chapters Due March 23 2 Days till Daytona Beach Bike Week Midterm Exam is Due Today Today we will.
Lecture Week 3 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts.
1 ECE453 – Introduction to Computer Networks Lecture 10 – Network Layer (Routing II)
1 Relates to Lab 4. This module covers link state routing and the Open Shortest Path First (OSPF) routing protocol. Dynamic Routing Protocols II OSPF.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Routing in the Internet Internal Routing Protocols.
Fundamentals of Networking Discovery 2, Chapter 6 Routing.
Delivery, Forwarding and
TCP/IP Protocol Suite 1 Chapter 14 Upon completion you will be able to: Unicast Routing Protocols: RIP, OSPF, and BGP Distinguish between intra and interdomain.
ROUTING BASICS. Why are Routers Necessary? One of the key components of the technical infrastructure of the network One of the key components of the technical.
1 CS 4396 Computer Networks Lab Dynamic Routing Protocols - II OSPF.
6: Routing Working at a Small to Medium Business.
1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)
Routing/Routed Protocols. Remember: A Routed Protocol – defines logical addressing. Most notable example on the test – IP A Routing Protocol – fills the.
Chapter 8 Communication Networks and Services Internet Routing Protocols DHCP, NAT, and Mobile IP.
Unicast Routing Protocols  A routing protocol is a combination of rules and procedures that lets routers in the internet inform each other of changes.
Introduction to BGP.
Routing and Routing Protocols Routing Protocols Overview.
1 Introducing Routing 1. Dynamic routing - information is learned from other routers, and routing protocols adjust routes automatically. 2. Static routing.
Code : STM#520-1 Samsung Electronics Co., Ltd. OfficeServ7400 Router Operation Distribution EnglishED01.
RIP2 (Routing Information Protocol) Team Agile. Routing Protocols Link State – OSPF – ISIS Distance vector – RIP (version 1 and 2) – IGRP (Cisco Proprietary)
Routing in the Internet The Global Internet consists of Autonomous Systems (AS) interconnected with eachother: Stub AS: small corporation Multihomed AS:
Introduction to OSPF Nishal Goburdhan. Routing and Forwarding Routing is not the same as Forwarding Routing is the building of maps Each routing protocol.
1 Internet Routing. 2 Terminology Forwarding –Refers to datagram transfer –Performed by host or router –Uses routing table Routing –Refers to propagation.
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.
7400 Samsung Confidential & Proprietary Information Copyright 2006, All Rights Reserved. -0/35- OfficeServ 7x00 Enterprise IP Solutions Quick Install Guide.
CCNA 2 Week 6 Routing Protocols. Copyright © 2005 University of Bolton Topics Static Routing Dynamic Routing Routing Protocols Overview.
6: Routing Working at a Small to Medium Business.
ICS 156: Networking Lab Magda El Zarki Professor, ICS UC, Irvine.
Chapter 14 1 Unicast Routing Protocols There isn’t a person anywhere that isn’t capable of doing more than he thinks he can. - Henry Ford.
Routing protocols. 1.Introduction A routing protocol is the communication used between routers. A routing protocol allows routers to share information.
Ch 22. Routing Direct and Indirect Delivery.
1 Chapter 4: Internetworking (IP Routing) Dr. Rocky K. C. Chang 16 March 2004.
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.
Inter-domain Routing Outline Border Gateway Protocol.
1. 2  An autonomous system is a region of the Internet that is administered by a single entity.  Examples of autonomous regions are:  UVA’s campus.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.1 Routing Working at a Small-to-Medium Business or ISP – Chapter 6.
1 CS716 Advanced Computer Networks By Dr. Amir Qayyum.
Routing and Routing Protocols CCNA 2 v3 – Module 6.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Chapter 4: Network Layer
Working at a Small-to-Medium Business or ISP – Chapter 6
Routing Protocols (RIP, OSPF, BGP)
OSPF (Open Shortest Path First)
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Chapter 4: Network Layer
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Routing.
Computer Networking TCP/IP Part 2
Chapter 4: Network Layer
Chapter 4: Network Layer
Chapter 4: Network Layer
Working at a Small-to-Medium Business or ISP – Chapter 6
Computer Networks Protocols
Routing.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Presentation transcript:

Routing protocols Basic Routing Routing Information Protocol (RIP) Open Shortest Path First (OSPF)

Routing and Forwarding Routing How to determine the routing table entries carried out by routing daemon Forwarding Look up routing table & forward packet from input to output port carried out by IP layer Routers exchange information using routing protocols to develop the routing tables

Static routing Used on hosts or on very small networks Manually tell the machine where to send the packets for each prefix % netstat -nr Routing Table: Destination Gateway Flags Ref Use Interface U ce UG UG UG UG UG UG UG UG UG UG UG UG UG UG U 1 0 ce0 default UG UH lo0 U-Route is up H-route is to host (else route is to network) G-route to gateway (else direct connection)

Forwarding Procedure Does routing table have entry that matches complete destination IP address? If so, use this entry to forward Else, does routing table have entry that matches the longest prefix of the destination IP address? If so, use this entry to forward Else, does the routing table have a default entry? If so, use this entry. Else, packet is undeliverable

Autonomous Systems Global Internet viewed as collection of autonomous systems. Autonomous system (AS) is a set of routers or networks administered by a single organization Same routing protocol need not be run within the AS But, to the outside world, an AS should present a consistent picture of what ASs are reachable through it Stub AS: has only a single connection to the outside world. Multihomed AS: has multiple connections to the outside world, but refuses to carry transit traffic Transit AS: has multiple connections to the outside world, and can carry transit and local traffic.

Peering and Inter-AS connectivity Tier 1 ISP (Transit AS) Non-transit AS’s (stub & multihomed) do not carry transit traffic Tier 1 ISPs peer with each other, privately & peering centers Tier 2 ISPs peer with each other & obtain transit services from Tier 1s; Tier 1’s carry transit traffic between their Tier 2 customers Client AS’s obtain service from Tier 2 ISPs AS Content or Application Service Provider (Non-transit) Tier 1 ISP (Transit AS) Tier 2 (transit AS) AS Tier 2 (transit AS) AS Peering Center

AS Number For exterior routing, an AS needs a globally unique AS 16-bit integer number Currently, there are about 17,000 registered ASs in Internet (and growing) Request an AS number from the ARIN, RIPE and APNIC

Inter and Intra Domain Routing R R R R R R R R AS A AS B AS C IGP EGPIGP Interior Gateway Protocol (IGP): routing within AS RIP, OSPF Exterior Gateway Protocol (EGP): routing between AS’s BGPv4 Border Gateways perform IGP & EGP routing

Outline Basic Routing Routing Information Protocol (RIP) Open Shortest Path First (OSPF)

RFC 1058 RIP based on routed, “route d”, distributed in BSD UNIX Uses the distance-vector algorithm UDP, port number 520 Metric: number of hops Max limited to 15 suitable for small networks (local area environments) value of 16 is reserved to represent infinity small number limits the count-to-infinity problem Routing Information Protocol (RIP)

RIP Operation Router sends update message to neighbors every 30 sec A router expects to receive an update message from each of its neighbors within 180 seconds in the worst case If router does not receive update message from neighbor X within this limit, it assumes the link to X has failed and sets the corresponding minimum cost to 16 (infinity) Uses split horizon with poisoned reverse Convergence speeded up by triggered updates neighbors notified immediately of changes in distance vector table

Outline Basic Routing Routing Information Protocol (RIP) Open Shortest Path First (OSPF)

RFC 2328 (v2) Fixes some of the deficiencies in RIP Enables each router to learn complete network topology Each router monitors the link state to each neighbor and floods the link-state information to other routers Each router builds an identical link-state database Allows router to build shortest path tree with router as root OSPF typically converges faster than RIP when there is a failure in the network Open Shortest Path First

Multiple routes to a given destination, one per type of service Support for variable-length subnetting by including the subnet mask in the routing message More flexible link cost which can range from 1 to 65,535 Distribution of traffic over multiple paths of equal cost Authentication to ensure routers exchange information with trusted neighbors Uses notion of area to partition sites into subsets Designated router to minimize table maintenance overhead OSPF Features

Example OSPF Topology At steady state: All routers have same LS database Know how many routers in network Interfaces & links between routers Cost of each link Occasional Hello messages (10 sec) & LS updates sent (30 min)

To improve scalability, AS may be partitioned into areas Area is identified by 32-bit Area ID Router in area only knows complete topology inside area & limits the flooding of link-state information to area Area border routers summarize info from other areas Each area must be connected to backbone area ( ) Distributes routing info between areas Internal router has all links to nets within the same area Area border router has links to more than one area Backbone router has links connected to the backbone Autonomous system boundary (ASB) router has links to another autonomous system. OSPF Network

ASB: 4 ABR: 3, 6, and 8 IR: 1,2,7 BBR: 3,4,5,6,8 Area Area Area R1 R2 R4 R5 R7 N1 N2 N3 N4 N5 N6 N7 To another AS Area R = router N = network R8 R3R6 OSPF Areas

Neighbor routers: two routers that have interfaces to a common network Neighbors are discovered dynamically by Hello protocol Adjacent router: neighbor routers become adjacent when they synchronize topology databases by exchange of link state information Neighbors on point-to-point links become adjacent Routers on multiaccess nets become adjacent only to designated & backup designated routers Reduces size of topological database & routing traffic Neighbor, Adjacent & Designated Routers

Link state info exchanged by adjacent routers to allow area topology databases to be maintained inter-area & inter-AS routes to be advertised Router link ad: generated by all OSPF routers state of router links within area; flooded within area only Net link ad: generated by the designated router lists routers connected to net: flooded within area only Summary link ad: generated by area border routers 1. routes to dest in other areas; 2. routes to ASB routers AS external link ad: generated by ASB routers describes routes to destinations outside the OSPF net flooded in all areas in the OSPF net Link State Advertisements