Results 81 to 90 of about 243,105 (216)

An Energy-Efficient Routing Protocol with Reinforcement Learning in Software-Defined Wireless Sensor Networks

open access: yesSensors, 2023
The enormous increase in heterogeneous wireless devices operating in real-time applications for Internet of Things (IoT) applications presents new challenges, including heterogeneity, reliability, and scalability.
Daniel Godfrey   +4 more
doaj   +1 more source

Enumerating Polytropes [PDF]

open access: yes, 2016
Polytropes are both ordinary and tropical polytopes. We show that tropical types of polytropes in $\mathbb{TP}^{n-1}$ are in bijection with cones of a certain Gr\"{o}bner fan $\mathcal{GF}_n$ in $\mathbb{R}^{n^2 - n}$ restricted to a small cone called ...
Tran, Ngoc Mai
core  

DYNAMIC SHORTEST PATH ANALYSIS OF ROUTING TECHNIQUE VIA GENETIC ALGORITHM

open access: yesJournal of Engineering and Sustainable Development, 2018
The performance and reliability of the internet depend in large part on properties of routing techniques. IP routing protocols nowadays compute paths based on the network configuration parameters and topology, missing view to the current traffic load on
Nyan Dawood Salman   +1 more
doaj  

Mitigation of Risks Associated with Distrustful Routers in OSPF Networks—An Enhanced Method

open access: yesComputers
Packet routing in computer networks provides complex challenges in environments with distrustful routers due to security vulnerabilities or potential malicious behaviors.
Kvitoslava Obelovska   +4 more
doaj   +1 more source

Shortest Distances as Enumeration Problem

open access: yes, 2021
We investigate the single source shortest distance (SSSD) and all pairs shortest distance (APSD) problems as enumeration problems (on unweighted and integer weighted graphs), meaning that the elements $(u, v, d(u, v))$ -- where $u$ and $v$ are vertices ...
Casel, Katrin   +3 more
core  

Fog Computing: Enabling the Management and Orchestration of Smart City Applications in 5G Networks

open access: yesEntropy, 2017
Fog computing extends the cloud computing paradigm by placing resources close to the edges of the network to deal with the upcoming growth of connected devices. Smart city applications, such as health monitoring and predictive maintenance, will introduce
JosĂ© Santos   +3 more
doaj   +1 more source

Engineering wired network performance enhancement in a route redistributed simulation based systems [PDF]

open access: yesBig Data and Computing Visions
As organizations keep expanding every day, there is a rapidly increasing need for communication networks to share routing information amongst the different routing protocols reliably.
Aniekan Ikpe, Imoh Ekanem
doaj   +1 more source

Convergence time analysis of open shortest path first routing protocol in internet scale networks

open access: yesElectronics Letters, 2012
Proposed is a novel method to compute the intra-area convergence time of open shortest path first (OSPF) based networks in the presence of designated routers (DRs) on Ethernet and non-broadcast multi-access segments. The capacity of the proposed method is demonstrated by evaluating the convergence time performance of OSFP on internet scale networks ...
Saif Ur Rehman Malik   +2 more
openaire   +2 more sources

INTERIOR GATEWAY PROTOCOL ROUTING PERFORMANCE COMPARISON OF THE VIRTUAL PRIVATE NETWORK BASED ON MULTI PROTOCOL LABEL SWITCHING AND DIRECT-LINK BACKUPSED ON MPLS AND DIRECT-LINK BACKUP

open access: yesJurnal Ilmiah SINERGI, 2019
The stability and convergence time become an essential factor in network availability performance. Multiprotocol Label Switching (MPLS) is one of the Virtual Private Network (VPN) technologies that can support the quality of communication media on the ...
Ida Nurhaida   +3 more
doaj   +1 more source

Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization

open access: yes, 2015
We study dynamic $(1+\epsilon)$-approximation algorithms for the all-pairs shortest paths problem in unweighted undirected $n$-node $m$-edge graphs under edge deletions. The fastest algorithm for this problem is a randomized algorithm with a total update
A Bernstein   +6 more
core   +1 more source

Home - About - Disclaimer - Privacy