RECORD
CUP: Controlled Update Propagation in Peer-to-Peer Networks
Networking and Internet Architecture · Submitted 8 Feb 2002
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim Finally, the small propagation overhead incurred by CUP is more than compensated for by its savings in cache misses.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
Recently the problem of indexing and locating content in peer-to-peer networks has received much attention. Previous work suggests caching index entries at intermediate nodes that lie on the paths taken by search queries, but until now there has been little focus on how to maintain these intermediate caches. This paper proposes CUP, a new comprehensive architecture for Controlled Update Propagation in peer-to-peer networks. CUP asynchronously builds caches of index entries while answering search queries. It then propagates updates of index entries to maintain these caches. Under unfavorable conditions, when compared with standard caching based on expiration times, CUP reduces the average miss latency by as much as a factor of three. Under favorable conditions, CUP can reduce the average miss latency by more than a factor of ten. CUP refreshes intermediate caches, reduces query latency, and reduces network load by coalescing bursts of queries for the same item. CUP controls and confines propagation to updates whose cost is likely to be recovered by subsequent queries. CUP gives peer-to-peer nodes the flexibility to use their own incentive-based policies to determine when to receive and when to propagate updates. Finally, the small propagation overhead incurred by CUP is more than compensated for by its savings in cache misses.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | Recently the problem of indexing and locating content in peer-to-peer networks has received much attention. | background 1.00 | 0.04 | 0.01 | asserted 0.98 |
| s1 | Previous work suggests caching index entries at intermediate nodes that lie on the paths taken by search queries, but until now there has been little focus on how to maintain these intermediate caches. | gap 0.95 | 0.04 | 0.02 | hedged possibility 0.86 |
| s2 | This paper proposes CUP, a new comprehensive architecture for Controlled Update Propagation in peer-to-peer networks. | contribution 1.00 | 0.78 | 0.11 | asserted 1.00 |
| s3 | CUP asynchronously builds caches of index entries while answering search queries. | method 0.92 | 0.74 | 0.06 | asserted 1.00 |
| s4 | It then propagates updates of index entries to maintain these caches. | method 0.94 | 0.62 | 0.05 | asserted 1.00 |
| s5 | Under unfavorable conditions, when compared with standard caching based on expiration times, CUP reduces the average miss latency by as much as a factor of three. | result 1.00 | 0.90 | 0.18 | asserted 0.96 |
| s6 | Under favorable conditions, CUP can reduce the average miss latency by more than a factor of ten. | result 1.00 | 0.89 | 0.15 | hedged possibility 0.80 |
| s7 | CUP refreshes intermediate caches, reduces query latency, and reduces network load by coalescing bursts of queries for the same item. | method 0.41 | 0.81 | 0.18 | asserted 1.00 |
| s8 | CUP controls and confines propagation to updates whose cost is likely to be recovered by subsequent queries. | method 0.82 | 0.74 | 0.12 | asserted 0.99 |
| s9 | CUP gives peer-to-peer nodes the flexibility to use their own incentive-based policies to determine when to receive and when to propagate updates. | contribution 0.60 | 0.61 | 0.06 | asserted 0.97 |
| s10 | Finally, the small propagation overhead incurred by CUP is more than compensated for by its savings in cache misses. | interpretation 0.64 | 0.82 | 0.49 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v1
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
Recently the problem of indexing and locating content in peer-to-peer networks has received much attention. Previous work suggests caching index entries at intermediate nodes that lie on the paths taken by search queries, but until now there has been little focus on how to maintain these intermediate caches. This paper proposes CUP, a new comprehensive architecture for Controlled Update Propagation in peer-to-peer networks. CUP asynchronously builds caches of index entries while answering search queries. It then propagates updates of index entries to maintain these caches. Under unfavorable conditions, when compared with standard caching based on expiration times, CUP reduces the average miss latency by as much as a factor of three. Under favorable conditions, CUP can reduce the average miss latency by more than a factor of ten. CUP refreshes intermediate caches, reduces query latency, and reduces network load by coalescing bursts of queries for the same item. CUP controls and confines propagation to updates whose cost is likely to be recovered by subsequent queries. CUP gives peer-to-peer nodes the flexibility to use their own incentive-based policies to determine when to receive and when to propagate updates. Finally, the small propagation overhead incurred by CUP is more than compensated for by its savings in cache misses.
Human review
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.