Dynamic distributed algorithm for computing multiple next-hops on a tree.
Haijun GengXingang ShiXia YinZhiliang WangPublished in: ICNP (2013)
Keyphrases
- preprocessing
- tree structure
- computational cost
- detection algorithm
- times faster
- k means
- binary tree
- experimental evaluation
- segmentation algorithm
- learning algorithm
- optimal solution
- worst case
- convergence rate
- high accuracy
- matching algorithm
- clustering method
- linear programming
- simulated annealing
- significant improvement
- computational complexity
- classification trees
- expectation maximization
- pruning algorithm
- insertions and deletions
- path planning
- optimization algorithm
- dynamic environments
- cost function
- search space
- similarity measure