A Simple Path Diversity Algorithm for Interdomain Routing.
Wu-Hsiao HsuYuh-Pyng ShiehSheng-Cheng YehPei-Siou HungPublished in: AINA Workshops (2011)
Keyphrases
- experimental evaluation
- dynamic programming
- optimal solution
- learning algorithm
- objective function
- optimization algorithm
- expectation maximization
- improved algorithm
- theoretical analysis
- computational cost
- np hard
- worst case
- search space
- times faster
- significant improvement
- high accuracy
- wireless sensor networks
- computationally efficient
- configuration space
- computational complexity
- matching algorithm
- routing decisions
- ant algorithm
- multicast routing
- shortest path problem
- path planning
- clustering method
- shortest path
- detection algorithm
- k means
- neural network
- simulated annealing