2012
DOI: 10.5120/7446-0401
|View full text |Cite
|
Sign up to set email alerts
|

Performance Analysis of RIP, OSPF, IGRP and EIGRP Routing Protocols in a Network

Abstract: In a network topology for forwarding packets various routing protocols are being used. Routers maintain a routing table for successful delivery of the packets from the source node to the correct destined node. The extent of information stored by a router about the network depends on the algorithm it follows. Most of the popular routing algorithms used are RIP, OSPF, IGRP and EIGRP. Here in this paper we are analyzing the performance of these very algorithms on the basis of the cost of delivery, amount of overh… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
15
0
2

Year Published

2015
2015
2022
2022

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 27 publications
(17 citation statements)
references
References 5 publications
0
15
0
2
Order By: Relevance
“…In their conclusions, they say that the OSPF protocol must be chosen by network administrators when there is restriction in the bandwidth of the network they manage. Also, other authors such as Rakheja et al in [7] have conducted studies comparing the performance of the RIP, OSPF, IGRP and EIGRP protocols. In their conclusions, they assert that the OSPF protocol is the one with the best overall performance.…”
Section: Related Workmentioning
confidence: 99%
“…In their conclusions, they say that the OSPF protocol must be chosen by network administrators when there is restriction in the bandwidth of the network they manage. Also, other authors such as Rakheja et al in [7] have conducted studies comparing the performance of the RIP, OSPF, IGRP and EIGRP protocols. In their conclusions, they assert that the OSPF protocol is the one with the best overall performance.…”
Section: Related Workmentioning
confidence: 99%
“…As the application packets are sent through various hops, nodes cache their origin so that they can send packets down to those children; if a node has a packet addressed to an address other than the sink, the packet is sent down through these cached address hops or up towards the sink so that it may reach a common ancestor with the destination. 1 After testing several configurations of no-attack RPL, 300 node simulations in a 500x400x1 meter volume (in both grid and random patterns) provided the greatest efficiency in generating results while retaining simulation accuracy. These results tend to reflect those of prior work, though accurate detailed analysis of this point currently is not feasible.…”
Section: A General Simulation Implementationmentioning
confidence: 99%
“…Numerous types of wireless networks exist, from home networks connecting to the internet through a gateways to cellular devices operating over a variety of protocols. Different wireless networks have different requirements in routing protocols; many home routers, for instance, use traditional RIP or OSPF [1] because they have enough resource to do so effectively and securely. However, other types of networks do not have such resources.…”
Section: Introductionmentioning
confidence: 99%
“…Pankaj et al [5], In this paper, On analyzing the result of the performance of various routing protocols naming RIP, OSPF, IGRP & EIGRP. Over transmission cost, router throughput, delay.…”
Section: Related Workmentioning
confidence: 99%