2022International Journal Of Scientific AdvancesOpen access

Evaluation of OSPF and EIGRP Routing for Network

Hamayoun Muhammad, Bing Su

Open full text 1 citations

Abstract

OSPF (Open shortest Path First) routing protocol is an advanced routing protocol which use link state routing and Dijkstra shortest path. EIGRP (Enhanced Interior Gateway Routing Protocol) is a progress interval transmitter routing protocol which is used in a computer network for automated routing decisions and configuration. Evaluation of these outcomes shows that OSPF routing is less efficient than EIGRP for real time applications. That’s why EGRIP is a greener router protocol. It perform the Project on dynamic routing in which I have briefly discussed. OSPF is an Open Normal Directing Procedure that can be used for a small organization as well as large multi-national companies. The Open Shortest Path First (OSPF) routing protocols major use in today as Internet compute a shortest path tree (SPT) from every router to other routers in a routing place. This vast protocol uses Dijkstra Algorithm for operations that helps in finding the shortest path from foundation to destination. Comparative Experiments exhibit that the proposed algorithm can successfully better the network performance in form of energy consumption, delay, and packet delivery rate.

Open-access reader

About this research paper

What this paper is about

OSPF (Open shortest Path First) routing protocol is an advanced routing protocol which use link state routing and Dijkstra shortest path. EIGRP (Enhanced Interior Gateway Routing Protocol) is a progress interval transmitter routing protocol which is used in a computer network for automated routing decisions and configuration. Evaluation of these outcomes shows that OSPF routing is less efficient than EIGRP for real time applications. That’s why EGRIP is a greener router protocol. It perform the Project on dynamic routing in which I have briefly discussed. OSPF is an Open Normal Directing Procedure that can be used for a small organization as well as large multi-national companies. The Open Shortest Path First (OSPF) routing protocols major use in today as Internet compute a shortest path tree (SPT) from every router to other routers in a routing place. This vast protocol uses Dijkstra Algorithm for operations that helps in finding the shortest path from foundation to destination. Comparative Experiments exhibit that the proposed algorithm can successfully better the network performance in form of energy consumption, delay, and packet delivery rate.

Why it matters

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

OSPF (Open shortest Path First) routing protocol is an advanced routing protocol which use link state routing and Dijkstra shortest path. EIGRP (Enhanced Interior Gateway Routing Protocol) is a progress interval transmitter routing protocol which is used in a computer network for automated routing decisions and configuration. Evaluation of these outcomes shows that OSPF routing is less efficient than EIGRP for real time applications. That’s why EGRIP is a greener router protocol. It perform the Project on dynamic routing in which I have briefly discussed. OSPF is an Open Normal Directing Procedure that can be used for a small organization as well as large multi-national companies. The Open Shortest Path First (OSPF) routing protocols major use in today as Internet compute a shortest path tree (SPT) from every router to other routers in a routing place. This vast protocol uses Dijkstra Algorithm for operations that helps in finding the shortest path from foundation to destination. Comparative Experiments exhibit that the proposed algorithm can successfully better the network performance in form of energy consumption, delay, and packet delivery rate.

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

Related papers

Back to paper searchBrowse research topicsOriginal source
Evaluation of OSPF and EIGRP Routing for Network — Research Paper | ScholarLens