World Journal of Engineering Research and Technology (WJERT) has indexed with various reputed international bodies like : Google Scholar , Index Copernicus , Indian Science Publications , SOCOLAR, China , International Institute of Organized Research (I2OR) , Cosmos Impact Factor , Research Bible, Fuchu, Tokyo. JAPAN , Scientific Indexing Services (SIS) , Jour Informatics (Under Process) , UDLedge Science Citation Index , International Impact Factor Services , International Scientific Indexing, UAE , International Society for Research Activity (ISRA) Journal Impact Factor (JIF) , International Innovative Journal Impact Factor (IIJIF) , Science Library Index, Dubai, United Arab Emirates , Scientific Journal Impact Factor (SJIF) , Science Library Index, Dubai, United Arab Emirates , Eurasian Scientific Journal Index (ESJI) , Global Impact Factor (0.342) , IFSIJ Measure of Journal Quality , Web of Science Group (Under Process) , Directory of Research Journals Indexing , Scholar Article Journal Index (SAJI) , International Scientific Indexing ( ISI ) , Scope Database , Academia , Research Publication Rating and Indexing , 

World Journal of Engineering Research and Technology

( An ISO 9001:2015 Certified International Journal )

An International Peer Reviewed Journal for Engineering Research and Technology

An Official Publication of Society for Advance Healthcare Research (Reg. No. : 01/01/01/31674/16)

ISSN 2454-695X

Impact Factor : 7.029

ICV : 79.45

WJERT Citation

  All Since 2020
 Citation  172  110
 h-index  7  5
 i10-index  1  0

News & Updation

  • Article Invited for Publication

    Article are invited for publication in WJERT Coming Issue

  • ICV

    WJERT Rank with Index Copernicus Value 79.45 due to high reputation at International Level

  • WJERT New Impact Factor

    WJERT Impact Factor has been Increased to 7.029 for Year 2024.

  • WJERT: MARCH ISSUE PUBLISHED

    MARCH 2025 Issue has been successfully launched on 1 MARCH 2025.

  • New Issue Published

    Its Our pleasure to inform you that, WJERT March 2025 Issue has been Published, Kindly check it on https://www.wjert.org/home/current_issues

Abstract

DESIGN AND IMPLEMENTATION OF A NETWORK ROUTING FOR PATH SELECTION USING DIJKSTRA ALGORITHM

*Dr. ILO Somotoochukwu, Amadi Christopher, Umesi Cosmos N. and
Osondu U. S.

ABSTRACT

The complete network of large number of interconnected autonomous system, each of which consists of a distinct domain, need to communicate to different nodes to forward the information. There are various means of communications between these systems. Routing is one of them. Routing refers to the overall network wide process that determines end to end paths that datagram will take from source to destinations. There are different routing algorithms available such as BELLMAN FORD ALGORITHM which is decentralized routing algorithm and DIJKSTRA ALGORITHM which is a global routing algorithm. In global routing algorithm, each router has a complete view of the network, whereas in a decentralized routing algorithm each router has a local view consisting of its directly attached neighbors. Out of this Dijkstra algorithm is mostly preferred as it is faster as compared to any other algorithm and its implementation is easier. In this algorithm, router based information that has been collected from other routers, builds a graph of the network which shows the locations & links of routers within themselves and network. These links are labeled with a number called weight or cost. If there are two links between a node and destination, the router chooses the link with the lowest weight. One of the advantages of Dijkstra algorithm is that router computes routes independently using the same original status data; they do not depend on the computation of intermediate machines. Because link status messages propagated unchanged, it is easy to debug problems. Because routers perform the route computation locally, it is guaranteed to converge. Finally, because link status messages only carry information about the direct connections from a single router, the size does not depend on the number of networks in the networks in the internet. Thus, Dijkstra algorithms scale better than distance vector algorithms. We have implemented Dijkstra algorithm for routing purpose.

[Full Text Article] [Download Certificate]