Results 31 to 40 of about 841,820 (326)

Detours in Directed Graphs [PDF]

open access: yesarXiv, 2022
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 graph has an (s,t)-path of length at least dist_G(s,t)+k (where dist_G(s,t) denotes the length of a ...
Fomin, Fedor V.   +5 more
arxiv   +6 more sources

ANALISIS PERBANDINGAN PERFORMANCE VIDEO STREAMING DENGAN METODE ROUTING PROTOCOL OPEN SHORTEST PATH FIRST (OSPF), ROUTING INFORMATION PROTOCOL (RIP), INTERMEDIATE SYSTEM-INTERMEDIATE SYSTEM (IS-IS)

open access: bronzeJurnal kajian teknik elektro, 2022
Teknologi informasi dan telekomunikasi berkembang cepat, dengan demikian kebutuhan untuk mewujudkan jaringan informasi yang menyediakan layanan yang berfariasi, kecepatan transimsi tinggi dan mudah diakses oleh semua orang pada waktu kapan saja dan ...
Kukuh Aris Santoso
semanticscholar   +3 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   +4 more sources

Implementasi Routing Protocol OSPF (Open Shortest Path First) dalam Jaringan SOHO

open access: yesJELIKU (Jurnal Elektronik Ilmu Komputer Udayana), 2023
With a computer network, a computer can be connected to each other either by using the internet or without the internet. To be able to connect with each other there is a data exchange process. The process of sending data is known as routing. OSPF routing
I Gede Santi Astawa   +1 more
openaire   +2 more sources

Comparative Analysis of Routing Internet Protocol and Open Shortest Path First Protocols Using QUALNET [PDF]

open access: green, 2015
Reliability is a major consideration in Network Design and Implementation in order to cater for link failures. Link failure is a frequent occurrence in Networks and Communications Systems, and the speed at which this disruption is noticed and (or ...
Alatishe, A. S.   +2 more
core   +2 more sources

Performance Analysis of Enhanced Interior Gateway Routing Protocol (EIGRP) Over Open Shortest Path First (OSPF) Protocol with Opnet [PDF]

open access: hybrid, 2016
Due to the increase in the easy accessibility of computers and mobile phones alike, routing has become indispensable in deciding how computes communicate especially modern computer communication networks.
Anibrika Bright Selorm Kodzo   +3 more
semanticscholar   +2 more sources

Open Shortest Path First- A Case Study [PDF]

open access: bronzeIJARCCE, 2017
Ranjan Ravishankar   +5 more
openaire   +2 more sources

Simulated evolution and simulated annealing algorithms for solving multi-objective open shortest path first weight setting problem [PDF]

open access: yesApplied Intelligence, 2014
Optimal utilization of resources in present-day communication networks is a challenging task. Routing plays an important role in achieving optimal resource utilization. The open shortest path first (OSPF) routing protocol is widely used for routing packets from a source node to a destination node.
Mohiuddin, Mohammad A.   +2 more
openaire   +4 more sources

Performance Analysis of Frame Relay Network Using OSPF (Open Shortest Path First) and MPLS (Multi-Protocol Label Switching) based on GNS3

open access: diamond, 2017
Received June 7, 2017 Revised July 24, 2017 Accepted August 8, 2017 Available online August 14 ...
Andi Harits   +2 more
semanticscholar   +3 more sources

Less Congested Open Shortest Path First Algorithm for Computer Networks(Arbic) [PDF]

open access: goldAL-Rafdain Engineering Journal (AREJ), 2013
ManarYounisKashmola   +1 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy