Results 11 to 20 of about 60,272 (312)

Open Shortest Path First extension for the support of multiarea networks with arbitrary topologies

open access: yesIET Networks
Open Shortest Path First (OSPF) currently supports multiarea networking with two severe limitations: the multiarea topology is restricted to a two‐level hierarchy, and globally optimal routing may not be achieved.
Xavier Gomes, João Fonseca, Rui Valadas
doaj   +4 more sources

Open shortest path first routing under random early detection [PDF]

open access: yesNetworks, 2017
This is the peer reviewed version of the following article: Liu, J. and Dimitrov, S. (2018), Open shortest path first routing under random early detection.
Stanko Dimitrov   +3 more
core   +4 more sources

Optimasi Jaringan Routing Open Shortest Path First Dengan Menggunakan Multiprotocol Label Switching [PDF]

open access: yesBriliant: Jurnal Riset dan Konseptual, 2020
Routing adalah sebuah proses dimana item dapat disampaikan melalui sebuah rute jaringan yang terkonfigurasi untuk mencapai titik tujuan dari suatu lokasi.
Marcus, Ronald David   +2 more
core   +5 more sources

Fuzzy particle swarm optimization algorithms for the open shortest path first weight setting problem [PDF]

open access: yesApplied Intelligence, 2016
The open shortest path first (OSPF) routing protocol is a well-known approach for routing packets from a source node to a destination node. The protocol assigns weights (or costs) to the links of a network. These weights are used to determine the shortest paths between all sources to all destination nodes.
Salman A Khan   +2 more
exaly   +4 more sources

PENERAPAN OPEN SHORTEST PATH FIRST (OSPF) UNTUK MENENTUKAN JALUR TERBAIK DALAM JARINGAN

open access: yesJurnal Elektro dan Telekomunikasi Terapan, 2017
Jaringan komputer skala besar sering kali menghadapi masalah dalam komunikasi data. Transmisidatanya membutuhkan waktu yang lama karena pemilihan protokol routing yang tidak tepat.Protokol routing yang dipilih tidak dapat memberikan alternatif jalur ...
Hari Antoni Musril, Musril, Hari Antoni
core   +3 more sources

On open shortest path first related network optimisation problems

open access: yesPerformance Evaluation, 2002
The paper deals with flow allocation problems in IP networks using open shortest path first (OSPF) routing. Its main purpose is to discuss and propose methods for finding settlements of OSPF link weight system realising the assumed demand pattern for the
Gajowniczek, P   +5 more
core   +3 more sources

Optimasi Cost pada Open Shortest Path First di Jaringan Software Defined-Network

open access: yesTechno.Com, 2017
Seiring bertumbuhnya pengguna internet maka tingkat kompleksitas jaringan yang ada didalamnya juga meningkat, seperti routing. Pada kondisi lain, saat ini tengah berkembang teknologi SDN yang merupakan teknologi jaringan baru yang didalamnya dilakukan ...
Ronald Adrian
doaj   +4 more sources

Penerapan Open Shortest Path Fisrt (OSPF) untuk Membangun Jaringan Berskala Besar Berbasis Mikrotik [PDF]

open access: yesBriliant, 2018
Routing adalah proses pemilihan jalur untuk lalu lintas data pada satu atau beberapa jaringan. Universitas Merdeka Malang masih menggunakan static routing dalam teknologi jaringannya, sehingga proses transfer rute routing hanya dapat dilakukan oleh ...
Ronald David Marcus   +2 more
doaj   +2 more sources

Analysis of QOS VLAN Based on Djikstra’s Algorithm on Open Shortest Path First(OSPF)

open access: yesIJID (International Journal on Informatics for Development), 2019
As an institution engaged in SMK Muhammadiyah 03 Yogyakarta requires network infrastructure as a medium of communication. Infrastructure in SMK Muhammadiyah based VLAN but still using static routing and star topologies as a medium of communication ...
Muhammad Nur Alfani, Bambang Sugiantoro
doaj   +3 more sources

A Bio-Inspired Method for the Constrained Shortest Path Problem [PDF]

open access: yesThe Scientific World Journal, 2014
The constrained shortest path (CSP) problem has been widely used in transportation optimization, crew scheduling, network routing and so on. It is an open issue since it is a NP-hard problem.
Hongping Wang   +4 more
doaj   +2 more sources

Home - About - Disclaimer - Privacy