Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/502034.502053acmconferencesArticle/Chapter ViewAbstractPublication PagessospConference Proceedingsconference-collections
Article

Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility

Published: 21 October 2001 Publication History
  • Get Citation Alerts
  • Abstract

    This paper presents and evaluates the storage management and caching in PAST, a large-scale peer-to-peer persistent storage utility. PAST is based on a self-organizing, Internet-based overlay network of storage nodes that cooperatively route file queries, store multiple replicas of files, and cache additional copies of popular files.In the PAST system, storage nodes and files are each assigned uniformly distributed identifiers, and replicas of a file are stored at nodes whose identifier matches most closely the file's identifier. This statistical assignment of files to storage nodes approximately balances the number of files stored on each node. However, non-uniform storage node capacities and file sizes require more explicit storage load balancing to permit graceful behavior under high global storage utilization; likewise, non-uniform popularity of files requires caching to minimize fetch distance and to balance the query load.We present and evaluate PAST, with an emphasis on its storage management and caching system. Extensive trace-driven experiments show that the system minimizes fetch distance, that it balances the query load for popular files, and that it displays graceful degradation of performance as the global storage utilization increases beyond 95%.

    References

    [1]
    Napster. http://www.napster.com/.]]
    [2]
    The Gnutella protocol specification, 2000. http: / / dss.clip2.com/GnuteUaProtocolO4.pdf.]]
    [3]
    W. Adjie-Winoto, E. Schwartz, H. Baiakrishnan, and J. Lilley. The design and implementation of an intentional naming system. In Proc. SOSP'99, Kiawah Island, SC, Dec. 1999.]]
    [4]
    Y. Amir, A. Peterson, and D. Shaw. Seamlessly selecting the best copy from Internet-wide replicated web servers. In Proc. 12th Symposium on Distributed Computing, Andros, Greece, Sept. 1998.]]
    [5]
    R. Anderson. The Eternity service. In Proc. PRAGOCRYPT'96, pages 242-252. CTU Publishing House, 1996. Prague, Czech Republic.]]
    [6]
    T. Anderson, M. Dahlin, J. Neefe, D. Patterson, D. RoseUi, and R. Wang. Serverless network file systems. In Proe. 15th A CM SOSP, Copper Mountain, CO, Dec. 1995.]]
    [7]
    F. Bennett, D. Clarke, J. B. Evans, A. Hopper, A. Jones, and D. Leask. Piconet - embedded mobile networking. IBEE Personal Communications, 4(5):8-15, October 1997.]]
    [8]
    W. J. Bolosky, J. R. Douceur, D. Ely, and M. Theimer. Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs. In Proc. SIGMBTRICS'2000, Santa Clara, CA, 2000.]]
    [9]
    M. Bowman, L. L. Peterson, and A. Yeatts. Univers: An attribute-based name server. Software -- Practice and Experience, 20(4):403-424, Apr. 1990.]]
    [10]
    L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker. Web caching and Zipf-like distributions: Evidence and implications. In Proc. IEEE Infoeom'g9, New York, NY, Mar. 1999.]]
    [11]
    P. Cao and S. Irani. Cost-aware WWW proxy caching algorithms. In Proc. USENIX Symposium on Internet Technologies and Systems (USITS), Monterey, CA, Dec. 1997.]]
    [12]
    D. R. Cheriton and T. P. Mann. Decentralizing a global naming service for improved performance and fault tolerance. ACM Trans. Comput. Syst., 7(2):147-183, May 1989.]]
    [13]
    I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong. Freenet: A distributed anonymous information storage and retrieval system. In Workshop on Design Issues in Anonymity and Unobservability, pages 311-320, July 2000. ICSI, Berkeley, CA, USA.]]
    [14]
    F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area cooperative storage with CFS. In Proc. ACM SOSP'01, Banff, Canada, Oct. 2001.]]
    [15]
    It. Dingledine, M. J. Freedman, and D. Molnar. The Free Haven project: Distributed anonymous storage service. In Proc. Workshop on Design Issues in Anonymity and Unobservability, Berkeley, CA, July 2000.]]
    [16]
    P. Druschel and A. Rowstron. PAST: A large-scale, persistent peer-to-peer storage utility. In Proc. HotOS VIII, Schloss Elman, Germany, May 2001.]]
    [17]
    J. Jannotti, D. K. Gifford, K. L. Johnson, M. F. Kaashoek, and J. W. O'Toole. Overcast: Reliable multicasting with an overlay network. In Proc. OSDI 2000, San Diego, CA, October 2000.]]
    [18]
    J. Kangasharju, J. W. Roberts, and K. W. Ross. Performance evaluation of redirection schemes in content distribution networks. In Proc. 4th Web Caching Workshop, San Diego, CA, Mar. 1999.]]
    [19]
    J. Kangasharju and K. W. Ross. A replicated architecture for the domain name system. In Proc. IEEE Infocom 2000, Tel Aviv, Israel, Max. 2000.]]
    [20]
    J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B. Zhao. Oceanstore: An architecture for global-scale persistent store. In Proc. ASPLOS'2000, Cambridge, MA, November 2000.]]
    [21]
    B. Lampson. Designing a global name service. In Proc. Fifth Symposium on the Principles of Distributed Computing, pages 1-10, Minaki, Canada, Aug. 1986.]]
    [22]
    J. Li, J. 3annotti, D. S. J. D. Couto, D. R. Karger, and R. Morris. A scalable location service for geographical ad hoc routing. In Proc. of A CM MOBICOM 2000, Boston, MA, August 2000.]]
    [23]
    J. S. Plank. A tutorial on Reed-Solomon coding for fault-tolerance in RAID-like systems. Software -- Practice and Experience, 27(9):995-1012, Sept. 1997.]]
    [24]
    C. G. Plaxton, R. Rajaraman, and A. W. Richa. Accessing nearby copies of replicated objects in a distributed environment. Theory of Computing Systems, 32:241-280, 1999.]]
    [25]
    S. Ratnasamy, P. Francis, M. Handiey, R. Karp, and S. Shenker. A scalable content-addressable network. In Proc. ACM SIGCOMM'01, San Diego, CA, Aug. 2001.]]
    [26]
    J. Reynolds. RFC 1309: Technical overview of directory services using the X.500 protocol, Mar. 1992.]]
    [27]
    A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proc. IFIP/A CM Middleware 2001, Heidelberg, Germany, Nov. 2001.]]
    [28]
    S. Saroiu, P. K. Gummadi, and S. D. Gribble. A measurement study of peer-to-peer file sharing systems. Technical Roport UW-CSE-01-06-02, University of Washington, July 2001.]]
    [29]
    M. A. Sheldon, A. Duda, R. Weiss, and D. K. Gifford. Discover: A resource discovery system based on content routing. In Proe. 3rd International World Wide Web Conference, Darmstadt, Germany, 1995.]]
    [30]
    I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for Internet applications. In Proc. A CM SIGCOMM'01, San Diego, CA, Aug. 2001.]]
    [31]
    B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph. Tapestry: An infrastructure for fault-resilient wide-area location and routing. Technical Report UCB//CSD-01-1141, U. C. Berkeley, April 2001.]]

    Cited By

    View all
    • (2023)License Forecasting and Scheduling for HPC2023 31st International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)10.1109/MASCOTS59514.2023.10387539(1-8)Online publication date: 16-Oct-2023
    • (2022)WukaStore: Scalable, Configurable and Reliable Data Storage on Hybrid Volunteered Cloud and Desktop SystemsIEEE Transactions on Big Data10.1109/TBDATA.2017.27587918:1(85-98)Online publication date: 1-Feb-2022
    • (2021)A Neighborhood Aware Caching and Interest Dissemination Scheme for Content Centric NetworksIEEE Transactions on Network and Service Management10.1109/TNSM.2021.307932618:3(3900-3917)Online publication date: Sep-2021
    • Show More Cited By

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    SOSP '01: Proceedings of the eighteenth ACM symposium on Operating systems principles
    October 2001
    254 pages
    ISBN:1581133898
    DOI:10.1145/502034
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 21 October 2001

    Permissions

    Request permissions for this article.

    Check for updates

    Qualifiers

    • Article

    Conference

    SOSP01
    Sponsor:
    SOSP01: 18th Symposium on Operating System Principles
    October 21 - 24, 2001
    Alberta, Banff, Canada

    Acceptance Rates

    SOSP '01 Paper Acceptance Rate 17 of 85 submissions, 20%;
    Overall Acceptance Rate 131 of 716 submissions, 18%

    Upcoming Conference

    SOSP '24

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)44
    • Downloads (Last 6 weeks)5
    Reflects downloads up to 11 Aug 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2023)License Forecasting and Scheduling for HPC2023 31st International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)10.1109/MASCOTS59514.2023.10387539(1-8)Online publication date: 16-Oct-2023
    • (2022)WukaStore: Scalable, Configurable and Reliable Data Storage on Hybrid Volunteered Cloud and Desktop SystemsIEEE Transactions on Big Data10.1109/TBDATA.2017.27587918:1(85-98)Online publication date: 1-Feb-2022
    • (2021)A Neighborhood Aware Caching and Interest Dissemination Scheme for Content Centric NetworksIEEE Transactions on Network and Service Management10.1109/TNSM.2021.307932618:3(3900-3917)Online publication date: Sep-2021
    • (2020)Systematic Evaluation of LibreSocial—A Peer-to-Peer Framework for Online Social NetworksFuture Internet10.3390/fi1209014012:9(140)Online publication date: 20-Aug-2020
    • (2020)Peer-to-Peer-Based Social Networks: A Comprehensive SurveySN Computer Science10.1007/s42979-020-00315-81:5Online publication date: 11-Sep-2020
    • (2019)Rethinking General-Purpose Decentralized ComputingProceedings of the Workshop on Hot Topics in Operating Systems10.1145/3317550.3321448(105-112)Online publication date: 13-May-2019
    • (2019)Cache Me if You Can: Capacitated Selfish Replication Games in NetworksTheory of Computing Systems10.1007/s00224-019-09939-7Online publication date: 29-Jul-2019
    • (2019)A Novel Exploration for Blockchain in Distributed File StorageBlockchain and Trustworthy Systems10.1007/978-981-15-2777-7_60(740-746)Online publication date: 23-Dec-2019
    • (2018)A large scale analysis of unreliable stochastic networksThe Annals of Applied Probability10.1214/17-AAP131828:2Online publication date: 1-Apr-2018
    • (2018)RETRACTED ARTICLE: Load balancing in wireless networks using reputation-ReDS in the magnified distributed hash tableMultimedia Tools and Applications10.1007/s11042-018-5620-677:8(10347-10364)Online publication date: 1-Apr-2018
    • Show More Cited By

    View Options

    Get Access

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media