Scribd
Upload
24 views4 pages

Copy-CN Ex-12

The document presents a case study on different routing algorithms, focusing on Link State and Distance Vector routing. Link State routing selects optimal paths based on structured addresses and routing tables, while Distance Vector routing uses periodic updates and calculates paths based on distance and direction. The study concludes with an overview of the efficiency and economic considerations of these routing methods during data transfer.

Uploaded by

dr.aishumuppaneni
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
24 views4 pages

Copy-CN Ex-12

The document presents a case study on different routing algorithms, focusing on Link State and Distance Vector routing. Link State routing selects optimal paths based on structured addresses and routing tables, while Distance Vector routing uses periodic updates and calculates paths based on distance and direction. The study concludes with an overview of the efficiency and economic considerations of these routing methods during data transfer.

Uploaded by

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

CS22511 – COMPUTER NETWORKS LABORATORY

EX.NO : 12
DATE :
PERFORM A CASE STUDY ABOUT THE DIFFERENT
ROUTING ALGORITHMS TO SELECT THE NETWORK PATH WITH
ITS OPTIMUM AND ECONOMICAL DURING DATA TRANSFER.

1.LINK STATE ROUTING:


Aim: To study about link state routing algorithm.

Link State routing Routing is the process of selecting best paths in a network. In
the past, the term routing was also used to mean forwarding network traffic
among networks. However this latter function is much better described as
simply forwarding. Routing is performed for many kinds of networks, including
the telephone network (circuit switching), electronic data networks (such as the
Internet), and transportation networks. This article is concerned primarily with
routing in electronic data networks using packet switching technology.

In packet switching networks, routing directs packet forwarding (the


transit of logically addressed network packets from their source toward
their ultimate destination) through intermediate nodes. Intermediate nodes
are typically network hardware devices such as routers, bridges, gateways,
firewalls, or switches. General-purpose computers can also forward
packets and perform routing, though they are not specialized hardware and
may suffer from limited performance. The routing process usually directs
forwarding on the basis of routing tables which maintain a record of the
routes to various network destinations. Thus, constructing routing tables,
which are held in the router's memory, is very important for efficient
routing. Most routing algorithms use only one network path at a time.
Multipath routing techniques enable the use of multiple alternative paths.

In case of overlapping/equal routes, the following elements are considered


in order to decide which routes get installed into the routing table (sorted
by priority):
1. Prefix-Length: where longer subnet masks are preferred (independent of

REG NO :
PAGE
whether it is within a routing protocol or over different routing protocol)
2. Metric: where a lower metric/cost is preferred (only valid within one and
the same routing protocol)
3. Administrative distance: where a lower distance is preferred (only valid
between different routing protocols)

Routing, in a more narrow sense of the term, is often contrasted with


bridging in its assumption that network addresses are structured and that
similar addresses imply proximity within the network. Structured addresses
allow a single routing table entry to represent the route to a group of
devices. In large networks, structured addressing (routing, in the narrow
sense) outperforms unstructured addressing (bridging). Routing has
become the dominant form of addressing on the Internet. Bridging is still
widely used within localized environments.

2. DISTANCE VECTOR :
In computer communication theory relating to packet-switched networks, a
distance vector routing protocol is one of the two major classes of routing
protocols, the other major class being the link-state protocol. Distance-
vector routing protocols use the Bellman–Ford algorithm, Ford– Fulkerson
algorithm, or DUAL FSM (in the case of Cisco Systems’ protocols) to
calculate paths.
A distance-vector routing protocol requires that a router informs its
neighbors of topology changes periodically. Compared to link-state
protocols, which require a router to inform all the nodes in a network of
topology changes, distance-vector routing protocols have less
computational complexity and message overhead. The term distance vector
refers to the fact that the protocol manipulates vectors (arrays) of distances
to other nodes in the network. The vector distance algorithm was the
original ARPANET routing algorithm and was also used in the internet
under the name of RIP (Routing Information Protocol).
Examples of distance-vector routing protocols include RIPv1 and RIPv2
and IGRP. Method Routers using distance-vector protocol do not have
knowledge of the entire path to a destination. Instead they use two
methods:
1. Direction in which router or exit interface a packet should be forwarded.

REG NO :
PAGE
2. Distance from its destination .

REG NO :
PAGE
Distance-vector protocols are based on calculating the direction and distance to
any link in a network. "Direction" usually means the next hop address and the
exit interface. "Distance" is a measure of the cost to reach a certain node. The
least cost route between any two nodes is the route with minimum distance.
Each node maintains a vector (table) of minimum distance to every node. The
cost of reaching a destination is calculated using various route metrics. RIP uses
the hop count of the destination whereas IGRP takes into account other
information such as node delay and available bandwidth.

Updates are performed periodically in a distance-vector protocol where all or


part of a router's routing table is sent to all its neighbors that are configured to
use the same distance-vector routing protocol. RIP supports cross-platform
distance vector routing whereas IGRP is a Cisco Systems proprietary distance
vector routing protocol. Once a router has this information it is able to amend its
own routing table to reflect the changes and then inform its neighbors of the
changes. This process has been described as ‗routing by rumor‘ because routers
are relying on the information they receive from other routers and cannot
determine if the information is actually valid and true. There are a number of
features which can be used to help with instability and inaccurate routing
information.

EGP and BGP are not pure distance-vector routing protocols because a
distance-vector protocol calculates routes based only on link costs whereas in
BGP, for example, the local route preference value takes priority over the link
cost. Count-to-infinity problem The Bellman–Ford algorithm does not
prevent routing loops from happening and suffers from the count-to-infinity
problem. The core of the count-to-infinity problem is that if A tells B that it
has a path somewhere, there is no way for B to know if the path has B as a
part of it. To see the problem clearly, imagine a subnet connected like A–B–
C–D–E–F, and
let the metric between the routers be "number of jumps". Now suppose that A is
taken offline. In the vector-update-process B notices that the route to A, which
was distance 1, is down – B does not receive the vector update from A. The
problem is, B also gets an update from C, and C is still not aware of the fact
that A is down – so it tells B that A is only two jumps from C (C to B to A),
which is false. This slowly propagates through the network until it reaches
infinity (in which case the algorithm corrects itself, due to the relaxation
property of Bellman–Ford).

RESULT:
Thus the case study about the different routing algorithms to select the
network path with its optimum and economical during data transfer was studied.
REG NO :
PAGE

You might also like