ScholarLens Back to search
2020•Unpublished venueRequires access

A Comparative Study on Routing Protocols: RIP, OSPF and EIGRP and Their Analysis Using GNS-3

Ambresh G. Biradar

Open publisher page 25 citations

Abstract

On the Internet, the routing of a data packet is the most important process. A routing protocol specifies the way to a router so that it can be connected to the internetworks with the help of a protocol called an Internet protocol. Internet applications make use of many routing protocols like RIPvl, RIPv2, OSPF, EIGRP, IGRP, etc. Each routing protocols have their own methods of routing a packet. This paper presents a basic comparative study of RIP, OSPF, and EIGRP protocols. The RIP makes use of a distance vector algorithm to choose the best path for a packet, OSPF makes use of a link state algorithm to decide the best path for a packet and EIGRP makes use of diffusing update algorithms to decide a path for a packet. In this paper, we are comparing and analyzing the performance of routing protocols such as RIP, OSPF, and EIGRP to decide the best protocol for routing packets.

About this research paper

What this paper is about

On the Internet, the routing of a data packet is the most important process. A routing protocol specifies the way to a router so that it can be connected to the internetworks with the help of a protocol called an Internet protocol. Internet applications make use of many routing protocols like RIPvl, RIPv2, OSPF, EIGRP, IGRP, etc. Each routing protocols have their own methods of routing a packet. This paper presents a basic comparative study of RIP, OSPF, and EIGRP protocols. The RIP makes use of a distance vector algorithm to choose the best path for a packet, OSPF makes use of a link state algorithm to decide the best path for a packet and EIGRP makes use of diffusing update algorithms to decide a path for a packet. In this paper, we are comparing and analyzing the performance of routing protocols such as RIP, OSPF, and EIGRP to decide the best protocol for routing packets.

Why it matters

OpenAlex reports 25 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

On the Internet, the routing of a data packet is the most important process. A routing protocol specifies the way to a router so that it can be connected to the internetworks with the help of a protocol called an Internet protocol. Internet applications make use of many routing protocols like RIPvl, RIPv2, OSPF, EIGRP, IGRP, etc. Each routing protocols have their own methods of routing a packet. This paper presents a basic comparative study of RIP, OSPF, and EIGRP protocols. The RIP makes use of a distance vector algorithm to choose the best path for a packet, OSPF makes use of a link state algorithm to decide the best path for a packet and EIGRP makes use of diffusing update algorithms to decide a path for a packet. In this paper, we are comparing and analyzing the performance of routing protocols such as RIP, OSPF, and EIGRP to decide the best protocol for routing packets.

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

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Comparative Study on Routing Protocols: RIP, OSPF and EIGRP and Their Analysis Using GNS-3 — Research Paper | ScholarLens