Convergence routing on disjoint spanning trees.
Bülent YenerYoram OfekMoti YungPublished in: Comput. Networks (1999)
Keyphrases
- spanning tree
- edge disjoint
- minimum spanning tree
- minimum cost
- minimum spanning trees
- routing problem
- pairwise
- convergence speed
- shortest path
- routing algorithm
- convergence rate
- undirected graph
- routing protocol
- depth first search
- weighted graph
- ad hoc networks
- response time
- minimum total cost
- data structure
- network topology
- edge weights
- iterative algorithms
- network topologies
- root node