Name
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. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1145/605521.605528 | SIGMETRICS Performance Evaluation Review |
Field | DocType | Volume |
Computer science,Flood myth,Distributed computing | Journal | 30 |
Issue | Citations | PageRank |
3 | 0 | 0.34 |
References | Authors | |
2 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuliy Baryshnikov | 1 | 135 | 22.05 |
| Edward G. Coffman Jr. | 2 | 2028 | 1442.37 |
| Predrag R. Jelenkovic | 3 | 219 | 29.99 |
| Petar Momcilovic | 4 | 0 | 0.34 |
| Dan Rubenstein | 5 | 289 | 17.02 |