||The OceanStore Project
Probabilistic Location and Routing
Sean C. Rhea and John Kubiatowicz.
Appears in Proceedings of the
21st Annual Joint Conference of the IEEE Computer and Communications
Societies (INFOCOM 2002),
We propose probabilistic location to enhance the performance of
existing peer-to-peer location mechanisms in the case where a replica for
the queried data item exists close to the query source.
We introduce the attenuated Bloom filter, a lossy distributed
index. We describe how to use these data structures for document location
and how to maintain them despite document motion. We include a detailed
performance study which indicates that our algorithm performs as desired,
both finding closer replicas and finding them faster than deterministic
[ Paper: PDF
(394K), Compressed Postscript
Last modified on 02/08/2002 by Sean C. Rhea.