1 Routing Protocols. 2 Distributed Routing Protocols Rtrs exchange control info Use it to calculate forwarding table Two basic types –distance vector.

Slides:



Advertisements
Similar presentations
OSPF Header OSPF HEADER OSPF HEADER for this project Types we will use
Advertisements

Network Layer – Routing 2 Dr. Sanjay P. Ahuja, Ph.D. Fidelity National Financial Distinguished Professor of CIS School of Computing, UNF.
Courtesy: Nick McKeown, Stanford
EIGRP routing protocol Omer ben-shalom Omer Ben-Shalom: Must show how EIGRP is dealing with count to infinity problem Omer Ben-Shalom: Must.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization –All routers are identical –Network is flat. Not true in Practice Hierarchical.
Unicast Routing Protocols: RIP, OSPF, and BGP
1 ELEN 602 Lecture 20 More on Routing RIP, OSPF, BGP.
TDC365 Spring 2001John Kristoff - DePaul University1 Interconnection Technologies Routing I.
CSE331: Introduction to Networks and Security Lecture 9 Fall 2002.
RD-CSY3021 Comparing Routing Protocols. RD-CSY3021 Criteria used to compare routing protocols includes  Time to convergence  Proprietary/open standards.
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.
Unicast Routing Protocols: RIP, OSPF, and BGP
Objectives After completing this chapter you will be able to: Describe hierarchical routing in OSPF Describe the 3 protocols in OSPF, the Hello, Exchange.
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.
Fundamentals of Networking Discovery 2, Chapter 6 Routing.
CCNP Network Route OSPF Part -I OSPF: Open Shortest Path First Concept of OSPF: 1. It is a link state routing protocol. 2. There are basically only 2 ISIS.
INTRA- AND INTERDOMAIN ROUTING Routing inside an autonomous system is referred to as intradomain routing. Routing between autonomous systems is.
Chapter 12 Intro to Routing & Switching.  Upon completion of this chapter, you should be able to:  Read a routing table  Configure a static route 
6: Routing Working at a Small to Medium Business.
Dynamic Routing Protocols  Function(s) of Dynamic Routing Protocols: – Dynamically share information between routers (Discover remote networks). – Automatically.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Chapter 14 Routing Protocols RIP, OSPF, BGP.
Slide /2009COMM3380 Routing Algorithms Distance Vector Routing Each node knows the distance (=cost) to its directly connected neighbors A node sends.
1 Routing. 2 Connectionless Network Layers Destination, source, hop count Maybe other stuff –fragmentation –options (e.g., source routing) –error reports.
Unicast Routing Protocols  A routing protocol is a combination of rules and procedures that lets routers in the internet inform each other of changes.
Routing protocols Basic Routing Routing Information Protocol (RIP) Open Shortest Path First (OSPF)
TCOM 515 Lecture 2. Lecture 2 Objectives Dynamic Routing Distance Vector Routing Link State Routing Interior vs Exterior RIP - Routing Information Protocol.
1 Internet Protocol. 2 Connectionless Network Layers Destination, source, hop count Maybe other stuff –fragmentation –options (e.g., source routing) –error.
1 Network Layer Lecture 13 Imran Ahmed University of Management & Technology.
RIP2 (Routing Information Protocol) Team Agile. Routing Protocols Link State – OSPF – ISIS Distance vector – RIP (version 1 and 2) – IGRP (Cisco Proprietary)
TCP/IP Protocol Suite 1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 11 Unicast Routing Protocols.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Chapter 13 Routing Protocols (RIP, OSPF, BGP)
資 管 Lee Lesson 10 RIP, OSPF, and BGP. 資 管 Lee Routing in Internet An internet is divided into autonomous systems. An autonomous system(AS) is a group.
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 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 2 Single-Area OSPF.
1 Module 4: Implementing OSPF. 2 Lessons OSPF OSPF Areas and Hierarchical Routing OSPF Operation OSPF Routing Tables Designing an OSPF Network.
Link State Routing NETE0521 Presented by Dr.Apichan Kanjanavapastit.
CCNA 2 Week 7 Distance Vector Routing. Copyright © 2005 University of Bolton Topics Distance Vector Protocol Issues RIP IGRP.
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.
6: Routing Working at a Small to Medium Business.
TCOM 515 Lecture 2. Lecture 2 Objectives Dynamic Routing Distance Vectore Routing Link State Routing Interior vs Exterior RIP - Routing Information Protocol.
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.
1 Version 3.1 Module 6 Routed & Routing Protocols.
Dynamic Routing Protocols II OSPF
Routing Algorithms and IP Addressing Routing Algorithms must be ▪ Correctness ▪ Simplicity ▪ Robustness ▪ Stability ▪ Fairness ▪ Optimality.
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.
Computer Networks22-1 Network Layer Delivery, Forwarding, and Routing.
Ch 22. Routing Direct and Indirect Delivery.
Spring 2000CS 4611 Routing Outline Algorithms Scalability.
RIP Routing Protocol. 2 Routing Recall: There are two parts to routing IP packets: 1. How to pass a packet from an input interface to the output interface.
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.
CS 6401 Intra-domain Routing Outline Introduction to Routing Distance Vector Algorithm.
Single Area OSPF Module 2, Review How routing information is maintained Link-state routers apply the Dijkstra shortest path first algorithm against.
CSE 421 Computer Networks. Network Layer 4-2 Chapter 4: Network Layer r 4. 1 Introduction r 4.2 Virtual circuit and datagram networks r 4.3 What’s inside.
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.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Dynamic Routing Protocols II OSPF
Link State Routing protocol
Routing Protocols (RIP, OSPF, BGP)
Routing BY, P.B.SHANMATHI.
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.
Dynamic Routing Protocols part2
Dynamic Routing: Dynamic routing is where we use a routing protocol; routing protocols are cool because they take care of our work. Routing protocols will.
13.3 OSPF: Open Shortest Path First.
Intra-Domain Routing Jacob Strauss September 14, 2006.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Chapter 5: Dynamic Routing
Dynamic Routing and OSPF
Dynamic Routing: Dynamic routing is where we use a routing protocol; routing protocols are cool because they take care of our work. Routing protocols will.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Presentation transcript:

1 Routing Protocols

2 Distributed Routing Protocols Rtrs exchange control info Use it to calculate forwarding table Two basic types –distance vector (DECnet, “old” ARPANET, RIP) –link state (“new” ARPANET 1980, DECnet Phase V 1985, IS-IS 1988, OSPF version ).

3 Distance Vector Routing Rtr knows –own ID –how many cables hanging off box –cost, for each cable, of getting to nbr j k m n cost 3 cost 2 cost 7 I am “4”

4 Distance Vector (DV) Routing Initialize distances to all rtrs in the network to be 0, except to its nbrs. Rtr learns from nbrs their distances to all nodes in the network, calculate own distances, and forward the distance vector to nbrs. This repeats until the distance vector converges. Rtr updates the distance vector whenever it receives different distance vector from some nbr, or whenever some link breaks. Distance vector is either sent periodically or when the network configuration changes.

5 j k m n cost 3 cost 2 cost 7 I am “4” distance vector rcv’d from cable j distance vector rcv’d from cable k distance vector rcv’d from cable m distance vector rcv’d from cable n your own calculated distance vector your own calculated forwarding table m 6 j 5 k/m k 8 j 6 k/j cost 3 cost 2 cost 7 19 n 3? j? ? ? Example of DV Routing

6 Problems with Distance Vector Routing B does not conclude that C is unreachable but that d(B,C)=d(B,A)+d(A,C) =3 When A receives DV from B it concludes that d(A,C)=4 DV increases in this until infinity, or maximum value which is set by administrator. For this reason, the cost field has the small size. ABC

7 Split Horizon This technique sometime prevents counting toward infinity. If R1 forwards packets to D through R2, then R1 informs R2 that its distance to D is infinity. So, when the link toward node D fails, R2 learns from R1 that its distance to D is infinity immediately, i.e. that D is unreachable. R1R1R2R2D

8 Unfortunatelly, split horizon does not always work. When link to D fails, R1 concludes that D is unreachable. R2 gets the information from R1 that D is unreachable, and sets the path to D through R3, calculating DV based on DV of R3. R2 sends new DV to R1, that updates it and sends it further to R3. R3 updates DV and sends it to R3, which updates it and sends it to R2 etc. Cost of path to D is again increasing slowly toward infinity. R2 D R1 R3 Split Horizon

9 Link State Routing Construct Link State Packet (LSP) –who you are –list of (nbr, cost) pairs Broadcast LSPs to all rtrs Store latest LSP from each rtr received from nbrs Compute Routes Forward LSPs from each nbr to other nbrs

10 Building Link State Packets (a) A subnet. (b) The link state packets for this subnet.

11 Computing Routes Edsgar Dijkstra’s algorithm: –calculate tree of shortest paths from self to each –also calculate cost from self to each –Algorithm: step 0: put (SELF, 0) on tree step 1: look at LSP of node (N,c) just put on tree. If for any nbr K, this is best path so far to K, put (K, c+dist(N,K)) on tree, child of N, with dotted line step 2: make dotted line with smallest cost solid, go to step 1

12 ABC DEF G A B/6 D/2 B A/6 C/2 E/1 C B/2 F/2 G/5 D A/2 E/2 E B/1 D/2 F/4 F C/2 E/4 G/1 G C/5 F/1 Example of Dijkstra Algorithm

13 C(0) B(2) F(2) G(5) C(0) B(2) F(2) G(5) C(0) B(2) F(2) G(5) E(6)G(3) C(0) B(2) F(2) E(6)G(3) C(0) B(2) F(2) E(6)G(3) A(8)E(3) C(0) B(2) F(2) G(3) A(8)E(3) Example of Dijkstra Algorithm

14 C(0) B(2) F(2) G(3) A(8)E(3) D(5) C(0) B(2) F(2) G(3) A(8)E(3) D(5) C(0) B(2) F(2) G(3) A(8)E(3) D(5) A(7) C(0) B(2) F(2) G(3) E(3) D(5) A(7) Forwarding table: A/B B/B C/self D/B E/B F/F G/F Example of Dijkstra Algorithm

15 Distance Vector vs Link State Memory: distance vector wins (but memory is cheap) Computation: debatable Simplicity of coding: simple distance vector wins. Convergence speed: link state better Functionality: link state can have custom routes, mapping the net, easier troubleshooting,

16 Routing Information Protocol (RIP) Packets are requests and responses. Report through response every destination every 30 seconds, or as a reply to request. Throw away info if too old (90s for IP) Request when a rtr comes up or when info is too old Maximum cost is with mask is default destination Most implementations of IP RIP do –split horizon –triggered updates –poison reverse (rtr that learns about link fail announce the distance through it as infinity).

17 RIP Version 1 Header Command Version Reserved Address Family ID (=2 for IP) Address Metric Request Or Response

18 RIP Version 2 Header Command Version=2 Reserved Address Family=0xFFFF Request Or Response Authentication Type Authentication Info Address Family ID=2 Route Tag IP Address Mask Next Hop =0 or Rtr on LAN Metric When there is auth When router Represents other rtr For external routes Etc.

19 Differences Between RIP 1 and 2 RIP 1 works with classful addresses. RIP 2 works with classless addresses and ads authentication

20 OSPF: Nbr Discovery Routers send Hellos to their nbrs periodically. Nbrs learn about nbr appearance and dissappearances from hello messages. Hello messages specify hello interval and RouterDeadInterval. If a router does not receive hello message in one RouterDeadInterval, it regards the link as failed. New router learns from one of its nbrs the entire link state database, and acks every entry.

21 OSPF: Info Exchange on LAN One router is designated to send link state updates to the routers on LAN, and another routers is backup designated router. Routers on LAN send their link state ads to the DR and BDR. DR send these messages to all routers on LAN as a part of link state update message. DR is the first one on LAN, BDR is the second one. If one of them fails it is replaced by the router with the highest priority.

22 OSPF: Flooding LSAs LSAs are distributed through flooding –send to every nbr except from which LSA rcv’d LSA is updated only if it has a higher sequence number than the existing one, or if its age exceeded the maximum age. Rtr forwards only updated LSAs, and it generates new LSAs periodically or when there is a configuration change (link cost has changed, nbr is down).

23 OSPF Hierarchy Runs on the top of IP with protocol field 89, and is applied to autonomous systems (AS). Comprises two levels of hierarchy: areas and backbone. Boarder routers of some domain calculate their costs to the routers of the area and flood this info to other boarder routers. They flood processed info learned from other boarder routers to their areas. Area boarder routers learn info about external routes from AS boarder routers, and flood this info to other boarder and internal routers.

24 OSPF Header OSPF ver (1) Pkt type (1) OSPF Pkt Length Source OSPF Rtr ID OSPF Area ID Packet checksum Authentication type Authetication data

25 OSPF Pkt Types 1. Hellos 2. Database description 3. Link state request 4. Link state update: Multiple LSAs 5. Link state ack 6. Links state advertisement (LSA) –Type 1 LSA: link between routers, or LAN –Type 2 LSA: all routers on LAN, or MAN –Type 3 LSA: area border router send costs to prefixes of the area to other border rtrs, they process these LSAs and send them to the area. –Type 4 LSA: AS border routers are advertised to the area border routers and they further advertise them to their areas –Type 5 LSA: an AS external link ad

26 Address Aggregation B C A / Area Area Area Area D / / / / / /24 Border rtr to outside of area, e.g.: A sends pair: net /20 cost 4 B sends pair: net /16 cost 7