Multipath routing can provide multiple paths for transmission and failover, and is considered to be effective in the improvement of the network reliability.
We propose a dynamic distributed multipath algorithm (DM-. PA) to help a router in a link-state network find multiple next- hops for each destination. A router ...
A dynamic distributed multipath algorithm to help a router in a link-state network find multiple nexthops for each destination and guarantees loop-freeness ...
A router runs the algorithm locally and independently, where only one single shortest path tree (SPT) needs to be constructed, and no message other than the ...
DMPA maintains the SPT and dynamically adjusts it in response to network state changes, so the sets of nexthops can be incrementally and efficiently updated. At ...
We propose an algorithm, DMPA (dynamic multipath algorithm), for a router in a link-state network to compute multiple next-hops for each destination. The ...
A Hop-by-Hop Dynamic Distributed Multipath Routing Mechanism ...
www.researchgate.net › ... › Routing
The algorithm constructs one single shortest path tree based on ordinary network link states, and dynamically adjusts it in response to network state changes, ...
compute multiple next-hops for each destination. The algorithm constructs one single shortest path tree based on ordinary network link states, and dynamically ...
Nov 29, 2021 · This paper proposes a multicast tree construction algorithm, which considers receiving devices and network capability as base parameters to construct the ...
The algorithm constructs one single shortest path tree based on ordinary network link states, and dynamically adjusts it in response to network state changes, ...