2010•Unpublished venueRequires access

Dynamic Routing Protocol Implementation Decision between EIGRP, OSPF and RIP Based on Technical Background Using OPNET Modeler

Sheela Ganesh Thorenoor

Open publisher page 84 citations

Abstract

This paper presents th implementation decisions to be made when th choice is between protocols that involve distance vector or link state or the combination of both. Here a comparison is made between different parameters and a detailed simulation study is performed on the network with different routing protocols and it has been shown that EIGRP provides a better network convergence time, less bandwidth requirements and better CPU and memory utilization compared to OSPF and RIP. EIGRP, OSPF and RIP are the dynamic routing protocols being used in the practical networks to propagat network topology information to the neighboring routers. There have been a large number of static and dynamic routing protocols available but choice of the right protocol for routing is dependent on many parameters critical being network convergence time, scalability, memory and CPU requirements, security and bandwidth requirement etc.

About this research paper

What this paper is about

This paper presents th implementation decisions to be made when th choice is between protocols that involve distance vector or link state or the combination of both. Here a comparison is made between different parameters and a detailed simulation study is performed on the network with different routing protocols and it has been shown that EIGRP provides a better network convergence time, less bandwidth requirements and better CPU and memory utilization compared to OSPF and RIP. EIGRP, OSPF and RIP are the dynamic routing protocols being used in the practical networks to propagat network topology information to the neighboring routers. There have been a large number of static and dynamic routing protocols available but choice of the right protocol for routing is dependent on many parameters critical being network convergence time, scalability, memory and CPU requirements, security and bandwidth requirement etc.

Why it matters

OpenAlex reports 84 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper presents th implementation decisions to be made when th choice is between protocols that involve distance vector or link state or the combination of both. Here a comparison is made between different parameters and a detailed simulation study is performed on the network with different routing protocols and it has been shown that EIGRP provides a better network convergence time, less bandwidth requirements and better CPU and memory utilization compared to OSPF and RIP. EIGRP, OSPF and RIP are the dynamic routing protocols being used in the practical networks to propagat network topology information to the neighboring routers. There have been a large number of static and dynamic routing protocols available but choice of the right protocol for routing is dependent on many parameters critical being network convergence time, scalability, memory and CPU requirements, security and bandwidth requirement etc.

Key concepts: Routing Information Protocol, Open Shortest Path First, Computer science, Computer network, Distance-vector routing protocol, Enhanced Interior Gateway Routing Protocol, Routing protocol, Link-state routing protocol

Related papers

Back to paper searchBrowse research topicsOriginal source
Dynamic Routing Protocol Implementation Decision between EIGRP, OSPF and RIP Based on Technical Background Using OPNET Modeler — Research Paper | ScholarLens