- : Ms Word, Ms Word Format
- : 70 Pages
- : ₦5,000
- : 1-5 Chapters
- Click to DOWNLOAD Materials
THE IMPROVEMENT OF ROUTING PERFORMANCE OF ROUTERS AND CORE SWITCHES BY USING ARTIFICIALLY INTELLIGENT NODE
ABSTRACT
A routing protocol is plays an important role in today‟s communication networks. It is also a protocol which is in charge of determining how routers and core-switches interconnect with each other and forward the packets through the best path to travel from a source to a destination using a predefined and user defined path finding and search algorithms. The leading and well-known routing protocols are Enhanced Interior Gateway Routing Protocol (EIGRP) and Open Shortest Path First (OSPF).In the metrics of Internet routing protocol performance, each of them has different architecture, flexibility, route processing delays and convergence abilities. The A search algorithm is the more optimal and complete search algorithm than that of Dijkstra algorithm and perfect for finding the shortest path. This thesis presents a simulation-based combination of Enhanced Interior Gateway Routing Protocol (EIGRP) and A search algorithm by using Network Simulator 2 (NS2). For performance evaluation of this combination, two network models are designed and configured with EIGRP and EIGRP with A search algorithms. The evaluation of the proposed routing protocol is performed based on the quantitative metrics such as delay, throughput and packet loss through the simulated network models. The evaluation results show that EIGRP routing protocol with A search algorithm provides better performance than EIGRP routing protocol.
ChatGPT
A routing protocol plays a crucial role in modern communication networks, overseeing the interconnection of routers and core-switches and directing packets along the optimal path from source to destination using predefined and user-defined path-finding algorithms. Among the prominent routing protocols are Enhanced Interior Gateway Routing Protocol (EIGRP) and Open Shortest Path First (OSPF). These protocols differ in architecture, flexibility, route processing delays, and convergence abilities, impacting their performance in Internet routing.
To improve the search for the shortest path, the A search algorithm surpasses the Dijkstra algorithm in optimality and completeness. This thesis proposes a simulation-based combination of Enhanced Interior Gateway Routing Protocol (EIGRP) with the A search algorithm, implemented using Network Simulator 2 (NS2). Two network models are designed and configured with EIGRP alone and EIGRP with A search to evaluate their performance.
Quantitative metrics such as delay, throughput, and packet loss are utilized to assess the proposed routing protocol's performance through the simulated network models. The evaluation results demonstrate that EIGRP with the A search algorithm outperforms the traditional EIGRP routing protocol, highlighting the superiority of the proposed approach.
THE IMPROVEMENT OF ROUTING PERFORMANCE OF ROUTERS AND CORE SWITCHES BY USING ARTIFICIALLY INTELLIGENT NODE GET MORE COMPUTER SCIENCE PROJECT TOPICS AND MATERIALS
