Peer-to-Peer Resource Trading in a Reliable Distributed System

  • Brian F. Cooper
  • Hector Garcia-Molina
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2429)


Peer-to-peer architectures can be used to build a robust, fault tolerant infrastructure for important services. One example is a peer-to-peer data replication system, in which digital collections are protected from failure by being replicated at multiple peers. We argue that such community-based redundancy, in which multiple sites contribute resources to build a fault-tolerant system, is an important application of peer-to-peer networking. In such a system, there must be flexible, effective techniques for managing resource allocation. We propose data trading, a mechanism where a site acquires remote resources in the community by trading away its own local resources. We discuss the application of data trading to the data replication problem, and examine other applications of trading. A general trading infrastructure is a valuable part of a peer-to-peer, community-based redundancy system.


Digital Library Storage Space Trading System Remote Site Reputation System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 5.
    F. B. Bastani and I-Ling Yen. A fault tolerant replicated storage system. In Proc. ICDE, May 1987.Google Scholar
  2. 6.
    Yuan Chen, Jan Edler, Andrew V. Goldberg, Allan Gottlieb, Sumeet Sobti, and Peter N. Yianilos. A prototype implementation of archival intermemory. In Proc. ACM Int’l Conf. on Digital Libraries, 1999.Google Scholar
  3. 7.
    W. W. Chu. Multiple file allocation in a multiple computer system. IEEE Transactions on Computing, C-18(10):885–889, Oct. 1969.CrossRefGoogle Scholar
  4. 8.
    B. F. Cooper, M. Bawa, N. Daswani, and H. Garcia-Molina. Protecting the PIPE from malicious peers., 2002. Technical report.
  5. 9.
    B. F. Cooper, A. Crespo, and H. Garcia-Molina. Implementing a reliable digital object archive. In Proc. European Conf. on Digital Libraries (ECDL), Sept. 2000. In LNCS (Springer-Verlag) volume 1923.Google Scholar
  6. 10.
    B. F. Cooper and H. Garcia-Molina. Bidding for storage space in a peer-to-peer data preservation system., 2001. Technical Report.
  7. 11.
    B. F. Cooper and H. Garcia-Molina. Creating trading networks of digital archives. In Proc. 1st Joint ACM/IEEE Conference on Digital Libraries (JCDL), June 2001.Google Scholar
  8. 12.
    B. F. Cooper and H. Garcia-Molina. Peer-to-peer data trading to preserve information. ACM Transactions on Information Systems, to appear.Google Scholar
  9. 13.
    R. Dingledine, M.J. Freedman, and D. Molnar. The FreeHaven Project: Distributed anonymous storage service. In Proceedings of the Workshop on Design Issues in Anonymity and Unobservability, July 2000.Google Scholar
  10. 14.
    X. Du and F. Maryanski. Data allocation in a dynamically reconfigurable environment. In Proc. ICDE, Feb. 1988.Google Scholar
  11. 15.
    B. Liskov et al. Replication in the Harp file system. In Proc. 13th SOSP, Oct. 1991.Google Scholar
  12. 16.
    J. H. Morris et al. Andrew: A distributed personal computing environment. CACM, 29(3):184–201, March 1986.Google Scholar
  13. 17.
    J. Kubiatowicz et al. OceanStore: An architecture for global-scale persistent storage. In Proc. ASPLOS, Nov. 2000.Google Scholar
  14. 18.
    J. Gray, P. Helland, P. O’Neal, and D. Shasha. The dangers of replication and a solution. In Proc. SIGMOD, June 1996.Google Scholar
  15. 19.
    J. J. Kistler and M. Satyanarayanan. Disconnected operation in the Coda file system. ACM TOCS, 10(1):3–25, Feb. 1992.CrossRefGoogle Scholar
  16. 20.
    E. Lee and C. Thekkath. Petal: Distributed virtual disks. In Proc. 7th ASPLOS, Oct. 1996.Google Scholar
  17. 21.
    S. Martello and P. Toth. Knapsack Problems: Algorithms and Computer Implementations. J. Wiley and Sons, Chichester, New York, 1990.zbMATHGoogle Scholar
  18. 22.
    D. Patterson, G. Gibson, and R. H. Katz. A case for redundant arrays of inexpensive disks (RAID). SIGMOD Record, 17(3):109–116, September 1988.CrossRefGoogle Scholar
  19. 23.
    H. Sandhu and S. Zhou. Cluster-based file replication in large-scale distributed systems. In Proc. SIGMETRICS, June 1992.Google Scholar
  20. 24.
    O. Wolfson, S. Jajodia, and Y. Huang. An adaptive data replication algorithm. ACM TODS, 2(2):255–314, June 1997.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Brian F. Cooper
    • 1
  • Hector Garcia-Molina
    • 1
  1. 1.Department of Computer ScienceStanford UniversityUSA

Personalised recommendations