Adaptive Optimized Open Shortest Path First Algorithm using Enhanced Moth Flame Algorithm
Objective: To builds up a versatile algorithm in view of Open Shortest Path First (OSPF) algorithm by using improved moth flame optimization. The designed algorithm gives the upgraded performance even with dynamic topology. Methods/Statistical Analysis: The optimized OSPF algorithm utilizes the directing conduct of moth to exchange the information from
Pertik Garg, Asuh Gupta
openalex +4 more sources
Optimasi Simulasi Routing OSPF (Open Shortest Path First) di Bandara Soekarno Hatta
Bandar Udara Internasional Soekarno-Hatta adalah bandara terbesar di Indonesia dengan luas mencapai 18 km2, dengan rute penerbangan mencapai 1657 penerbangan setiap hari, yang merupakan penerbangan terbanyak se-Indonesia. PT. Angkasa Pura II merupakan Badan Usaha Milik Negara yang mengelola pelayanan jasa kebandar-udaraan di Bandara Soekarno Hatta ...
Lady Silk Moonlight
openalex +4 more sources
Less Congested Open Shortest Path First Algorithm for Computer Networks(Arbic) [PDF]
ManarYounisKashmola+1 more
openalex +2 more sources
Analisis Performa Open Shortest Path First Load Balancing dengan Metode Cost Manipulation [PDF]
Quality of Service (QoS) di dalam sebuah layanan jaringan menjadi faktor terpenting untuk memastikan kapasitas transfer paket data. Salah satunya pemilihan protokol routing yang akan digunakan.
Mochamad Wahyudi, Firmansyah Firmansyah
openalex +3 more sources
Comparative Analysis of Routing Internet Protocol and Open Shortest Path First Protocols Using QUALNET [PDF]
Reliability is a major consideration in Network Design and Implementation in order to cater for link failures. Link failure is a frequent occurrence in Networks and Communications Systems, and the speed at which this disruption is noticed and (or ...
Ammar Ali, A S, Oluwaranti A.I
openalex +3 more sources
Extending Open Shortest Path First for Mobile Ad Hoc Network Routing
Katherine E. Isaacs+2 more
openalex +3 more sources
Multi-Objective Decision-Making Meets Dynamic Shortest Path: Challenges and Prospects
The Shortest Path (SP) problem resembles a variety of real-world situations where one needs to find paths between origins and destinations. A generalization of the SP is the Dynamic Shortest Path (DSP) problem, which also models changes in the graph at ...
Juarez Machado da Silva+2 more
doaj +1 more source
Performance analysis and improvement of the Open Shortest Path First routing protocol. [PDF]
Mahad Ahmed
openalex +3 more sources
Routing Path Assignment for Joint Load Balancing and Fast Failure Recovery in IP Network
Distributed link-state routing protocols, including Open Shortest Path First (OSPF) and Intermediate System–Intermediate System (IS-IS), have successfully provided robust shortest path routing for IP networks. However, shortest path routing is inflexible
Tabinda Ashraf+3 more
doaj +1 more source
With the explosion of traffic demand in recent years, the integration of satellite optical networks and terrestrial networks (ISTN) creates a promising networking solution for future low-latency, high-rate, and high-capacity communications.
Wei Zhou+9 more
doaj +1 more source