Community-Based Caching for Enhanced Lookup Performance in P2P Systems
نویسندگان
چکیده
منابع مشابه
A Catalog-Based Caching Strategy for Structured P2P Systems
Cache attempts to improve performance in P2P systems in three ways: improve response time, availability and load balancing. Despite their benefits, some proposals are very coupled with the application level and cannot be easily implemented in other environments, other use pre-defined structures difficult to maintain, or assume peers are physically homogeneous. So, the search for portable and fl...
متن کاملCoCache: Query Processing Based on Collaborative Caching in P2P Systems
Peer-to-peer (P2P) computing is gaining more and more significance due to its widespread use currently and potential deployments in future applications. In this paper, we propose CoCache, a P2P query processing architecture that enables sophisticated optimization techniques. In the scenario of CoCache, a large number of peers, each of which may be attached with a local relational database and a...
متن کاملProactive Caching for Better than Single-Hop Lookup Performance
High lookup latencies prohibit peer-to-peer overlays from being used in many performance intensive applications, even though they provide self-organization, scalability, and failure resilience. In this paper, we show that lookup performance of structured DHTs can be improved to any desired constant, even under a single hop, by controlled proactive replication. By exploiting the popularity distr...
متن کاملSemanticPeer: An Ontology-Based P2P Lookup Service
Locating content efficiently and conveniently is the key issue in P2P systems. In this paper we present SemanticPeer, an Ontology-Based P2P lookup service, to address this problem, which is an extension of Chord protocol. In SemanticPeer, one can easily locate desired data items using the domain knowledge, beyond the keywords scheme. By the separate of share knowledge and private knowledge, Sem...
متن کاملPerformance of Lookup Operations in a Hypercube-based P2P Data Store: Theoretical Model and Performance Evaluation
One way for Peer-to-Peer data stores to achieve high data availability is to replicate their data. This is necessary to counter the effects of peer population dynamics also known as churn. A consequence of churn is that locating a data item may require a peer to resend search messages thus introducing additional communication. A formal model of this communication pertaining to data item lookups...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 2013
ISSN: 1045-9219
DOI: 10.1109/tpds.2012.270