LFID enables more and shorter loop-free paths in hop-by-hop multipath routing compared to DAG-based methods, enhancing failure protection close to source routing.
https://github.com/yan-qi/k-shortest-paths-cpp-version
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.NI 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Hop-by-Hop Multipath Routing: Choosing the Right Nexthop Set
LFID enables more and shorter loop-free paths in hop-by-hop multipath routing compared to DAG-based methods, enhancing failure protection close to source routing.