Flood search under the California split strategy

Authors:
Y. Baryshnikov;E. Coffman;P. Jelenković;P. Momčilović;D. Rubenstein
Affiliations:
Bell Labs, Lucent Technologies, Murray Hill, NJ;Columbia University, New York, NY;Columbia University, New York, NY;Columbia University, New York, NY;Columbia University, New York, NY
Venue:
ACM SIGMETRICS Performance Evaluation Review
Year:
2002

Citing 3
Cited 0

Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Search and replication in unstructured peer-to-peer networks

ICS '02 Proceedings of the 16th international conference on Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a version of the problem of searching peer-to-peer networks by means of floods, or expanding rings; when a network reduces to a path, then the term flood becomes the more familiar search term "scan," which is the focus of this paper.