The Report is Generated by DrillBit Plagiarism Detection Software

Submission Information

Author Name PRAJWAL B TEGUR

Title DISTANCE VECTOR ROUTING
Paper/Submission ID 1543549
Submitted by library@nie.ac.in
Submission Date 2024-03-18 17:03:26
Total Pages 11
Document type Project Work

Result Information

Similarity 20 %
1 10 20 30 40 50 60 70 80 90

Sources Type Report Content

Internet Quotes
0.6% 0.42%

Journal/ Words <

Publicatio 14,
n 19.4% 3.91%

Exclude Information Database Selection

Quotes Excluded Language English

References/Bibliography Excluded Student Papers Yes
Sources: Less than 14 Words % Not Excluded Journals & publishers Yes
Excluded Source 0% Internet or Web Yes
Excluded Phrases Not Excluded Institution Repository Yes

A Unique QR Code use to View/Download/Share Pdf File

DrillBit Similarity Report

A-Satisfactory (0-10%)
B-Upgrade (11-40%)

20 14 B C-Poor (41-60%)
D-Unacceptable (61-100%)
SIMILARITY % MATCHED SOURCES GRADE

LOCATION MATCHED DOMAIN % SOURCE TYPE

1 information-science-engineering.newhorizoncollegeofengineering.in Publication
5

2 drttit.gvet.edu.in Publication
2

3 index-of.es Publication
2

4 sjcit.ac.in Publication
2

5 gfgc.kar.nic.in Publication
2

6 hct.ac.ae Publication
1

7 davangereuniversity.ac.in Publication
1

8 lavalle.pl Publication
1

9 sjcit.ac.in Publication
1

10 www.amity.edu Publication
1

11 index-of.es Publication
1

12 Semiempirical closed-form models for the inversion-layer centroid of , Publication

1
by S. Rodrguez J. A.- 2000

13 www.scribd.com Internet Data

1
VISVESVARAYA TECHNOLOGICAL UNIVERSITY
“Jnana Sangama “, Belagavi-590018, Karnataka

A Project Report On

“DISTANCE VECTOR ROUTING”

4 2
Submitted in partial fulfillment of the requirement for the award degree of
Bachelor of Engineering
In
1
Information Science and Engineering

Submitted By
PRAJWAL B TEGUR (4NN21IS035)

Under the Guidance of

7
Mr. SUDEEP J

Assistant Professor,
9
Department of Information Science and Engineering

1
Department of Information Science and Engineering
NIE INSTITUTE OF TECHNOLOGY
Mysuru - 570018
2023-24
 Department of Information Science and Engineering
2
NIE Institute of Technology

CERTIFICATE
Certified that the project work entitled “DISTANCE VECRTOR ROUTING” carried out by
7
Mr. PRAJWAL B TEGUR bearing USN: 4NN21IS035 is a bona fide student of 5th SEM in
2
partial fulfillment for the award of Bachelor of Engineering in of the Visvesvaraya
Technological University, Belagavi during the year 2023-2024. It is certified that all
1
corrections/suggestions indicated for Internal Assessment have been incorporated in the
Report deposited in the departmental library. The mini-project report has been approved as it
11
satisfies the academic requirements in respect of work prescribed as a part of the B.E degree.

7
Signature of the Guide Signature of the HOD
Mr. SUDEEP J Dr. NANDINI M S
Assistant Professor Associate Professor &HOD
1
Dept. of ISE Dept. of ISE
NIEIT, Mysuru. NIEIT, Mysuru.

External Viva
Name of the examiners Signature with Date
1. ............................................ 1................................................
2. ............................................ 2.................................................
 DECLARATION

I, Prajwal B Tegur, bearing USN 4NN21IS035, student of 5th semester B.E, Department
9
of Information Science and Engineering, NIE institute of technology, Mysuru declare that
the project work entitled “DISTANCE VECTOR ROUTING” has been carried out by
10 4
us and submitted in partial fulfillment of the course requirements for award of degree in
1 4
Bachelor of Engineering in Information Science and Engineering of Visveswaraya
10
Technological University, Belagavi during the academic year 2023-2024. The matter
7 1
embodied in this report has not been submitted to any other university or institution for
5
award of any other degree or diploma.

Place: Mysuru Prajwal B Tegur (4NN21IS035)

Date:
 ACKNOWLEDGMENT

I sincerely owe gratitude to all people who helped and guided us in completing this mini
4
project work.
I am thankful to Dr ROHINI NAGAPADMA, Principal, NIEIT, Mysuru for having
supported me in our academic endeavors.
1
I am thankful to Dr. NANDINI M S, Head of Department of Information Science
and Engineering, NIEIT for providing me timely suggestion, encouragement and support to
complete this project.

I would sincerely thank my project guide Mr. SUDEEP J, Assistant professor in

Department of Information Science and Engineering for providing relevant information,
13
valuable guidance and encouragement to complete this project.
5
I would also like to thank all our teaching and non-teaching staff members of the
Department. We are grateful to the collage for keeping labs open whenever required and
providing us system and required software.

I am also thankful to our parents and friends for their valuable support and guidance
6
in every step throughout the project.

I express my deepest gratitude and indebted thanks to NIEIT which has provided us
an opportunity in fulfilling our most cherished desire of reaching our goal.

Yours sincerely

Prajwal B Tegur (4NN21IS035)

 ABSTRACT

Distance Vector Routing (DVR) is a fundamental algorithm used in

computer networking to determine the best path for data packets to travel
11 6
from a source to a destination. This seminar report provides a comprehensive
overview of DVR, covering its principles, applications, and recent
advancements.

The report begins by introducing the basic concepts of DVR, including

the routing table, distance metrics, and the Bellman-Ford algorithm. It then
delves into the operation of DVR protocols such as RIP (Routing Information
Protocol) and EIGRP (Enhanced Interior Gateway Routing Protocol),
highlighting their strengths and limitations.

Furthermore, the seminar explores the practical applications of DVR in

real-world networking scenarios, ranging from small-scale local area
networks to large-scale internet routing. It discusses the importance of DVR
in achieving efficient and reliable communication in dynamic network
environments.

In addition to its traditional uses, the report also examines recent

advancements in DVR technology. Topics such as hybrid routing protocols,
convergence optimization techniques, and security enhancements are
explored to showcase the ongoing evolution of DVR in response to emerging
networking challenges.

Overall, this seminar report serves as a valuable resource for network

engineers, researchers, and students seeking a deeper understanding of
Distance Vector Routing and its significance in contemporary networking
systems.
 12
TABLE OF CONTENT

Sl No CHAPTER PAGE NUMBER

1 Introduction 7
2 Significance of DVR 7
3 Working Principle of DVR 8
4 Protocols of DVR 11
5 Real World Example of DVR 12
6 Conclusion 13
7 References 13
CHAPTER 1: INTRODUCTION

Routing is a very important aspect of computer networks. It facilitates the transfer

3
of data packets between devices. Routing involves determining the optimum path
for data packets to traverse from source node to a destination across interconnected
network devices. There are different kind of routing algorithms. Some of them are
 LS Routing (Link State Routing)
 DV Routing (Distance Vector Routing)
 Hierarchical Routing etc.
Within the routing algorithms, Distance Vector Routing stands out as a significant
approach in managing network traffic effectively. DV Routing algorithms work on
the principle of exchanging routing information among neighboring routers to
construct and maintain routing tables. The given tables contain information about
the distance and direction to reach various destinations within the network.

CHAPTER 2: SIGNIFICANCE OF DVR

The significance of DV Routing is its ability to adapt to changes in network

structure and traffic conditions in a dynamic manner. Nodes continuously exchange
routing updates with neighboring routers and by doing so, Distance Vector Routing
protocols enable routers to make informed decisions about packet forwarding based
on real-time information.
Key advantage of Distance Vector Routing is it is very simple and resources are
used efficiently. The algorithm is straightforward to implement and requires
minimal computations and calculations which makes it suitable for both small-scale
and large-scale networks. Additionally, Distance Vector protocols like ‘Routing
Information Protocol’ are well-suited for environments with less bandwidth and
computational resources.
Distance Vector Routing algorithms offer inbuilt error tolerance. By disseminating
routing updates in the whole network, routers can quickly converge to new routes
in the event of link failures or network topology changes. This dynamic adaptation
ensures network resilience and minimizes downtime, enhancing overall network
reliability.
DV Routing protocols support incremental updates, whereby only changes to
routing information are transmitted rather than the entire router table. This feature
reduces network overhead and conserves bandwidth, especially in scenarios with
frequent topology changes or limited bandwidth availability.
CHAPTER 3: WORKING PRINCIPLE OF DVR

Distance Vector Routing is based on the exchange of routing information between

6
neighboring routers to determine the best path for data transmission. The algorithm
operates iteratively, with routers periodically sharing their routing tables with
adjacent routers and updating their own tables based on received information. Let's
explore the working principle with a diagrammatic example:
Consider a simple network topology comprising four routers (A, B, C, and D)
interconnected as follows:

A
/\
/ \
/ \
B _______ C
\ /
\ /
\/
D

Step 1: Initialize
At the start, every router initializes its routing table, containing entries for directly
connected neighbors and infinity (∞) for all other destinations. For example, Router
A's initial routing table may look like this:
DESTINATION NEXT HOP COST
B B 1
C C 1
D D ∞

Step 2: Exchange of Routing Information

Routers exchange routing tables with connected routers in the network. For
14
instance, Router A exchange its routing table with Routers B and C, while
receiving tables from them in return. Each router calculates the distance to various
5
destinations on the basis of the received routing information.

Step 3: Update Routing Tables

When a node receives routing updates from neighboring routers, every router
recalculates its routing table based on the received information. The router updates
its entries for destinations based on the smallest cost path obtained from
 8
neighboring routers. This process continues iteratively until convergence is
achieved, i.e., no further changes occur in routing tables.

Step 4: Example of Routing Table Update:

Suppose Router B receives a routing update from Router C indicating that the cost
to reach Router D is 2 units. Router B compares this cost with its existing cost to
reach Router D. If the new cost is lower, Router B updates its routing table
accordingly.
Before update:
DESTINATION NEXT HOP COST
D D 3
After update:
DESTINATION NEXT HOP COST
D C 2

Step 5: Convergence
The process of exchanging and updating routing tables continues until all routers
have consistent routing information. Eventually, the network converges to a stable
state where each router has optimal paths to reach all destinations. This
diagrammatic example illustrates the iterative nature of Distance Vector Routing,
where routers collaborate to determine the best paths for data transmitting based on
distance metrics.

Final Tables stand as below.

Router A: Router C:
DEST NEXT COST DEST NEXT COST
B B 1 A A 1
C C 1 B B 1
D B 2 D D 1

Router B: Router D:
DEST NEXT COST DEST NEXT COST
A A 1 A B 2
C C 1 B C 2
D C 2 C C 1
CHAPTER 4: PROTOCOLS OF DVR

1. RIP (Routing Information Protocol):

Routing Metrics: RIP uses hop count as its routing metric, where the amount of
3
hops between routers represents the distance to a destination network. It assumes
that the shortest path to a destination is the one with the fewest hops.
Update Mechanisms: RIP exchanges routing updates periodically (every 30
seconds by default) or in response to change the network topology has gone
through. It utilizes broadcast updates, where routers broadcast their entire routing
tables to neighboring routers.
Compatibility: RIP is compatible with small to medium-sized networks and is
widely supported by various router vendors. It is suitable for homogeneous network
environments with relatively stable topologies.
Scalability: RIP has limitations in scalability due to its reliance on hop number as
the metric and the frequency of periodic updates. In large networks, RIP's
convergence time may be slow, and its routing table size can become unwieldy.

2. EIGRP (Enhanced Interior Gateway Routing Protocol):

Routing Metrics: EIGRP uses a composite metric based on bandwidth, delay,
reliability, and load to calculate the best path to a destination. It considers multiple
factors when determining route preferences.
Update Mechanisms: EIGRP employs a combination of periodic updates and
triggered updates in response to topology changes. It uses a reliable transport
protocol (usually RTP - Reliable Transport Protocol) for exchanging routing
information.
Compatibility: EIGRP is suitable for medium to large-sized networks and is
commonly used in enterprise environments. It is compatible with Cisco routers and
is often preferred in heterogeneous network environments.
Convergence Time: RIP's convergence time can be relatively slow, especially in
networks with frequent topology changes. The use of periodic updates and the
limitations of hop count as a metric contribute to this delay.

3. IGRP (Interior Gateway Routing Protocol):

Routing Metrics: IGRP uses a composite metric similar to EIGRP, incorporating
factors like bandwidth, delay, reliability, and load. It provides more granular
control over route selection compared to RIP.
Update Mechanisms: IGRP utilizes both periodic updates and triggered updates,
similar to EIGRP. It employs a very reliable tranmission protocol for exchanging
routing information and has mechanisms to prevent routing loops.
Compatibility: IGRP was developed by Cisco and is primarily used in older
networks. It is less commonly deployed today compared to RIP and EIGRP.
However, it is compatible with Cisco routers and supports features similar to
EIGRP.
Scalability: IGRP offers scalability improvements over RIP but may not be as
scalable as EIGRP in larger networks. It can handle medium-sized networks with
moderate convergence times and routing table sizes.

CHAPTER 4: REAL WORLD APPLICATION

RIP in Small Office Network

Scenario: A small office with limited networking requirements and a tight budget
requires a routing protocol that is easy to configure and manage.
Solution: The network administrator decides to deploy RIP (Routing Information
Protocol) due to its simplicity and low overhead. RIP's hop count metric aligns well
with the small office's network topology, which has few routers interconnected in a
single LAN.
Deployment Details:
RIP is configured on all routers within the office network.
The routers exchange routing updates every 30 seconds, allowing for quick
convergence in case of topology changes.
RIP's ease of configuration and minimal resource requirements make it an ideal
choice for the small office environment.
Outcome: The deployment of RIP enables the small office to establish reliable
connectivity between its internal resources, such as workstations, printers, and
servers. The network operates efficiently, with RIP dynamically adapting to
changes in network topology, ensuring seamless communication among devices.

CONCLUSION

Distance Vector Routing is a fundamental concept in computer networking,

offering a decentralized approach to route computation and packet forwarding.
Despite its limitations, Distance Vector Routing protocols remain relevant and
widely used in diverse networking environments. By understanding the principles,
protocols, and applications of Distance Vector Routing, network engineers can
design and manage efficient and reliable communication networks.