18 citations · 27 across the 7 of their papers we have counts for
Showing 2003Show all
3 papers · 1 filter
cs.NI2003★ 1 cited
2 P2P or Not 2 P2P?
Mema Roussopoulos, Mary Baker, David S. H. Rosenthal +3
In the hope of stimulating discussion, we present a heuristic decision tree that designers can use to judge the likely suitability of a P2P architecture for their applications. It…
cs.CR2003★ 2 cited
On The Cost Distribution of a Memory Bound Function
David S. H. Rosenthal
Memory Bound Functions have been proposed for fighting spam, resisting Sybil attacks and other purposes. A particular implementation of such functions has been proposed in which th…
cs.DC2003★ 3 cited
Preserving Peer Replicas By Rate-Limited Sampled Voting in LOCKSS
Petros Maniatis, Mema Roussopoulos, TJ Giuli +3
The LOCKSS project has developed and deployed in a world-wide test a peer-to-peer system for preserving access to journals and other archival information published on the Web. It c…