Study on placement optimization of web proxies based on genetic algorithm

Focusing on the problem of the placement for Web proxies that can not be rapidly solved to get satisfactory results by traditional methods, a novel approach based on genetic algorithm (GA) to optimize the placement of Web proxies was proposed. The model of placement optimization for proxies was constructed on the basis of graphic theory and a tree-like structure was built from Web servers to clients. The GA approach uses binary coding to represent the places and the single parent crossover operator and single parent mutation operator are used to improve its speed and efficiency. The time complexity of this algorithm is known as O (HPN) which is better than traditional methods. Simulation results show that the global approximate optimal solution can be easily and quickly obtained by the proposed method and the precision requirement for practical Web applications is satisfied.