Results 51 to 60 of about 841,820 (326)
Smart Flow Steering Agent for End-to-End Delay Improvement in Software-Defined Networks
To ensure fault tolerance and distributed management, distributed protocols are employed as one of the major architectural concepts underlying the Internet.
Omar F. Hussain+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 +1 more source
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
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
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
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
Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances [PDF]
We introduce stronger notions for approximate single-source shortest-path distances, show how to efficiently compute them from weaker standard notions, and demonstrate the algorithmic power of these new notions and transformations. One application is the first work-efficient parallel algorithm for computing exact single-source shortest paths graphs ...
arxiv
Efficient Path Selection and Data Transmission Using Queue in Open Shortest Path First
In network, information apportioning occurs between one communication points to another using TCP protocol. The collected data are shared among many users via Single Router or Access Point (AP). During routing, traffic is occurred in the network and that is known as Random Early Detection (RED).
J. Kavitha, S. Palaniammal
openaire +2 more sources
Potential of natural language processing for metadata extraction from environmental scientific publications [PDF]
Summarizing information from large bodies of scientific literature is an essential but work-intensive task. This is especially true in environmental studies where multiple factors (e.g., soil, climate, vegetation) can contribute to the effects observed ...
G. Blanchy+4 more
doaj +1 more source
A Bio-Inspired Method for the Constrained Shortest Path Problem
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