An efficient algorithm to enable path diversity in link state routing networks.
Pascal MérindolPierre FrançoisOlivier BonaventureStéphane CateloinJean-Jacques PansiotPublished in: Comput. Networks (2011)
Keyphrases
- detection algorithm
- cost function
- computational complexity
- computational cost
- ant algorithm
- k means
- dynamic programming
- preprocessing
- optimization algorithm
- objective function
- optimal solution
- probabilistic model
- shortest path
- shortest path problem
- learning algorithm
- np hard
- genetic algorithm
- expectation maximization
- computationally efficient
- wireless ad hoc networks