Results 21 to 30 of about 841,820 (326)

Adaptive Optimized Open Shortest Path First Algorithm using Enhanced Moth Flame Algorithm

open access: goldIndian Journal of Science and Technology, 2017
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, Ashu Gupta
semanticscholar   +5 more sources

Performance Comparison based on Open Shortest Path First (OSPF) Routing Algorithm for IP Internet Networks

open access: goldCommunications on Applied Electronics, 2019
Due to the rapid development of technology, the higher demands of internet network users who want a form of network that can provide maximum results are increasing.
Desi Ramayanti, Ida Nurhaida, Imay Nur
semanticscholar   +3 more sources

Minimax open shortest path first routing algorithms in networks supporting the SMDS service [PDF]

open access: greenProceedings of ICC '93 - IEEE International Conference on Communications, 2002
Two quasi-static minimax open shortest path first (OSPF) routing algorithms in networks supporting the Switched Multi-megabit Data Service (SMDS) are presented and compared. In OSPF routing, the network is modeled as a graph and each link is associated with a nonnegative arc weight.
F.Y.S. Lin, J.L. Wang
openaire   +3 more sources

Performance of VoIP Using Routing Open Shortest Path First with Multi-Protocol Label Switching [PDF]

open access: goldInternational Journal of Advanced Technology in Mechanical, Mechatronics and Materials, 2021
Voice over internet protocol is a communication technology in the world of computer network that can be used for sending voice or video and data transmission over Internet Protocol in real time. VoIP network can be implemented with Asterisk applications as a server to a Private Automatic Branch eXchange applied in a Graphical Network Simulator 3.
Danang Sunandar   +2 more
openaire   +3 more sources

Analisis dan Perancangan Simulasi Perbandingan Kinerja Jaringan Komputer Menggunakan Metode Protokol Routing Statis, Open Shortest Path First (OSPF) dan Border Gateway Protocol (BGP) (Studi Kasus Tanri Abeng University)

open access: gold, 2021
Network is a communication between two devices to communicate with each other either using wire or wireless media. The LAN network topology used at Tanri Abeng Unversity still uses a static routing topology, where the routing process is still done ...
Sahril Amuda   +2 more
semanticscholar   +3 more sources

Analisis Performa Open Shortest Path First Load Balancing dengan Metode Cost Manipulation [PDF]

open access: gold, 2022
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.
Firmansyah, Firmansyah   +1 more
core   +3 more sources

Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs [PDF]

open access: yesarXiv, 2021
The restoration lemma by Afek, Bremler-Barr, Kaplan, Cohen, and Merritt [Dist. Comp. '02] proves that, in an undirected unweighted graph, any replacement shortest path avoiding a failing edge can be expressed as the concatenation of two original shortest paths.
Bodwin, Greg, Parter, Merav
arxiv   +2 more sources

Analisis Routing Loop dalam Open Shortest Path First (OSPF) Routing Menggunakan Teknik Spanning Tree di Jaringan Multi Area

open access: hybridHello World Jurnal Ilmu Komputer
Konektivitas jaringan merupakan hal mendasar yang harus diterapkan dalam suatu instansi atau perusahaan, dengan tujuan untuk memudahkan pertukaran dan pengumpulan data.
Rachmat Aulia, Risko Liza, Haida Dafitri
semanticscholar   +3 more sources

Shortest Odd Paths in Undirected Graphs with Conservative Weight Functions [PDF]

open access: yesarXiv, 2023
We consider the Shortest Odd Path problem, where given an undirected graph $G$, a weight function on its edges, and two vertices $s$ and $t$ in $G$, the aim is to find an $(s,t)$-path with odd length and, among all such paths, of minimum weight. For the case when the weight function is conservative, i.e., when every cycle has non-negative total weight,
Jüttner, Alpár   +5 more
arxiv   +2 more sources

Implementation of Dijkstra's Algorithm in Open Shortest Path First (OSPF) Routing Protocol Using Juniper

open access: yesINFORMATICS FOR EDUCATORS AND PROFESSIONAL : Journal of Informatics, 2022
In the modern era with the growth of human resources and the acceleration of the need for rapid communication, of course it must be accompanied by the development of network technology to support these needs, in this case network technology plays a very important role as a bridge to connect between nodes or individuals.
Achmad, Fadhil Khanifan   +2 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy