Abstract:

The resource search algorithm in P2P networks is mainly based on flooding algorithm.However,flooding algorithm is only suitable for small networks due to the huge traffic caused by it.Ant algorithm has many advantages such as robustness and parallelism to name a few,and many researchers have already used it for resource search in P2P networks.This paper analyzes the problems when using ant algorithms in P2P networks,and then proposes a new P2P network architecture which is more suitable for ant algorithm.An open network architecture for simulation is then presented.Visibility is always one of two basic elements of ant algorithm.However,this paper shows that using visibility in P2P networks will cause three disadvantages: to result in local minimum,to make flux convergent and to make the realization of the ant colony algorithm difficult.This paper presents a new ant algorithm without visibility.A series of experiments show that the global ability of the new algorithm is better than that of others.

Key words: ant algorithm, P2P, visibility, resource search