Genetic simulated annealing algorithm for data allocation in layered P2P streaming

Data allocation in layered P2P streaming has been proved to be a NP-Complete problem. The existing algorithms are heuristic and based on the greedy idea, which can not get the global solution. In order to develop a new algorithm for this problem, we define the concept of `Data Blocks for Choosing´, set up a mathematic model of integer programming without restriction, and propose a novel genetic simulated annealing algorithm (GSA) based on the encoding manner of `Data Blocks for Choosing´. The simulation has demonstrated that the proposed GSA could get convergence quickly, and its performance has been improved 5~25% than that of the existing algorithms.