Abstract: P2P network is characterized by several important aspects: scalability, decentralization and dynamicity. One of the major problems posed by decentralization and dynamicity of P2P network is how to discover and access to a resource, since it is very difficult to get an overall view of all resources in the P2P community. The most important concern is how to locate a particular resource and identifying the optimized path, that reaches the peer responsible for this requested resource, with a minimum number of hops and an optimized delay. In this paper, we propose a new scalable and hierarchical P2P architecture for lookup acceleration and optimization based on Pancake graph. This architecture can supports many type of applications such as: file sharing, collaborative work and asynchronous distributed group communication, etc. The performance evaluation shows that results are globally satisfactory.
Keywords: P2P network, Pancake graph, lookup optimization, group communication
