Minimal network coding redundancy for peer-to-peer content distribution

Dinh Nguyen, Hidenori Nakazato

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

    1 Citation (Scopus)

    Abstract

    Network coding, with the redundant information it generates, has been shown to achieve optimal multicast throughput. Such redundancy plays a key role in maximizing throughput over multiple content delivery paths between network nodes. In this paper, we study the use of network coding to speed up content distribution in peer-to-peer networks where only a constraint number of selected peers can encode, i.e. become network coders. Our goal is to optimize the redundancy network coding generates, i.e. we want to answer the question how much a given network coder should encode. This serves as a step towards understanding how network coding improves content distribution in order to optimize its deployment. Given the network topology, we analytically figure the optimal redundancy ratio at each network coder to achieve shortest distribution time. Simulation results confirm the effectiveness of the proposed coding redundancy in shortening content distribution time while noticeably reducing the amount of encoding.

    Original languageEnglish
    Title of host publication2014 IEEE International Conference on Communications, ICC 2014
    PublisherIEEE Computer Society
    Pages3112-3117
    Number of pages6
    ISBN (Print)9781479920037
    DOIs
    Publication statusPublished - 2014
    Event2014 1st IEEE International Conference on Communications, ICC 2014 - Sydney, NSW
    Duration: 2014 Jun 102014 Jun 14

    Other

    Other2014 1st IEEE International Conference on Communications, ICC 2014
    CitySydney, NSW
    Period14/6/1014/6/14

    Fingerprint

    Network coding
    Redundancy
    Throughput
    Peer to peer networks
    Topology

    ASJC Scopus subject areas

    • Computer Networks and Communications

    Cite this

    Nguyen, D., & Nakazato, H. (2014). Minimal network coding redundancy for peer-to-peer content distribution. In 2014 IEEE International Conference on Communications, ICC 2014 (pp. 3112-3117). [6883799] IEEE Computer Society. https://doi.org/10.1109/ICC.2014.6883799

    Minimal network coding redundancy for peer-to-peer content distribution. / Nguyen, Dinh; Nakazato, Hidenori.

    2014 IEEE International Conference on Communications, ICC 2014. IEEE Computer Society, 2014. p. 3112-3117 6883799.

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

    Nguyen, D & Nakazato, H 2014, Minimal network coding redundancy for peer-to-peer content distribution. in 2014 IEEE International Conference on Communications, ICC 2014., 6883799, IEEE Computer Society, pp. 3112-3117, 2014 1st IEEE International Conference on Communications, ICC 2014, Sydney, NSW, 14/6/10. https://doi.org/10.1109/ICC.2014.6883799
    Nguyen D, Nakazato H. Minimal network coding redundancy for peer-to-peer content distribution. In 2014 IEEE International Conference on Communications, ICC 2014. IEEE Computer Society. 2014. p. 3112-3117. 6883799 https://doi.org/10.1109/ICC.2014.6883799
    Nguyen, Dinh ; Nakazato, Hidenori. / Minimal network coding redundancy for peer-to-peer content distribution. 2014 IEEE International Conference on Communications, ICC 2014. IEEE Computer Society, 2014. pp. 3112-3117
    @inproceedings{ac781dcd834e40aeba42c6bd61427433,
    title = "Minimal network coding redundancy for peer-to-peer content distribution",
    abstract = "Network coding, with the redundant information it generates, has been shown to achieve optimal multicast throughput. Such redundancy plays a key role in maximizing throughput over multiple content delivery paths between network nodes. In this paper, we study the use of network coding to speed up content distribution in peer-to-peer networks where only a constraint number of selected peers can encode, i.e. become network coders. Our goal is to optimize the redundancy network coding generates, i.e. we want to answer the question how much a given network coder should encode. This serves as a step towards understanding how network coding improves content distribution in order to optimize its deployment. Given the network topology, we analytically figure the optimal redundancy ratio at each network coder to achieve shortest distribution time. Simulation results confirm the effectiveness of the proposed coding redundancy in shortening content distribution time while noticeably reducing the amount of encoding.",
    author = "Dinh Nguyen and Hidenori Nakazato",
    year = "2014",
    doi = "10.1109/ICC.2014.6883799",
    language = "English",
    isbn = "9781479920037",
    pages = "3112--3117",
    booktitle = "2014 IEEE International Conference on Communications, ICC 2014",
    publisher = "IEEE Computer Society",

    }

    TY - GEN

    T1 - Minimal network coding redundancy for peer-to-peer content distribution

    AU - Nguyen, Dinh

    AU - Nakazato, Hidenori

    PY - 2014

    Y1 - 2014

    N2 - Network coding, with the redundant information it generates, has been shown to achieve optimal multicast throughput. Such redundancy plays a key role in maximizing throughput over multiple content delivery paths between network nodes. In this paper, we study the use of network coding to speed up content distribution in peer-to-peer networks where only a constraint number of selected peers can encode, i.e. become network coders. Our goal is to optimize the redundancy network coding generates, i.e. we want to answer the question how much a given network coder should encode. This serves as a step towards understanding how network coding improves content distribution in order to optimize its deployment. Given the network topology, we analytically figure the optimal redundancy ratio at each network coder to achieve shortest distribution time. Simulation results confirm the effectiveness of the proposed coding redundancy in shortening content distribution time while noticeably reducing the amount of encoding.

    AB - Network coding, with the redundant information it generates, has been shown to achieve optimal multicast throughput. Such redundancy plays a key role in maximizing throughput over multiple content delivery paths between network nodes. In this paper, we study the use of network coding to speed up content distribution in peer-to-peer networks where only a constraint number of selected peers can encode, i.e. become network coders. Our goal is to optimize the redundancy network coding generates, i.e. we want to answer the question how much a given network coder should encode. This serves as a step towards understanding how network coding improves content distribution in order to optimize its deployment. Given the network topology, we analytically figure the optimal redundancy ratio at each network coder to achieve shortest distribution time. Simulation results confirm the effectiveness of the proposed coding redundancy in shortening content distribution time while noticeably reducing the amount of encoding.

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

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

    U2 - 10.1109/ICC.2014.6883799

    DO - 10.1109/ICC.2014.6883799

    M3 - Conference contribution

    AN - SCOPUS:84907000403

    SN - 9781479920037

    SP - 3112

    EP - 3117

    BT - 2014 IEEE International Conference on Communications, ICC 2014

    PB - IEEE Computer Society

    ER -