USENIX 2003 Annual Technical Conference, General Track — Abstract
| Pp. 167-180 of the Proceedings |
CUP: Controlled Update Propagation in Peer-to-Peer Networks
Mema Roussopoulos and Mary Baker, Stanford University
Abstract
This paper proposes CUP, a protocol for performing Controlled Update
Propagation to maintain caches of metadata in peer-to-peer networks.
To moderate propagation without imposing a global policy, CUP
introduces the notion of individual node investment return.
CUP allows each node to determine when it has economic incentive to
receive and to propagate updates. A node participates in propagation
only when the benefit (investment return) it secures from
receiving and propagating updates outweighs its cost of propagation.
We extensively evaluate the CUP protocol in maintaining caches of
metadata for locating content in peer-to-peer networks. We
demonstrate that propagation of updates reduces the average latency of
content search queries by as much as an order of magnitude across a
variety of workloads. We propose and evaluate the use of
popularity-based incentives to drive a node's propagation
policy. These include incentives based on probabilistic as well as
history-based models of investment return. Using these policies, we show
that CUP nodes recover their propagation overhead by a factor of 2 to
300, thus offering a lean but powerful protocol.
- View the full text of this paper in
HTML and
PDF.
Until June 2004, you will need your USENIX membership identification in order to access the full papers. The Proceedings are published as a collective work, © 2003 by the USENIX Association. All Rights Reserved. Rights to individual papers remain with the author or the author's employer. Permission is granted for the noncommercial reproduction of the complete work for educational or research purposes. USENIX acknowledges all trademarks within this paper.
- If you need the latest Adobe Acrobat Reader, you can download it from Adobe's site.
|
Need help? Use our Contacts page.
