The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—As a hot research topic, many search algorithms have been presented and studied for unstructured peer-to-peer (P2P) systems during the past few years. Unfortunately, current approaches either cannot yield good lookup performance, or incur high search cost and system maintenance overhead. The poor search efficiency of these approaches may seriously limit the scalability of current unstructured P2P systems. In this paper, we propose to exploit two-dimensional locality to improve P2P system search efficiency. We present a locality-aware P2P system architecture called <it>Foreseer</it>, which explicitly exploits <it>geographical</it> locality and <it>temporal</it> locality by constructing a <it>neighbor</it> overlay and a <it>friend</it> overlay, respectively. Each peer in Foreseer maintains a small number of neighbors and friends along with their content filters used as distributed indices. By combining the advantages of distributed indices and the utilization of two-dimensional locality, our scheme significantly boosts P2P search efficiency while introducing only modest overhead. In addition, several alternative forwarding policies of Foreseer search algorithm are studied in depth on how to fully exploit the two-dimensional locality.</p>
Foreseer, unstructured peer-to-peer systems, geographical locality, temporal locality, search efficiency.

H. Cai and J. Wang, "Exploiting Geographical and Temporal Locality to Boost Search Efficiency in Peer-to-Peer Systems," in IEEE Transactions on Parallel & Distributed Systems, vol. 17, no. , pp. 1189-1203, 2006.
95 ms
(Ver 3.3 (11022016))