4 search results - page 1 / 1 » Independent Directed Acyclic Graphs for Resilient Multipath ... |
TON
2012
11 years 7 months ago
2012
—In order to achieve resilient multipath routing we introduce the concept of Independent Directed Acyclic Graphs (IDAGs) in this study. Link-independent (Node-independent) DAGs s...
INFOCOM
2009
IEEE
13 years 11 months ago
2009
IEEE
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...
ICNP
2000
IEEE
13 years 9 months ago
2000
IEEE
We present a protocol for maintaining multiple paths to each destination in a network of processes. For each destination, each process in the network maintains a set of neighbors ...
INFOCOM
1998
IEEE
13 years 8 months ago
1998
IEEE
A new distributed algorithm for the dynamic computation of multiple loop-free paths from source to destination in a computer network or internet are presented,validated, and analy...