Comparative Analysis of Dynamic Routing
Comparative Analysis of Dynamic Routing
Aditi Singh,
Department of Software Engineering,
SRM University, Kattankulathur, Chennai, India.
Abstract - The main concepts of the dynamic routing protocols OPTIMALITY- the capability to choose the best path to route
are discussed in this paper. Routing protocols are basically used which depends on the metrics and metric weightings, used for
to let the communication between the routers happen. The calculations.
efficiency of the routing can be judged on the basis of metrics. LOW OVERHEAD- simple and efficient overhead.
This comparative study is carried out and explained.
ROBUSTNESS- they should perform efficiently in the case of
INTRODUCTION hardware failures or high load conditions.
Dynamic routing protocols play an important role in today’s FLEXIBILITY-they should quickly adapt to any new
networks. In the following paper, we describe the importance circumstances in the network environment
of each of these routing protocols, their usage, advantages and RAPID CONVERGENCE- agreement of the entire route to
disadvantages. Firstly, let us understand what a routing choose the most optimal path.
protocol is. For example, if we want to transfer a box from
room A to room B, the first thing we would calculate is the Components of dynamic routing protocols:
shortest path. Similarly, when the data is being transferred in 1. Data Structures: They are kept in RAM. Tables and
the network layers, the path determination and switching are Databases.
done using these protocols. The routing protocols are given in 2. Algorithm: The steps in which the routing process
two forms, occurs. Used for processing routing information and
➢ Static Routing calculating the best path.
➢ Dynamic Routing 3. Routing Protocol Messages: Discovers the neighbors.
Keep the accurate information of the exit and the
STATIC ROUTING: entry points.
When the IP addresses are set manually and the routes are
entered from the keyboard, it is known as static routing. The The dynamic routing protocols that are no longer used,
entries are made into the routing table by the network a) RIP V1
administrator before the actual routing process begins. These b) IGRP
entries can only be changed by the administrator, they cannot c) NLSP
alter themselves. This requires additional configuration when d) EGP- Exterior Gateway Protocol
the subnets are added in the internetwork. Since, they can't e) BGP- Border Gateway Protocol
adapt to any changes made in the network, they are usually not
preferred when the network is huge and the outcome is not The dynamic routing protocols in use and studied in this
predictable. They also do not send and routing information paper,
that can be heard by the hackers. They do not have CPU a) RIP V2
memory and link bandwidth. b) EIGRP
c) OSPF
DYNAMIC ROUTING:
On the other hand, dynamic routing is done using the routing Dynamic routing protocol operation:
protocols i.e., instead of giving each and every IP of the entry The common purpose and function of these protocols is to
and exit of the router, the network administrator just has to identify the remote networks and quickly adapt whenever
write the protocol with the given syntax. In the real time, these there is a change in the network environment. The operations
are very practical and beneficial since they can identify, if depend on the given protocol. The following are the general
notified, the changes brought into the network and find the operations of a dynamic routing protocol,
shortest path.They can adjust to the changing network ● The router sends and receives the information on its
environments by reading the routing update messages. If the interfaces.
messages indicate any change in the network; they calculate ● The router shares the routing messages with the other
the shortest path and send the message. The design goals of routers that are using the same routing protocol.
dynamic routing protocols are:
● The exchange of information among the routers is to information is being sent to remote networks. For example,
find the remote networks. let's say there are two routes 1 and 2 from router A to router B.
● Whenever there is a change in the topology, the Both of them are the shortest paths but 1 costs slightly more
routing protocol is used to inform the routers about than 2. So, the router would choose path 2. This happens when
the changes. the protocol uses cost metric to determine the path. Each
routing protocol uses different metrics to choose the path. RIP
ABBREVIATIONS AND COMMANDS: uses hop count and EIGRP uses a combination of bandwidth
RIP: Routing Information Protocol and delay. The available metrics are:
IGP: Interior Gateway Protocols
IGRP: Interior Gateway Routing Protocols HOP COUNT- No. of routers the packet can traverse. The hop
NLSP: NetWare Link Services Protocol count represents the total number of routing devices a given
EGP: Exterior Gateway Protocol piece of data (packet) passes through. For example, let's
BGP: Border Gateway Protocol consider the network below to understand the concept of hop
EIGRP: Enhanced Interior Gateway Routing Protocol count. We have 3 devices each connected to a different router.
OSPF: Open Shortest Path First Now, hop count can be defined as the number of hops taken to
reach the destination. Most people interpret hop to be the
Commands: number of links that are used in the data transfer. But, in real,
Router>en (to enable the router) it is the number of routers the data hops over to reach the
Router# config t (to configure the terminal) destination. Let's say, message has to be passed from PC0 to
Router(config)# interface ________ (to enter the interface) PC2, the hop count =2. Similarly, from PC0 to PC3, the hop
Router(config-if)#no shut (to save the added IP) count is 3. However, from PC0 to PC1, the hop count=1 since
Router(config)#exit (to exit from that interface) there is only one router between them. Routing protocols that
Router# show run (to look at all the commands given) only reference hops as their metric do not always select the
Router# show version (to show the versions in use) best path through a network. Just because a path to a
Router# show ip route (to show the ip addresses) destination contains fewer network hops than another does not
make it best
DYNAMIC ROUTING PROTOCOLS
A. DRP AND CONVERGENCE:
Convergence can be defined as a state where all the routers
have the same topological information of the internetwork in
which they are operating.In simpler words, the routers should
have the accurate information about the neighbouring routers
they are connected to. All the routers advertise the part of
information they know and when all the routers have the
consistent understanding of the network, it can be said that
they are converged. However, for the traffic to flow, the
routers need not be converged. Even if the routers are not
converged the data flow will still occur but the path chosen
BANDWIDTH- Path with highest bandwidth is chosen.
may not be the optimal route. Any change in the network that
Bandwidth is measured in terms of bits per second. The links
affects the routing table, breaks the convergence temporarily
that carry higher transfer rates are always preferred over lower
until all the information is passed on to all the
capacity links. However, bandwidth alone is not enough to
routers.Whenever there is a change in network topology,
find the suitable path because let's say there is a high capacity
routing protocols are used to inform the routers about the
link with greater delay and is highly loaded and a low capacity
changes and when all the routers have adapted to the new
link with lower delay and lower traffic. What would be ideal is
information, the convergence is reestablised. Hence,
not easy to measure only with the bandwidth information.
convergence is very important to calculate the best path.
Convergence time can be defined as the time taken by the
DELAY-Time taken by the packet to traverse the path. Delay
routers to converge. This is one of the main design goals and
is the time taken by the packet to traverse the path. If delay is
performance indicators of the routing protocols.RIP takes a lot
a measure, then the link with the lowest delay would be
of time to converge even if the network has only a few routers,
chosen as the best path. Each individual delay quantity would
it may take upto few minutes to converge. That's why OSPF
be an estimate based on the type of link to which the interface
and EIGRP are the most preferable routing protocols since
is connected. As said in the above example, if both bandwidth
they converge quickly.
and delay are combined together, we can get an optimal path.
B. DRP AND METRICS:
LOAD - Traffic utilization of the link. This metric reflects the
Metrics are a way to measure or compare. Routing protocols
amount of traffic utilizing the links along the path. The best
use metrics to determine which route is the best path. There
path is the one with the lowest load. Unlike the hop count and
are mostly n numbers of paths to reach one destination. Out of
Band width, load is not constant. So, it must be carefully
all those paths, to choose one optimal path, metrics are used.
checked before choosing the path.
There are many factors that are considered when the
● The next command would be to save the ip and it is no The above three ports are configured using router the RIP
shut. Once no shut is given, we have to exit from the routing is,
interface and the exit command is exit.
router rip
● Now, to configure the routers, we have various serial network 10.0.0.0
ports available such as se0/0/0, se0/0/1, se0/1/0 and so on. network 70.0.0.0
Every entry point of the port is synchronized i.e., it has a !
clock rate allotted. A default clock rate of 64000 is used ip classless
in the example. ip route 0.0.0.0 0.0.0.0 70.0.0.3
clock rate 64000 (syntax)
The other steps are the same as the fa0/0. The network ids are the Ids the router is directly connected
Configuration Example: through the exit point 70.0.0.3 .The syntax for RIP routing,
R1>enable When you've entered the configuration mode,
R1#config t
R1(config)#interface se0/0/0 For router 1
R1(config-if)#ip ad 192.128.10.4 255.255.255.0 R1#conf t
R1(config-if)#clock rate 64000 R1(config)#router rip
R1(config-if)#no shut R1(config-router)#version 2
R1(config-if)#exit R1(config-router)#network 192.168.12.0
R1(config)# R1(config-router)#exit
RIP config
router rip
network 20.0.0.0
network 70.0.0.0
network 130.0.0.0
Rip protocol was used to execute the following network. This !
network has 6 routers, each connected to one switch which is
further connected to another switch. Each of these switches For router 3,
are connected to 2 devices. Each router is given one network interface FastEthernet0/0
and both the switches are connected to the router by the same ip address 40.0.0.2 255.0.0.0
gateway. duplex auto
speed auto
For router 1, !
interface FastEthernet0/0 interface FastEthernet0/1
ip address 10.0.0.2 255.0.0.0 no ip address
interface Serial0/0/0 duplex auto
ip address 70.0.0.2 255.0.0.0 speed auto
clock rate 64000 shutdown
!
interface Serial0/0/1 interface Serial0/0/0
no ip address ip address 160.0.0.2 255.255.0.0
clock rate 2000000 clock rate 64000
shutdown !
interface Serial0/0/1
shutdown CONCLUSION
! It can be concluded that when the number of routers is few,
interface Serial0/0/0 RIP could be used but it still cannot be said that it is an
ip address 94.0.0.2 255.0.0.0 efficient method. Delay and load on combination give better
clock rate 2000000 results, to simplify, RIP is chosen on the basis of hop count
! but on the other hand when two to three metrics are considered
interface Serial0/0/1 on a whole, the protocol chosen would be the most efficient
ip address 95.0.0.1 255.0.0.0 one. As per the results, OSPF has by far been the most
clock rate 2000000 preferred and the most used routing protocol.
!
interface Vlan1 REFERENCES
no ip address [1] Introduction to Dynamic Routing Protocols by Rocco Dawkins
shutdown [2] Routing Protocols and Concepts, CCNA Exploration Companion Guide
! [3] Dynamic Routing Protocols, By Jeff Doyle.Sample Chapter is provided
courtesy of Cisco Press, Date: Nov 16, 2001.
router eigrp 1
[4] IP Routing: From Basic Principles to Link State Protocols,By Heather
network 94.0.0.0 Osterloh,Mar 29, 2002
network 95.0.0.0 [5] http://www.9tut.com/rip-routing-protocol-tutorial
auto-summary [6] http://www.routeralley.com/guides/rip.pdf
[7] http://searchnetworking.techtarget.com/definition/Routing-Information-
!
Protocol
ip classless
Comparison between RIP, EIGRP, OSPF
S.N Routing Information Enhanced Interior Open Shortest Path
o. Protocol (RIP) Gateway Routing First (OSPF)
Protocol (EIGRP)
1 It is a distance It uses advanced It uses link state
vector routing distance vector routing protocol.
protocol. routing protocol.
2 Hop count 0-15 Hop count 0-255 There is no limit
means that it means that it on hop count so it
supports maximum supports maximum can support any
of 15 routers. of 255 routers. number of routers.
3 It is used for small It is used for It is used for large
organizations. medium and large enterprises.
organizations.
4 RIPv1: does not Supports VLSM. Supports VLSM.
support VLSM
RIPv2: Supports
VLSM
5 Administrative Administrative Administrative
distance is 120. distance is 100. distance is 90.
6 It calculates the It calculates the It calculates the
metric in terms of metric in terms of metric in terms of
Hop count. bandwidth and bandwidth
delay.
7 We can’t create We can create We can create
separate separate separate
administrative administrative administrative
boundary. boundary using boundary using
autonomous no. area no. within the
same area.
8 It is industry SRP It is Cisco SRP It is industry SRP