Scribd
Upload
9 views

Lecture 3 - Part 2

The document discusses routing protocols, focusing on the distinction between Interior Gateway Protocols (IGP) for intra-autonomous system routing and Exterior Gateway Protocols (EGP) for inter-autonomous system routing. It details Distance Vector Routing Protocols, specifically RIP, and Link State Routing Protocols like OSPF, explaining their mechanisms and configurations. Additionally, it highlights the use of algorithms such as Bellman-Ford for distance vector protocols and Dijkstra's for link state protocols.

Uploaded by

manulaweerarathne.greatview
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
9 views

Lecture 3 - Part 2

The document discusses routing protocols, focusing on the distinction between Interior Gateway Protocols (IGP) for intra-autonomous system routing and Exterior Gateway Protocols (EGP) for inter-autonomous system routing. It details Distance Vector Routing Protocols, specifically RIP, and Link State Routing Protocols like OSPF, explaining their mechanisms and configurations. Additionally, it highlights the use of algorithms such as Bellman-Ford for distance vector protocols and Dijkstra's for link state protocols.

Uploaded by

manulaweerarathne.greatview
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 23

Routing and Routing Protocols

Lecture 3 – Part 2

Charith Sucharitharathna
Department of Electrical and Electronic Engineering
Routing Protocols Cont.

• An autonomous system (AS) is a collection of routers under

a common administration
ex : a company's internal network
• Interior Gateway Protocols (IGP) are used for

intra-autonomous system routing


(routing inside an autonomous system)
• Exterior Gateway Protocols (EGP) are used for

inter-autonomous system routing


(routing between autonomous systems)
Routing Protocols Cont.
Interior Gateway Protocols (IGP)
Distance Vector Routing Protocols

• Use the Bellman-Ford algorithm for best path selection

• Routes are advertised as vectors of distance and direction

• Distance is defined in terms of a metric such as hop count

• Direction is simply the next-hop router or exit interface

• Send periodic updates of their routing information

Ex : RIP, IGRP, EIGRP


RIP (Routing Information Protocol)

• Sends complete routing table out to all interfaces every 30 seconds

• Uses hop count to select best way to a remote network

• RIP works well in small networks

• There are two versions

RIP v1, RIP v2


RIP Configuration

Router(config)#router rip

Router(config-router)#network <network-number>

< network number > : Directly connected network addresses


RIP Configuration Example
Verifying the Routing Protocol-RIP
Displaying the Routing Table
Configure RIP V2

Router(config)#router rip

Router(config)#version 2

Router(config)#no auto-summary

Router(config-router)#network <network-number>

< network number > : Directly connected network addresses


RIP Timers

• Periodic Timer : Each router sends its routing table information

to it neighbors every 30 second.


• Expiration Timer : If a router does not get the updates from a

neighbor for a long time it means there is a problem with the


neighbor router
Open Shortest Path First (OSPF)
Open Shortest Path First

Evolution of OSPF
Interior Gateway Protocols
Link State Routing Protocols

• State of the links (Information about type of the network and


neighboring routers) are advertised to other routers
• A link-state update only sent when there is a change in the topology

• Use the Dijkstras algorithm for best path selection

• Work best in situations where:

- Network design is complex (large networks)


- Administrators have a good knowledge of network
Ex : OSPF
Open Shortest Path First

Features of OSPF
Open Shortest Path First

Components of OSPF
Open Shortest Path First

Components of OSPF (cont.)


OSPF Routers Exchange Packets - These packets are used to discover
neighboring routers and also to exchange routing information to maintain
accurate information about the network.
Open Shortest Path First

Link-State Operation

If a neighbor is present, the


OSPF-enabled router attempts to
establish a neighbor adjacency
with that neighbor
Open Shortest Path First

Link-State Operation (cont.)


 LSAs contain the state
and cost of each directly
connected link.
 Routers flood their LSAs
to adjacent neighbors.
 Adjacent neighbors
receiving the LSA and
immediately flood the LSA
to other directly connected
neighbors, until all routers
in the area have all LSAs.
Open Shortest Path First

Link-State Operation
 Build the topology table
based on the received
LSAs.
 This database eventually
holds all the information
about the topology of the
network.
 Execute the SPF
Algorithm.
Open Shortest Path First

Link-State Operation (cont.)

From the SPF tree, the best


paths are inserted into the
routing table.
Exercise
• Consider the following network. With the indicated link costs,
use Dijkstra’s shortest path algorithm to compute the shortest
path from “B” to all other network nodes. Clearly show the
operations of the algorithm using suitable format. Then derive
shortest path records for B’s routing table. (Hint: Table format
should include Destination, Cost and Next hop Fields)

You might also like