Network coder placement for peer-to-peer content distribution

Dinh Nguyen, Hidenori Nakazato

    Research output: Contribution to journalArticle

    1 Citation (Scopus)

    Abstract

    We study the use of network coding to speed up content distribution in peer-to-peer (P2P) networks. Our goal is to get the underlying reason for network coding's improved performance in P2P content distribution and to optimize resource consumption of network coding. We observe analytically and experimentally that in pure P2P networks, a considerable amount of data is sent multiple times from one peer to another when there are multiple paths connecting those two particular peers. Network coding, on the other hand, when applied at upstream peers, eliminates information duplication on paths to downstream peers, which results in more efficient content distribution. Based on that insight, we propose a network coder placement algorithm which achieves comparable distribution time as network coding, yet substantially reduces the number of encoders compared to a pure network coding solution in which all peers have to encode. Our placement method puts encoders at critical network positions to eliminate information duplication the most, thus, effectively shortens distribution time with just a portion of encoders.

    Original languageEnglish
    Pages (from-to)1661-1669
    Number of pages9
    JournalIEICE Transactions on Communications
    VolumeE96-B
    Issue number7
    DOIs
    Publication statusPublished - 2013 Jul

    Fingerprint

    Network coding
    Peer to peer networks

    Keywords

    • Content distribution
    • Network coding
    • Peer-to-peer

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering
    • Computer Networks and Communications
    • Software

    Cite this

    Network coder placement for peer-to-peer content distribution. / Nguyen, Dinh; Nakazato, Hidenori.

    In: IEICE Transactions on Communications, Vol. E96-B, No. 7, 07.2013, p. 1661-1669.

    Research output: Contribution to journalArticle

    @article{04dbf433377f43d192380cd1600e51c9,
    title = "Network coder placement for peer-to-peer content distribution",
    abstract = "We study the use of network coding to speed up content distribution in peer-to-peer (P2P) networks. Our goal is to get the underlying reason for network coding's improved performance in P2P content distribution and to optimize resource consumption of network coding. We observe analytically and experimentally that in pure P2P networks, a considerable amount of data is sent multiple times from one peer to another when there are multiple paths connecting those two particular peers. Network coding, on the other hand, when applied at upstream peers, eliminates information duplication on paths to downstream peers, which results in more efficient content distribution. Based on that insight, we propose a network coder placement algorithm which achieves comparable distribution time as network coding, yet substantially reduces the number of encoders compared to a pure network coding solution in which all peers have to encode. Our placement method puts encoders at critical network positions to eliminate information duplication the most, thus, effectively shortens distribution time with just a portion of encoders.",
    keywords = "Content distribution, Network coding, Peer-to-peer",
    author = "Dinh Nguyen and Hidenori Nakazato",
    year = "2013",
    month = "7",
    doi = "10.1587/transcom.E96.B.1661",
    language = "English",
    volume = "E96-B",
    pages = "1661--1669",
    journal = "IEICE Transactions on Communications",
    issn = "0916-8516",
    publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
    number = "7",

    }

    TY - JOUR

    T1 - Network coder placement for peer-to-peer content distribution

    AU - Nguyen, Dinh

    AU - Nakazato, Hidenori

    PY - 2013/7

    Y1 - 2013/7

    N2 - We study the use of network coding to speed up content distribution in peer-to-peer (P2P) networks. Our goal is to get the underlying reason for network coding's improved performance in P2P content distribution and to optimize resource consumption of network coding. We observe analytically and experimentally that in pure P2P networks, a considerable amount of data is sent multiple times from one peer to another when there are multiple paths connecting those two particular peers. Network coding, on the other hand, when applied at upstream peers, eliminates information duplication on paths to downstream peers, which results in more efficient content distribution. Based on that insight, we propose a network coder placement algorithm which achieves comparable distribution time as network coding, yet substantially reduces the number of encoders compared to a pure network coding solution in which all peers have to encode. Our placement method puts encoders at critical network positions to eliminate information duplication the most, thus, effectively shortens distribution time with just a portion of encoders.

    AB - We study the use of network coding to speed up content distribution in peer-to-peer (P2P) networks. Our goal is to get the underlying reason for network coding's improved performance in P2P content distribution and to optimize resource consumption of network coding. We observe analytically and experimentally that in pure P2P networks, a considerable amount of data is sent multiple times from one peer to another when there are multiple paths connecting those two particular peers. Network coding, on the other hand, when applied at upstream peers, eliminates information duplication on paths to downstream peers, which results in more efficient content distribution. Based on that insight, we propose a network coder placement algorithm which achieves comparable distribution time as network coding, yet substantially reduces the number of encoders compared to a pure network coding solution in which all peers have to encode. Our placement method puts encoders at critical network positions to eliminate information duplication the most, thus, effectively shortens distribution time with just a portion of encoders.

    KW - Content distribution

    KW - Network coding

    KW - Peer-to-peer

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

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

    U2 - 10.1587/transcom.E96.B.1661

    DO - 10.1587/transcom.E96.B.1661

    M3 - Article

    AN - SCOPUS:84879859405

    VL - E96-B

    SP - 1661

    EP - 1669

    JO - IEICE Transactions on Communications

    JF - IEICE Transactions on Communications

    SN - 0916-8516

    IS - 7

    ER -