About | Contact Us | Register | Login
ProceedingsSeriesJournalsSearchEAI
1st International ICST Conference on Scalable Information Systems

Research Article

Adaptive content management in structured P2P communities

Cite
BibTeX Plain Text
  • @INPROCEEDINGS{10.1145/1146847.1146871,
        author={Jussi  Kangasharju and Keith W.  Ross and David A.  Turner},
        title={Adaptive content management in structured P2P communities},
        proceedings={1st International ICST Conference on Scalable Information Systems},
        publisher={ACM},
        proceedings_a={INFOSCALE},
        year={2005},
        month={6},
        keywords={},
        doi={10.1145/1146847.1146871}
    }
    
  • Jussi Kangasharju
    Keith W. Ross
    David A. Turner
    Year: 2005
    Adaptive content management in structured P2P communities
    INFOSCALE
    ACM
    DOI: 10.1145/1146847.1146871
Jussi Kangasharju1, Keith W. Ross2, David A. Turner3
  • 1: Dept. of Computer Science, TU Darmstadt, Darmstadt, Germany
  • 2: Dept. of CIS, Polytechnic University, Brooklyn, NY
  • 3: Dept. of Computer Science, California State University, San Bernardino, CA

Abstract

A fundamental paradigm in P2P is that of a large community of intermittently-connected nodes that cooperate to share files. Because nodes are intermittently connected, the P2P community must replicate and replace files as a function of their popularity to achieve satisfactory performance. We develop a suite of distributed, adaptive algorithms for replicating and replacing content in a P2P community. We do this for structured P2P communities, in which a distributed hash table (DHT) overlay is available for locating the node responsible for a key. In particular, we develop the Top-K MFR replication and replacement algorithm, which can be layered on top of a DHT overlay, and in addition adaptively converges to a nearly-optimal replication profile. Furthermore, we evaluate the file transfer load caused by the adaptive algorithms on each peer, and present two approaches for achieving a better load balance. Our evaluation shows that with our two algorithms, an arbitrary load distribution is possible, hence allowing each peer to serve requests at the rate it wishes.

Published
2005-06-01
Publisher
ACM
http://dx.doi.org/10.1145/1146847.1146871
Copyright © 2006–2025 ACM
EBSCOProQuestDBLPDOAJPortico
EAI Logo

About EAI

  • Who We Are
  • Leadership
  • Research Areas
  • Partners
  • Media Center

Community

  • Membership
  • Conference
  • Recognition
  • Sponsor Us

Publish with EAI

  • Publishing
  • Journals
  • Proceedings
  • Books
  • EUDL