McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Chapter 14 Routing Protocols RIP, OSPF, BGP.

Slides:



Advertisements
Similar presentations
Unicast and Multicast Routing:
Advertisements

RIP V2 CCNP S1(5), Chapter 4.
Chapter 11 Unicast Routing Protocols
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.
CSEE W4140 Networking Laboratory Lecture 4: IP Routing (RIP) Jong Yul Kim
Unicast Routing Protocols: RIP, OSPF, and BGP
Figure 2-17 Relationship of layers and addresses in TCP/IP Example: web browser implementing HTTP Implemented in TCP and UDP software. HTTP uses TCP. Interface.
© 2006 Cisco Systems, Inc. All rights reserved. ICND v2.3—3-1 Determining IP Routes Introducing Distance Vector Routing.
INTRA- AND INTERDOMAIN ROUTING Routing inside an autonomous system is referred to as intradomain routing. Routing between autonomous systems is.
TCP/IP Protocol Suite1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 11 Unicast Routing Protocols.
Chapter 14 Routing Protocols (RIP, OSPF, and BGP)
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 Information Protocol (RIP). Intra-and Interdomain Routing An internet is divided into autonomous systems. An autonomous system (AS) is a group.
Dynamic Routing Protocols  Function(s) of Dynamic Routing Protocols: – Dynamically share information between routers (Discover remote networks). – Automatically.
Slide /2009COMM3380 Routing Algorithms Distance Vector Routing Each node knows the distance (=cost) to its directly connected neighbors A node sends.
Unicast Routing Protocols  A routing protocol is a combination of rules and procedures that lets routers in the internet inform each other of changes.
Code : STM#520-1 Samsung Electronics Co., Ltd. OfficeServ7400 Router Operation Distribution EnglishED01.
TCOM 515 Lecture 2. Lecture 2 Objectives Dynamic Routing Distance Vector Routing Link State Routing Interior vs Exterior RIP - Routing Information Protocol.
RIP2 (Routing Information Protocol) Team Agile. Routing Protocols Link State – OSPF – ISIS Distance vector – RIP (version 1 and 2) – IGRP (Cisco Proprietary)
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Network Layer Protocols: Unicast and Multicast Routing Protocols 21.1 Unicast Routing 21.2 Unicast Routing.
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.
1 Routing Table  The seven fields Mask: for finding (sub)network address of the destination l Host-specific routing: (/32) l Default routing:
1 Chapter 14 Routing Protocols (RIP, OSPF, and BGP) Chapter 14 Routing Protocols (RIP, OSPF, and BGP) Mi-Jung Choi Dept. of Computer Science and Engineering.
Link State Routing NETE0521 Presented by Dr.Apichan Kanjanavapastit.
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.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Delivery and Routing of IP Packets.
7400 Samsung Confidential & Proprietary Information Copyright 2006, All Rights Reserved. -0/35- OfficeServ 7x00 Enterprise IP Solutions Quick Install Guide.
TCOM 515 Lecture 2. Lecture 2 Objectives Dynamic Routing Distance Vectore Routing Link State Routing Interior vs Exterior RIP - Routing Information Protocol.
An internet is a combination of networks connected by routers. When a datagram goes from a source to a destination, it will probably pass through many.
1 Kyung Hee University Chapter 11 Unicast Routing Protocols (RIP, OSPF, and BGP)
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.
(How the routers’ tables are filled in)
Ch 22. Routing Direct and Indirect Delivery.
1 INTRA- AND INTERDOMAIN ROUTING Routing inside an autonomous system is referred to as intradomain routing. Routing between autonomous systems is referred.
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.
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.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Dynamic Routing Protocols part2
Chapter 14 Routing Protocols (RIP, OSPF, and BGP)
Routing Protocols (RIP, OSPF, BGP)
(How the routers’ tables are filled in)
9 Network Layer Part VI Computer Networks Tutun Juhana
Routing Information Protocol (RIP)
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
COMP 3270 Computer Networks
Rip Routing Protocol.
13.3 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.
STRUCTURE OF A ROUTER We represent a router as a black box that accepts incoming packets from one of the input ports (interfaces), uses a routing table.
Dynamic Routing Protocols part2
STRUCTURE OF A ROUTER We represent a router as a black box that accepts incoming packets from one of the input ports (interfaces), uses a routing table.
Chapter 13 Routing Protocols (RIP, OSPF, and BGP)
UNICAST ROUTING PROTOCOLS
Routing Protocols (RIP, OSPF, BGP).
Chapter 11 Unicast Routing Protocols (RIP, OSPF, and BGP)
RFC 1058 & RFC 2453 Routing Information Protocol
Chapter 13 Routing Protocols (RIP, OSPF, and BGP)
Chapter 22. Network Layer: Routing
Communication Networks
Communication Networks
STRUCTURE OF A ROUTER We represent a router as a black box that accepts incoming packets from one of the input ports (interfaces), uses a routing table.
STRUCTURE OF A ROUTER We represent a router as a black box that accepts incoming packets from one of the input ports (interfaces), uses a routing table.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Presentation transcript:

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Chapter 14 Routing Protocols RIP, OSPF, BGP

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Figure 14-1 Autonomous systems

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Figure 14-2 Popular routing protocols Distance Vector Link State Path Vector

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Distance Vector Routing. Forouzan + CCNA: Slow convergence. Routing loops. Counting to infinity. Split horizon Route poisoning. Triggered update.

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 RIP: Routing Information Protocol 14.3 Exposición equipo 5

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Example of updating a routing

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Initial routing tables in a small autonomous system

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Final routing tables for the previous figure

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 RIP message format

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Request messages

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Example 1 What is the periodic response sent by router R1 in Figure 13.8 (next slide)? Assume R1 knows about the whole autonomous system.

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Example 1

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Solution R1 can advertise three networks , , and The periodic response (update packet) is shown in Figure 13.9 (next slide).

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Solution to Example 1

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 RIP timers

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Example 2 A routing table has 20 entries. It does not receive information about five routes for 200 seconds. How many timers are running at this time?

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Solution The timers are listed below: Periodic timer: 1 Expiration timer: 20  5  15 Garbage collection timer: 5

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Slow convergence

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Hop count

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Instability

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Split horizon

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Poison reverse

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 RIP-v2 Format

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 RIP version 2 supports CIDR.

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Authentication

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 RIP uses the services of UDP on well-known port 520.

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 OSPF: Open Shortest Path First 14.5

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Areas in an autonomous system

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Types of links

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Point-to-point link

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Transient link

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Stub link

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Example of an internet

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Graphical representation of an internet

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Types of LSAs

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Router link

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Network link

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Summary link to network

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Summary link to AS boundary router

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 External link

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Example 3 In Figure (next slide), which router(s) sends out router link LSAs?

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Figure Example 3 and Example 4

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Solution All routers advertise router link LSAs. R1 has two links, Net1 and Net2. R2 has one link, Net2 in this AS. R3 has two links, Net2 and Net3.

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Example 4 In Figure 14.31, which router(s) sends out the network link LSAs?

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Solution All three network must advertise network links: Advertisement for Net1 is done by R1 because it is the only router and therefore the designated router. Advertisement for Net2 can be done by either R1, R2, or R3, depending on which one is chosen as the designated router. Advertisement for Net3 is done by R3 because it is the only router and therefore the designated router.

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 In OSPF, all routers have the same link state database.

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Shortest path calculation Dijkstra algorithm Start Stop Set root to local node and move it to tentative list Among nodes in tentative list, move the one with the shortest path to permanent list. Tentative list is empty? Add each unprocessed neighbor of last moved node to tentative list if not already There. If neighbor is in the tentative list with larger cumulative cost, replace with new one. No Yes

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Shortest path calculation Dijkstra algorithm

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 F 0

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 F N3 N

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 F N3 N

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 F DE N3 N

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 F A DE N3 N

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 F A DE B N3 N5 N

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 F A DE B N3 N5 N

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 F A DE B N3 N5 N4 N

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 F A DE B N3 N5 N4 N

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 C 20 F A DE B N3 N5 N4 N

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 C N F A DE B N3 N5 N4 N

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 F A DE B C N3 N5 N4 N1 N

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Types of OSPF packets

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 OSPF packet header

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Hello packet

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Database description packet

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Link state request packet

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Link state update packet

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 LSA header

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Router link LSA

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Example 5 Give the router link LSA sent by router in Figure

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Figure Example 5

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Solution This router has three links: two of type 1 (point-to- point) and one of type 3 (stub network). Figure shows the router link LSA.

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Figure Solution to Example 5

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Network link advertisement format

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Example 6 Give the network link LSA in Figure

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Figure Example 6

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Solution The network, for which the network link advertises, has three routers attached. The LSA shows the mask and the router addresses. See Figure Note that only one of the routers, the designated router, advertises the network link.

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Figure Solution to Example 6

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Summary link to network LSA

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Summary link to AS boundary LSA

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 External link LSA

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Link state acknowledgment packet

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 OSPF packets are encapsulated in IP datagrams.