Exploiting Geographical and Temporal Locality to Boost Search Efficiency in Peer-to-Peer Systems

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 se...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on parallel and distributed systems 2006-10, Vol.17 (10), p.1189-1203
Main Authors: Cai, Hailong, Wang, Jun
Format: Article
Language:English
Subjects:
Algorithms
Blindness
Construction
Costs
Delay
Dictionaries
Efficiency
Filters
Foreseer
geographical locality
IP networks
Large-scale systems
Maintenance
Peer to peer computing
Policies
Scalability
Search algorithms
search efficiency
Search engines
Searching
Studies
Telecommunication traffic
temporal locality
Temporal logic
Two dimensional
unstructured peer-to-peer systems
Utilization
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 Foreseer, which explicitly exploits geographical locality and temporal locality by constructing a neighbor overlay and a friend 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
ISSN:1045-9219
1558-2183
DOI:10.1109/TPDS.2006.139