Analysis of QOS VLAN Based on Djikstra’s Algorithm on Open Shortest Path First(OSPF)
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
Optimasi Cost pada Open Shortest Path First di Jaringan Software Defined-Network
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 +3 more sources
Open Shortest Path First extension for the support of multiarea networks with arbitrary topologies [PDF]
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 +2 more sources
Along with technological developments, implementing network computers can use network simulators. The use of network simulators that are often used, one of which is the Graphical User Interface (GUI) and the operating system provided by the user because ...
Made Dinda Pradnya Pramita, Lie Jasa
doaj +3 more sources
Analisis Kinerja Jaringan Software-Defined Networking (SDN) Berbasis Open Network Operating System (ONOS) dengan Menggunakan Protokol OpenFlow 1.5: Studi Kasus pada Algoritma Flow Scheduling Shortest Path First (SPF) dan Weighted Round Robin (WRR) [PDF]
Jaringan Software-Defined Networking (SDN) telah menjadi solusi penting dalam mengelola dan mengoptimalkan kinerja jaringan. Penelitian ini bertujuan untuk menganalisis kinerja jaringan SDN berbasis Open Network Operating System (ONOS) dengan menggunakan
Moh Hadi Subowo
doaj +2 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
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
Concealed Conduit Routing in Building Slabs
Concealed pipes are vital facilities for transporting water, air, electricity, and natural gas in modern buildings. These pipes are constructed inside slabs of buildings, and thus conventional piping algorithms, dedicated to arranging exposed pipes in ...
Shyh-Kuang Ueng, Chun-Chieh Chang
doaj +1 more source
Multi-Path Routing in Green Multi-Stage Upgrade for Bundled-Links SDN/OSPF-ECMP Networks
This paper considers the novel problem of upgrading a legacy network into a Software Defined Network (SDN) over multiple stages and saving energy in the upgraded network, or hybrid SDN. That is, in each stage, the problem at hand is to select and replace
Lely Hiryanto +4 more
doaj +1 more source

