Results 31 to 40 of about 238,527 (295)
Configuration and Analysis Link-State Open Shortest Path First Routing Performance Multi-Area [PDF]
Open Shortest Path First (OSPF) is a routing protocol that uses a link-state algorithm to build and calculate the best path to all known destinations. The link-state algorithm is also known as the Dijkstra algorithm or Shortest Path First (SPF) algorithm.
Hayati, Nur+2 more
core +2 more sources
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
Integrating Software-Defined Networking (SDN) and Edge Computing (EC) technologies becomes a promising approach to harness enormous data traffic in the Internet.
Chih-Lin Hu, Chao-Yu Hsu, Wu-Min Sung
doaj +1 more source
Penerapan Open Shortest Path Fisrt (OSPF) untuk Membangun Jaringan Berskala Besar Berbasis Mikrotik
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 +1 more source
Routing in Networks Using Genetic Algorithm [PDF]
With the increase in traffic, internet service providers are trying their best to provide maximum utilization of resources available. The current traffic load has to be taken into account for computation of paths in routing protocols.
Kumar, S. (Suresh), Moza, M. (Meenakshi)
core +3 more sources
Topology Modeling and Analysis of a Power Grid Network Using a Graph Database
We introduce a new method for storing, modeling, and analyzing power grid data. First, we present an architecture for building the network model for a power grid using the open source graph database Neo4j.
Bowen Kan+5 more
doaj +1 more source
Detours in Directed Graphs [PDF]
We study two "above guarantee" versions of the classical Longest Path problem on undirected and directed graphs and obtain the following results. In the first variant of Longest Path that we study, called Longest Detour, the task is to decide whether a ...
Fomin, Fedor V.+5 more
core +3 more sources
Understanding and modeling the small-world phenomenon in dynamic networks [PDF]
The small-world phenomenon first introduced in the context of static graphs consists of graphs with high clustering coefficient and low shortest path length. This is an intrinsic property of many real complex static networks.
Diaz, Michel+2 more
core +2 more sources
Analisis Quality of Service Routing MPLS OSPF Terhadap Gangguan Link Failure
Penerapan metode routing dalam kegiatan yang menggunakan jaringan komputer dalam lingkup besar diperlukan oleh administrator jaringan, agar dapat melakukan pengoptimalan lauyanan jaringan.
Arief Budiman+2 more
doaj +1 more source