Mixed spanning trees: a technique for performance-driven routing.
Jeffrey S. SaloweDana S. RichardsDallas E. WregePublished in: Great Lakes Symposium on VLSI (1993)
Keyphrases
- spanning tree
- edge disjoint
- minimum spanning tree
- minimum cost
- minimum spanning trees
- weighted graph
- shortest path
- routing protocol
- ad hoc networks
- network topology
- depth first search
- routing problem
- undirected graph
- root node
- routing algorithm
- high dimensional
- inter domain
- routing decisions
- travel distance
- data driven