A Non-dominated Sorting Bit Matrix Genetic Algorithm for P2P Relay Optimization

摘要

Cooperative caching and relaying content in ISPs can decrease the bandwidth costs and distribution time. The relay resources installed at ISP are limited and the upload rates of relay servers are various. After formulating the optimization problem, we design a Non-dominated Sorting Bit matrix Genetic Algorithm (NSBGA) to solve it. Constraint-satisfied population is initialized according to resource ratio dynamically; improved alone point crossover and symmetric mutation is designed; population is non-dominated sorted. The experiments show that NSBGA is better than NSGAII and it can support P2P relay optimization very well. The relations between performances and parameters as the numbers of ISPs, source channels and relay servers are analyzed. As a general optimization algorithm, NSBGA also can be used in other application fields.