Probabilistic location and routing

By Sean C. Rhea, John D. Kubiatowicz. Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, 2002

313 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/9aa819110ba9ff6f669338ee27ff72929fb51178

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

Citations in the corpus

Pond: The OceanStore Prototype (2003, background): “While the latency overhead of Tapestry has been examined before [24], quantifying the additional storage costs it imposes is a topic for future research.”
Tapestry: a resilient global-scale overlay for service deployment (2004, unknown): “SOSS is an event-driven network layer that simulates network time with queues driven by a single local clock.”
Peer-to-peer information retrieval using self-organizing semantic overlay networks (2003, methodology): “Rhea and Kubiatowicz [20] describe a method that 9.”
Cooperative peer groups in NICE (2003, methodology): “It is, in fact, a base case of probabilistic search using attenuated Bloom filters [12]; in our experiments, we found that we did not need to use full attenuated Bloom”
Adaptive probabilistic search for peer-to-peer networks (2003, background): “In [ RK02 ], each node holds d bloom filters for each neighbor.”
The Bloomier filter: an efficient data structure for static support lookup tables (2004, methodology): “They have many uses in networks [2]: for collaborating in overlay and peer-to-peer networks [5, 8, 17], resource routing [15, 26], packet routing [12, 30], and measurement infrastructures [9, 29].”
Non-commercial Research and Educational Use including without Limitation Use in Instruction at Your Institution, Sending It to Specific Colleagues That You Know, and Providing a Copy to Your Institution's Administrator. All Other Uses, Reproduction and Distribution, including without Limitation Comm (2005, unknown): “In order to describe the orientational order of the solute, the Saupe order matrix S kl is employed, with S kl defined as averages over reorientational motion of the second-order Legendre polynomials: S kl ¼ 1 2 < 3 cos h Z;k cos h Z;l À d kl > ð2Þ where h Z,k is the angle between the molecule-fixed”
Network Applications of Bloom Filters: A Survey (2004, methodology): “Rhea and Kubiatowicz [Rhea and Kubiatowicz 02] utilize the ideas in the basic protocol in Section 6.1 to design a probabilistic routing algorithm for peer-to-peer location mechanisms, in conjunction with the OceanStore project [Kubiatowicz et al. 00].”