Shortest Path Separators in Unit Disk Graphs [PDF]
arXivWe introduce a new balanced separator theorem for unit-disk graphs involving two shortest paths combined with the 1-hop neighbours of those paths and two other vertices. This answers an open problem of Yan, Xiang and Dragan [CGTA '12] and improves their result that requires removing the 3-hop neighborhood of two shortest paths.
arxiv
PENGARUH MODEL JARINGAN TERHADAP OPTIMASI ROUTING OPEN SHORTEST PATH FIRST (OSPF)
, 2012 Lady Silk Moonlight, Suhardi Suhardi
openalex +2 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]
, 2023 Moh Hadi Subowo
openalex +1 more source
Performance Analysis of Enhanced Interior Gateway Routing Protocol (EIGRP) Over Open Shortest Path First (OSPF) Protocol with Opnet [PDF]
, 2016 Anibrika Bright +3 more
openalex +1 more source
Open shortest path first routing under random early detection [PDF]
, 2017 Jiaxin Liu, Stanko Dimitrov
openalex +1 more source
Less Congested Open Shortest Path First Algorithm for Computer Networks(Arbic) [PDF]
, 2013 ManarYounisKashmola +1 more
openalex +1 more source
IP/MPLS Ağlar Üzerinde Sanal-Yerel Servisler ve Yönlendirici Konfigürasyonları
Uludağ University Journal of The Faculty of Engineering, 2015 Zaman içinde ağlarda artan kullanıcı sayısı ve büyüyen trafik hacmi, daha yüksek bant genişliği ve hızlı iletim ihtiyacını da beraberinde getirmiştir.
Çağlar Toka +2 more
doaj