Evolutionary Local Search for Designing Peer-to-Peer Overlay Topologies Based on Minimum Routing Cost Spanning Trees.
Peter MerzSteffen WolfPublished in: PPSN (2006)
Keyphrases
- spanning tree
- minimum cost
- edge disjoint
- lowest cost
- minimum total cost
- genetic algorithm
- minimum spanning tree
- np hard
- approximation algorithms
- peer to peer overlay
- network topologies
- minimum spanning trees
- search algorithm
- evolutionary search
- weighted graph
- undirected graph
- root node
- optimal solution
- evolutionary computation
- search space
- global search
- routing decisions
- simulated annealing
- total length
- tabu search
- memetic algorithm
- routing problem
- total cost
- routing algorithm
- ad hoc networks