Sciweavers

8370 search results - page 165 / 1674
» Challenges in P2P Computing
Sort
View
P2P
2006
IEEE
130views Communications» more  P2P 2006»
15 years 10 months ago
The Effect of Replica Placement on Routing Robustness in Distributed Hash Tables
To achieve higher efficiency over their unstructured counterparts, structured peer-to-peer systems hold each node responsible for serving a specified set of keys and correctly r...
Cyrus Harvesf, Douglas M. Blough
P2P
2005
IEEE
112views Communications» more  P2P 2005»
15 years 9 months ago
Randomized Protocols for Duplicate Elimination in Peer-to-Peer Storage Systems
Distributed peer-to-peer systems rely on voluntary participation of peers to effectively manage a storage pool. In such systems, data is generally replicated for performance and a...
Ronaldo A. Ferreira, Murali Krishna Ramanathan, An...
AP2PC
2005
Springer
15 years 9 months ago
Highly Available DHTs: Keeping Data Consistency After Updates
Abstract. The research in the paper is motivated by building a decentralized/P2P XML storage on top of a DHT (Distributed Hash Table). The storage must provide high data availabili...
Predrag Knezevic, Andreas Wombacher, Thomas Risse
DOLAP
2004
ACM
15 years 9 months ago
Aggregate queries in peer-to-peer OLAP
A peer-to-peer (P2P) data management system consists essentially of a network of peer systems, each maintaining full autonomy over its own data resources. Data exchange between pe...
Mauricio Minuto Espil, Alejandro A. Vaisman
EUROPAR
2004
Springer
15 years 9 months ago
Improving the Scalability of Logarithmic-Degree DHT-Based Peer-to-Peer Networks
High scalability in Peer-to-Peer (P2P) systems has been achieved with the emergence of the networks based on Distributed Hash Table (DHT). Most of the DHTs can be regarded as expon...
Bruno Carton, Valentin Mesaros