On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Characterizing reference locality in the WWW
DIS '96 Proceedings of the fourth international conference on on Parallel and distributed information systems
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Probabilistic scalable P2P resource location services
ACM SIGMETRICS Performance Evaluation Review
IEEE Internet Computing
Analyzing peer-to-peer traffic across large networks
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
NeuroGrid: Semantically Routing Queries in Peer-to-Peer Networks
Revised Papers from the NETWORKING 2002 Workshops on Web Engineering and Peer-to-Peer Computing
A Distributed Search Service for Peer-to-Peer File Sharing in Mobile Applications
P2P '02 Proceedings of the Second International Conference on Peer-to-Peer Computing
Transparent Query Caching in Peer-to-Peer Overlay Networks
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Routing Indices For Peer-to-Peer Systems
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Improving Search in Peer-to-Peer Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Tracing a Large-Scale Peer to Peer System: An Hour in the Life of Gnutella
CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
An analysis of internet content delivery systems
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Summary management in P2P systems
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Evaluation study of a distributed caching based on query similarity in a P2P network
Proceedings of the 2nd international conference on Scalable information systems
Proceedings of the 3rd international conference on Scalable information systems
Survey on anonymity in unstructured peer-to-peer systems
Journal of Computer Science and Technology
Schema-assisted peer selection for XML querying in unstructured P2P systems
Proceedings of the Seventh ACM International Workshop on Data Engineering for Wireless and Mobile Access
Locaware: index caching in unstructured P2P-file sharing systems
Proceedings of the 2009 EDBT/ICDT Workshops
Group-based search in unstructured peer-to-peer networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
KCube: A novel architecture for interconnection networks
Information Processing Letters
Cooperative caching versus proactive replication for location dependent request patterns
Journal of Network and Computer Applications
KMcube: the compound of Kautz digraph and Möbius cube
Frontiers of Computer Science: Selected Publications from Chinese Universities
DVcube: A novel compound architecture of disc-ring graph and hypercube-like graph
Theoretical Computer Science
| Hi-index | 0.00 |
Peer-to-peer networks are widely criticized for their inefficient flooding search mechanism. Distributed Hash Table (DHT) algorithms have been proposed to improve the search efficiency by mapping the index of a file to a unique peer based on predefined hash functions. However, the tight coupling between indices and hosting peers incurs high maintenance cost in a highly dynamic network. To properly balance the tradeoff between the costs of indexing and searching, we propose the distributed caching and adaptive search (DiCAS) algorithm, where indices are passively cached in a group of peers based on a predefined hash function. Guided by the same function, adaptive search selectively forwards queries to "matched” peers with a high probability of caching the desired indices. The search cost is reduced due to shrunk searching space. Different from the DHT solutions, distributed caching loosely maps the index of a file to a group of peers in a passive fashion, which saves the cost of updating indices. Our simulation study shows that the DiCAS protocol can significantly reduce the network search traffic with the help of small cache space contributed by each individual peer.