Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
SIAM Journal on Computing
Approximation algorithms for some optimum communication spanning tree problems
Discrete Applied Mathematics
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
IEEE Internet Computing
Advanced fitness landscape analysis and the performance of memetic algorithms
Evolutionary Computation - Special issue on magnetic algorithms
Evolutionary algorithms for the self-organized evolution of networks
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
The Organic Grid: Self-Organizing Computation on a Peer-to-Peer Network
ICAC '04 Proceedings of the First International Conference on Autonomic Computing
Efficient broadcast in P2P grids
CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid - Volume 01
Fitness landscape analysis and memetic algorithms for the quadratic assignment problem
IEEE Transactions on Evolutionary Computation
Iterated Local Search for Minimum Power Symmetric Connectivity in Wireless Networks
EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
Evolutionary p2p network adaptively changing its topologies for reliable searching
BADS '09 Proceedings of the 2009 workshop on Bio-inspired algorithms for distributed systems
Evolutionary algorithm for P2P multicasting network design problem
HAIS'11 Proceedings of the 6th international conference on Hybrid artificial intelligent systems - Volume Part I
Efficient cycle search for the minimum routing cost spanning tree problem
EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
| Hi-index | 0.00 |
Finding overlay topologies for peer-to-peer networks on top of the Internet can be regarded as a network design problem, in which a graph with minimum communication costs is desired. An example of such a graph is a spanning tree connecting all nodes in the overlay. We present evolutionary algorithms incorporating local search for the minimum routing cost spanning tree problem in which the overall routing/communication cost is minimized. We present three types of local search for this problem as well as an evolutionary framework for finding (near)optimal solutions to the problem. Moreover, we present results from a fitness landscape analysis for the three types of local optima that reveal interesting properties of the problem data based on real measurements in the Internet. We demonstrate that our proposed algorithms find near optimum solutions reliably by comparing against a lower bound of the problem.