An efficient algorithm for virtual-wavelength-path routing minimizing average number of hops.
Harsha V. MadhyasthaN. BalakrishnanPublished in: IEEE J. Sel. Areas Commun. (2003)
Keyphrases
- computational complexity
- k means
- learning algorithm
- memory requirements
- np hard
- computationally efficient
- preprocessing
- search space
- times faster
- worst case
- expectation maximization
- space complexity
- convergence rate
- matching algorithm
- segmentation algorithm
- simulated annealing
- computational cost
- dynamic programming
- optimal solution
- objective function
- genetic algorithm
- optimization algorithm
- path planning
- evolutionary algorithm
- routing algorithm
- network topology
- undirected graph
- shortest path problem
- routing table