Results 21 to 30 of about 247,354 (289)
Tạp chí Khoa học, 2023 Hiện nay giao thức định tuyến Open Shortest Path First (OSPF) được sử dụng rất phổ biến trong hạ tầng mạng IPv6. OSPF sử dụng nhiều kiểu Timer để giảm lượng bản tin Overhead.
Lê Hoàng Hiệp, Hồ Mậu Việt, Dương Thị Quy +3 more
doaj +1 more source
QoS Routing Algorithm Based on Entropy Granularity in the Network Transmission
Cybernetics and Information Technologies, 2019 With the rapid development of computer networks, more hosts are connected to the Internet where they could communicate with each other. The need for network service has exceeded the service capacity of the network, and the Quality of Service (QoS) is ...
Li Xiaoling, Hu Hai
doaj +1 more source
Visibility Graphs, Dismantlability, and the Cops and Robbers Game [PDF]
, 2016 We study versions of cop and robber pursuit-evasion games on the visibility graphs of polygons, and inside polygons with straight and curved sides. Each player has full information about the other player's location, players take turns, and the robber is ...
Lubiw, Anna +2 more
core +3 more sources
A Bio-Inspired Method for the Constrained Shortest Path Problem
The Scientific World Journal, 2014 The constrained shortest path (CSP) problem has been widely used in transportation optimization, crew scheduling, network routing and so on. It is an open issue since it is a NP-hard problem.
Hongping Wang +4 more
doaj +1 more source
Proposal of Load Aware Routing for OSPF Routing Protocol
Communications, 2013 This paper deals with route cost assignment using one of the most commonly used routing protocols - Open Shortest Path First (OSPF). The limitation of this protocol is that the algorithm does not take actual link load into consideration.
Tomas Macha, Radko Krkos, Vit Novotny
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 +3 more
doaj +1 more source
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 +6 more
core +7 more sources
Design and Simulation of AI-Enabled Digital Twin Model for Smart Industry 4.0
Engineering Proceedings, 2023 One of the core ideas of Industry 4.0 has been the use of digital twin networks (DTNs). A DTN facilitates the co-evolution of real and virtual things through the use of DT modelling, interactions, computation, and information analysis systems.
Md. Humayun Kabir +5 more
doaj +1 more source
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 +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