Results 51 to 60 of about 243,105 (216)

Pi/2-Angle Yao Graphs are Spanners [PDF]

, 2010
We show that the Yao graph Y4 in the L2 metric is a spanner with stretch factor 8(29+23sqrt(2)). Enroute to this, we also show that the Yao graph Y4 in the Linf metric is a planar spanner with stretch factor 8.Comment: 20 pages, 9 ...
Bose, Prosenjit, Damian, Mirela, Douieb, Karim, O'Rourke, Joseph, Seamone, Ben, Smid, Michiel, Wuhrer, Stefanie   +6 more
core   +7 more sources

A Fast Failure Recovery Scheme for Fibbing Networks

IEEE Open Journal of the Communications Society, 2020
Fibbing is a network technology that can provide flexible routing in IP networks. In a Fibbing network, the network controller cleverly broadcasts link state advertisements (LSAs) of the open shortest path first (OSPF) protocol to generate fake nodes ...
Steven S. W. Lee, Kwan-Yee Chan, Ting-Shan Wong, Bo-Xian Xiao   +3 more
doaj   +1 more source

Network Centrality Assessment (NCA): Assessing the Transport Network Resilience to Urban Flooding

Journal of South Asian Logistics and Transport, 2021
This study presents a methodology to assess transport network resilience to urban flooding. The proposed methodology is developed based on the centrality measures and graph theory.
L.D.C.H.N. Kalpana, A.B. Jayasinghe, C.C. Abenayake, P.N.P. Wijayawardana   +3 more
doaj   +1 more source

Approximating ATSP by Relaxing Connectivity

, 2015
The standard LP relaxation of the asymmetric traveling salesman problem has been conjectured to have a constant integrality gap in the metric case. We prove this conjecture when restricted to shortest path metrics of node-weighted digraphs. Our arguments
Svensson, Ola
core   +1 more source

Fast-Convergence Reinforcement Learning for Routing in LEO Satellite Networks

Sensors, 2023
Fast convergence routing is a critical issue for Low Earth Orbit (LEO) constellation networks because these networks have dynamic topology changes, and transmission requirements can vary over time.
Zhaolong Ding, Huijie Liu, Feng Tian, Zijian Yang, Nan Wang   +4 more
doaj   +1 more source

Travelling on Graphs with Small Highway Dimension [PDF]

, 2019
We study the Travelling Salesperson (TSP) and the Steiner Tree problem (STP) in graphs of low highway dimension. This graph parameter was introduced by Abraham et al.
A Sebő, AA Loboda, AE Feldmann, CH Papadimitriou, CY Chen, DS Hochbaum, G Laporte, G Robins, HL Bodlaender, Holger Bast, I Abraham, I Abraham, I Ljubić, J Lenstra, JSB Mitchell, L Trevisan, M Bateni, M Bern, M Chlebík, M Grötschel, M Karpinski, M Lampis, MR Garey, P Klein, R Bland, R Borndörfer, RM Karp, S Arora, S Held, SA Chowdhury, VV Vazirani   +30 more
core   +2 more sources

Deep Reinforcement Learning-Based Network Routing Technology for Data Recovery in Exa-Scale Cloud Distributed Clustering Systems

Applied Sciences, 2021
Research has been conducted to efficiently transfer blocks and reduce network costs when decoding and recovering data from an erasure coding-based distributed file system. Technologies using software-defined network (SDN) controllers can collect and more
Dong-Jin Shin, Jeong-Joon Kim
doaj   +1 more source

Convexity in partial cubes: the hull number [PDF]

, 2014
We prove that the combinatorial optimization problem of determining the hull number of a partial cube is NP-complete. This makes partial cubes the minimal graph class for which NP-completeness of this problem is known and improves some earlier results in
A. Björner, B. Monjardet, C. Hernando, C.C. Centeno, D. Djoković Ž, D. Eppstein, D. Eppstein, E. Helly, G. Chartrand, G.M. Ziegler, H.-J. Bandelt, J. Araujo, J. Cáceres, K. Fukuda, K. Handa, M. Grötschel, M. Yannakakis, M.C. Dourado, M.C. Dourado, M.G. Everett, M.M. Kanté, P.M. Winkler, R. Cordovil, R.J. Fowler, R.L. Graham, R.P. Dilworth, S. Felsner, S. Klavžar, S.R. Canoy Jr.   +28 more
core   +6 more sources

Perancangan dan Analisis Redistribution Routing Protocol OSPF dan EIGRP

Jurnal Elkomika, 2014
ABSTRAK OSPF (Open Shortest Path First) dan EIGRP (Enhanced Interior Gateway Routing Protocol) adalah dua routing protokol yang banyak digunakan dalam jaringan komputer.
DWI ARYANTA, BAYU AGUNG PRANATA
doaj   +1 more source

RIP VS. OSPF ROUTING PROTOCOLS: WHICH ONE IS THE BEST FOR A REAL-TIME COMPUTER NETWORK?

Simetris: Jurnal Teknik Mesin, Elektro dan Ilmu Komputer, 2020
The development of modern computer networks for internet access makes routing protocols needed, and it has an essential role in a real-time system. Therefore, the best and most effective routes can be reached.
Nuur Wachid Abdul Majid, Syifaul Fuada
doaj   +1 more source