An OpenFlow-Based Dynamic Path Adjustment Algorithm for Multicast Spanning Trees.
Jingguo GeHanji ShenYuepeng E.Yulei WuJunling YouPublished in: TrustCom/ISPA/IUCC (2013)
Keyphrases
- spanning tree
- np hard
- minimum spanning tree
- optimal path
- probabilistic model
- optimal solution
- minimum cost
- times faster
- search space
- dynamic programming
- simulated annealing
- segmentation algorithm
- wireless networks
- tree structure
- path planning
- k means
- graph structure
- lower bound
- computational complexity
- learning algorithm