Efficient Routing for Peer-to-Peer Overlays

@inproceedings{Gupta2004EfficientRF,
  title={Efficient Routing for Peer-to-Peer Overlays},
  author={Anjali Gupta and Barbara Liskov and Rodrigo Rodrigues},
  booktitle={NSDI},
  year={2004}
}
Most current peer-to-peer lookup schemes keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. This design assumes that routing information at each member node must be kept small, so that the bookkeeping required to respond to system membership changes is also small, given that aggressive membership dynamics are expected. As a consequence, lookups have high latency as each lookup requires contacting several nodes in sequence. In this paper, we… CONTINUE READING
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 242 citations. REVIEW CITATIONS

12 Figures & Tables

Topics

Statistics

0102030'05'07'09'11'13'15'17
Citations per Year

243 Citations

Semantic Scholar estimates that this publication has 243 citations based on the available data.

See our FAQ for additional information.