Optimizing file availability in peer-to-peer content distribution

Jussi Kangasharju, Keith W. Ross, David A. Turner

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    A fundamental paradigm in peer-to-peer (P2P) content distribution 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. In this paper, we develop an analytical optimization theory for benchmarking the performance of replication/replacement algorithms, including algorithms that employ erasure codes. We also consider a content management algorithm, the Top-K Most Frequently Requested algorithm, and show that in most cases this algorithm converges to an optimal replica profile. Finally, we present two approaches for achieving an evenly balanced load over all the peers in the community.

    Original languageEnglish (US)
    Title of host publicationProceedings - IEEE INFOCOM 2007
    Subtitle of host publication26th IEEE International Conference on Computer Communications
    Pages1973-1981
    Number of pages9
    DOIs
    StatePublished - 2007
    EventIEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications - Anchorage, AK, United States
    Duration: May 6 2007May 12 2007

    Publication series

    NameProceedings - IEEE INFOCOM
    ISSN (Print)0743-166X

    Other

    OtherIEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications
    CountryUnited States
    CityAnchorage, AK
    Period5/6/075/12/07

    ASJC Scopus subject areas

    • Computer Science(all)
    • Electrical and Electronic Engineering

    Fingerprint Dive into the research topics of 'Optimizing file availability in peer-to-peer content distribution'. Together they form a unique fingerprint.

    Cite this