Experiment 6

Aim: To study performance comparison routing protocols

Routing Protocol

A routing protocol specifies how routers communicate with each other, describing information
that enables them to select routes between any two nodes on a computer network. Routing
algorithm determine the specific choice of route. Each router has a priori knowledge only of
network attached to it directly. A routing algorithm share this information first among immediate
neighbors, and then throughout the network. This way, routers gain knowledge of the topology
of the network.

There are many types of routing protocols; three major classes are in widespread use n IP
networks:

 Interior gateway protocols type 1. Link-state routing protocols, such as OSPF.

 Interior gateway protocols type 2. Distance-vector routing protocols, such as Routing
Information Protocol, RIPv2, IGRP.
 Exterior gateway protocols are routing protocols used on internet for exchanging routing
information between Autonomous Systems, such as Exterior Gateway Protocols (EGP),
Border Gateway Protocol (BGP).

Distance-Vector:

Distance-vector routing uses a distance-vector algorithm (such as the bellman-Ford routing

algorithm), which uses a direction (vector) and a distance to any link in the inter-network to
determine the best route. Each router periodically sends information to each of its neighbors on
the costs that it takes to get to a distance node. Typically, the cost related to the hop count. The
main problem with distance-vector is that updates to the network are step-by-step, and it has high
bandwidth requirement as each router sends its complete routing table to all of its neighbors at
regular intervals.

Points:

 It uses Bellman-Ford algorithms for calculating the shortest cost path.

 Each router periodically sends information to each of its neighbors.
 It takes to get to a distance node through costs. The cost related to the hop count.
 It is decentralized routing algorithm.
 RIP is an example protocol, which follows the distance vector routing.
 It needs less CPU utilization and less memory space compare than Link space.
Link-state:

Link-state involves each router building up the complete topology of the entire internetwork (or
at least of the partition on which the router is situated), thus each router contains the same
information. With this method, routers only send information to all of the other router when there
is a change in the topology of the network. Link-state is also known as the shortest path first.
Typically link-state protocols are OSPF, BGP and EGP. With OSPF, each router builds a
hierarchical with link-state is that routers require much more processing power to update the date
base with details of all the routers on the network.

Points:

 It uses Dijkstra algorithm for calculating the shortest path.

 Each router building up the complete topology of the entire internetwork, thus each router
contains the same information.
 Link-state is also known as the shortest path first.
 OSPF, BGP and EGP are the example for link-state.
 It needs more CPU utilization and more memory space compare than Distance Vector.

Hybrid Routing:

This algorithm attempt to combine the positive attributes of both distance vector and link-state
protocols. Like distance vector, hybrid algorithm uses metrics to assign a preference to a route.
However, the metrics are more accurate than conventional distance vector algorithm. Like Link-
state algorithms, routing updates in hybrid algorithms are event driven rather than periodic.
Networks using hybrid algorithm tend to coverage more quickly then networks using distance
vector protocols. Finally, algorithm potentially reduces the costs of link state updates and
distance vector advertisements.
 Performance Comparison of Routing Protocols

RIPv1 RIPv2 IGRP EIGRP OSPF IS-IS BGP

Interior Interior Interior Interior Interior Interior Interior Exterior

/Exterior?
Type Distance Distance Distance Vector Hybrid Link- Link- Path vector
Vector Vector state state
Default Hop count Hop Bandwidth/Delay Bandwidth/Delay Cost Cost Multiple
metrics count attributes
Administr 120 120 100 90(internal) 110 115 20(internal)
ative 170(external) 200(external)
Distance
Hop count 15 15 255(100 default) 224(100 default) None None EBGP
limit Neighbor:
1 (default)
IBGP
Neighbor:
none
Converge Slow Slow Slow Very fast Fast fast Average
nce
Update 30 30 90 seconds only when change only only only when
timer seconds seconds occurs when when change occurs
change change
occurs occurs
Updates Full table Full table Full table Only change Only Only Only change
change change
Classless No Yes No Yes Yes Yes Yes

Supports No Yes No Yes Yes Yes Yes

VLSM
Algorithm Bellman- Bellman- Bellman-Ford DUAL Dijkstra Dijkstra Best path
Ford Ford algorithm
Update Broadcast 224.0.0.9 224.0.0.10 224.0.0.10 224.0.0.5 Unicast
address 224.0.0.6
Protocols UDP port IP protocol 9 IP protocol 88 IP TCP port 179
and ports 520 protocol
89

Akhil

(87195103)