An efficient algorithm for dynamic shortest path tree update in network routing

2007 ◽  
Vol 9 (4) ◽  
pp. 499-510 ◽  
Author(s):  
Bin Xiao ◽  
Jiannong Cao ◽  
Zili Shao ◽  
Edwin H.-M. Sha
Keyword(s):  
Shortest Path ◽  
Efficient Algorithm ◽  
Network Routing ◽  
Shortest Path Tree

scholarly journals A bi-level encoding scheme for the clustered shortest-path tree problem in multifactorial optimization

2021 ◽  
Vol 100 ◽  
pp. 104187 ◽  
Author(s):  
Huynh Thi Thanh Binh ◽  
Ta Bao Thang ◽  
Nguyen Duc Thai ◽  
Pham Dinh Thanh
Keyword(s):  
Shortest Path ◽  
Shortest Path Tree ◽  
Encoding Scheme

Shortest Path Tree Computation in Dynamic Graphs

2009 ◽  
Vol 58 (4) ◽  
pp. 541-557 ◽  
Author(s):  
E.P.F. Chan ◽  
Yaya Yang
Keyword(s):  
Shortest Path ◽  
Dynamic Graphs ◽  
Shortest Path Tree

Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches

2014 ◽  
pp. 283-294 ◽  
Author(s):  
Annalisa D’Andrea ◽  
Mattia D’Emidio ◽  
Daniele Frigioni ◽  
Stefano Leucci ◽  
Guido Proietti
Keyword(s):  
Shortest Path ◽  
Experimental Evaluation ◽  
Shortest Path Tree ◽  
Tree Algorithms

scholarly journals Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem

2019 ◽  
Vol 38 (1) ◽  
pp. 165-184 ◽  
Author(s):  
Mattia D’Emidio ◽  
Luca Forlizzi ◽  
Daniele Frigioni ◽  
Stefano Leucci ◽  
Guido Proietti
Keyword(s):  
Shortest Path ◽  
Fixed Parameter Tractability ◽  
Shortest Path Tree ◽  
Fixed Parameter

scholarly journals Disconnected components detection and rooted shortest-path tree maintenance in networks

2019 ◽  
Vol 132 ◽  
pp. 299-309
Author(s):  
Christian Glacet ◽  
Nicolas Hanusse ◽  
David Ilcinkas ◽  
Colette Johnen
Keyword(s):  
Shortest Path ◽  
Shortest Path Tree

Prioritized Sweeping Reinforcement Learning Based Routing for MANETs

2017 ◽  
Vol 5 (2) ◽  
pp. 383 ◽  
Author(s):  
Rahul M Desai ◽  
B P Patil
Keyword(s):  
Reinforcement Learning ◽  
Shortest Path ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Network Routing ◽  
Delivery Ratio ◽  
Learning Method ◽  
Shortest Path Routing ◽  
Mobile Ad Hoc ◽  
Prioritized Sweeping

<p class="Default">In this paper, prioritized sweeping confidence based dual reinforcement learning based adaptive network routing is investigated. Shortest Path routing is always not suitable for any wireless mobile network as in high traffic conditions, shortest path will always select the shortest path which is in terms of number of hops, between source and destination thus generating more congestion. In prioritized sweeping reinforcement learning method, optimization is carried out over confidence based dual reinforcement routing on mobile ad hoc network and path is selected based on the actual traffic present on the network at real time. Thus they guarantee the least delivery time to reach the packets to the destination. Analysis is done on 50 Nodes Mobile ad hoc networks with random mobility. Various performance parameters such as Interval and number of nodes are used for judging the network. Packet delivery ratio, dropping ratio and delay shows optimum results using the prioritized sweeping reinforcement learning method.</p>

An auction-based approach for the re-optimization shortest path tree problem

2019 ◽  
Vol 74 (3) ◽  
pp. 851-893
Author(s):  
P. Festa ◽  
F. Guerriero ◽  
A. Napoletano
Keyword(s):  
Shortest Path ◽  
Shortest Path Tree

Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates

2015 ◽  
Vol 20 ◽  
pp. 1-33 ◽  
Author(s):  
Annalisa D'Andrea ◽  
Mattia D'Emidio ◽  
Daniele Frigioni ◽  
Stefano Leucci ◽  
Guido Proietti
Keyword(s):  
Shortest Path ◽  
Shortest Path Tree ◽  
Dynamic Maintenance
Sign in / Sign up

Export Citation Format

Share Document