Abstract
Peer-to-peer (P2P) overlay networks continue to evolve and grow to meet the challenges of a new age. Because peers can join or depart overlay networks at any time, researchers are particularly interested in how peers should be allowed to join overlay networks as well as how to minimize overhead in overlay networks. An Arrangement Graph-based Overlay (AGO) system can efficiently reduce system overhead by reducing the number of messages in a large-scale environment. However, AGO produces too many polling messages for the joining process. To address this issue, an enhanced joining strategy greatly improves the joining process of AGO to reduce the number of joining messages in this paper which is called the Enhanced Arrangement Graph-based Overlay (EAGO). Besides, for the purpose of the effectiveness of resource prefetching, a replica mechanism is employed to further improve routing performance. Experimental results indicate that EAGO reduces the number of joining messages by at least 20% compared with AGO, and it reduces the average number of routing hops due to the replica mechanism. © 2013 Elsevier Ltd.