Optimizing file availability in peer-to-peer content distribution

Jussi Kangasharju, Keith 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: 26th 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

    Other

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

    Fingerprint

    Availability
    Benchmarking

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering
    • Hardware and Architecture

    Cite this

    Kangasharju, J., Ross, K., & Turner, D. A. (2007). Optimizing file availability in peer-to-peer content distribution. In Proceedings - IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications (pp. 1973-1981). [4215811] https://doi.org/10.1109/INFCOM.2007.229

    Optimizing file availability in peer-to-peer content distribution. / Kangasharju, Jussi; Ross, Keith; Turner, David A.

    Proceedings - IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications. 2007. p. 1973-1981 4215811.

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

    Kangasharju, J, Ross, K & Turner, DA 2007, Optimizing file availability in peer-to-peer content distribution. in Proceedings - IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications., 4215811, pp. 1973-1981, IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications, Anchorage, AK, United States, 5/6/07. https://doi.org/10.1109/INFCOM.2007.229
    Kangasharju J, Ross K, Turner DA. Optimizing file availability in peer-to-peer content distribution. In Proceedings - IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications. 2007. p. 1973-1981. 4215811 https://doi.org/10.1109/INFCOM.2007.229
    Kangasharju, Jussi ; Ross, Keith ; Turner, David A. / Optimizing file availability in peer-to-peer content distribution. Proceedings - IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications. 2007. pp. 1973-1981
    @inproceedings{8545e841dc4c48aa88f67eb191873ac0,
    title = "Optimizing file availability in peer-to-peer content distribution",
    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.",
    author = "Jussi Kangasharju and Keith Ross and Turner, {David A.}",
    year = "2007",
    doi = "10.1109/INFCOM.2007.229",
    language = "English (US)",
    isbn = "1424410479",
    pages = "1973--1981",
    booktitle = "Proceedings - IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications",

    }

    TY - GEN

    T1 - Optimizing file availability in peer-to-peer content distribution

    AU - Kangasharju, Jussi

    AU - Ross, Keith

    AU - Turner, David A.

    PY - 2007

    Y1 - 2007

    N2 - 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.

    AB - 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.

    UR - http://www.scopus.com/inward/record.url?scp=34548312420&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=34548312420&partnerID=8YFLogxK

    U2 - 10.1109/INFCOM.2007.229

    DO - 10.1109/INFCOM.2007.229

    M3 - Conference contribution

    SN - 1424410479

    SN - 9781424410477

    SP - 1973

    EP - 1981

    BT - Proceedings - IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications

    ER -