Results 1 to 10 of about 612,515 (292)

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

open access: diamondIJID (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   +4 more sources

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

open access: goldIET 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   +3 more sources

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

open access: goldTechno.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

Open shortest path first (OSPF) routing protocol simulation [PDF]

open access: bronzeACM SIGCOMM Computer Communication Review, 1993
Open Shortest Path First (OSPF) is a dynamic, hierarchical routing protocol designed to support routing in TCP/IP networks. A simulation of the OSPF Election Protocol shows three results: (1) The Designated Router (DR) can be elected in constant time. (2) If a router has a limited number of input buffers, a competition for buffers between the Election ...
Raj Nair   +4 more
  +7 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

Desain Virtual Private Network (VPN) Berbasis Open Shortest Path First (OSPF) [PDF]

open access: goldInfoTekJar (Jurnal Nasional Informatika dan Teknologi Jaringan), 2019
Akses terhadap sebuah jaringan lokal yang bersifat terbatas untuk pihak tertentu dapat dilakukan dari jaringan publik dengan memanfaatkan Virtual Private Network (VPN). Akses tersebut dilakukan melalui internet dengan memanfaatkan VPN. Hal itu membuat pengguna bisa memanfaatkan semua resources jaringan lokal yang dapat diakses tanpa batasan waktu dan ...
Hari Antoni Musril
openaire   +2 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

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

open access: greenApplied 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.
Mohiuddin, Mohammad A.   +2 more
openaire   +4 more sources

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

open access: greenNetworks, 2017
In this article, we consider a variant of Open Shortest Path First (OSPF) routing that accounts for Random Early Detection (RED), an Active Queue Management method for backbone networks. In the version of OSPF we consider in this article we only require a single network path be available between each origin and destination, a simplification of the OSPF
Jiaxin Liu, Stanko Dimitrov
openaire   +4 more sources

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

open access: goldBriliant: 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. Universitas Merdeka Malang masih menggunakan static routing dalam jaringan yang berskala bersekala besar.
Rahmad Anjar Saputro   +2 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy