Rarest-first and coding are not enough

Dinh Nguyen, Hidenori Nakazato

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

    1 Citation (Scopus)

    Abstract

    Network coding has been applied successfully in peer-to-peer (P2P) systems to shorten the distribution time. Pieces of data, i.e. blocks, are combined, i.e. encoded, by the sending peers before forwarding to other peers. Even though requiring all peers to encode might achieve shortest distribution time, it is not necessarily optimal in terms of computational resource consumption. Short finish time, in many cases, can be achieved with just a subset of carefully chosen peers. P2P systems, in addition, tend to be heterogeneous in which some peers, such as hand-held devices, would not have the required capacity to encode. We therefore envision a P2P system where some peers encode to improve distribution time and other peers, due to limited computational capacity or due to some system-wide optimization, do not encode. Such a system gives rise to a block-selection problem which has never happened in both pure non-coding and full network coding-enabled P2P systems. We identify the problem and fix the current block-selection algorithm to address it. Simulation evaluation confirms the effectiveness of our proposed algorithm without which the system performance degrades considerably.

    Original languageEnglish
    Title of host publicationGLOBECOM - IEEE Global Telecommunications Conference
    Pages2683-2688
    Number of pages6
    DOIs
    Publication statusPublished - 2012
    Event2012 IEEE Global Communications Conference, GLOBECOM 2012 - Anaheim, CA
    Duration: 2012 Dec 32012 Dec 7

    Other

    Other2012 IEEE Global Communications Conference, GLOBECOM 2012
    CityAnaheim, CA
    Period12/12/312/12/7

    Fingerprint

    Network coding

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering

    Cite this

    Nguyen, D., & Nakazato, H. (2012). Rarest-first and coding are not enough. In GLOBECOM - IEEE Global Telecommunications Conference (pp. 2683-2688). [6503522] https://doi.org/10.1109/GLOCOM.2012.6503522

    Rarest-first and coding are not enough. / Nguyen, Dinh; Nakazato, Hidenori.

    GLOBECOM - IEEE Global Telecommunications Conference. 2012. p. 2683-2688 6503522.

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

    Nguyen, D & Nakazato, H 2012, Rarest-first and coding are not enough. in GLOBECOM - IEEE Global Telecommunications Conference., 6503522, pp. 2683-2688, 2012 IEEE Global Communications Conference, GLOBECOM 2012, Anaheim, CA, 12/12/3. https://doi.org/10.1109/GLOCOM.2012.6503522
    Nguyen D, Nakazato H. Rarest-first and coding are not enough. In GLOBECOM - IEEE Global Telecommunications Conference. 2012. p. 2683-2688. 6503522 https://doi.org/10.1109/GLOCOM.2012.6503522
    Nguyen, Dinh ; Nakazato, Hidenori. / Rarest-first and coding are not enough. GLOBECOM - IEEE Global Telecommunications Conference. 2012. pp. 2683-2688
    @inproceedings{07f77d5c130741df9da5f13f1c7ee7ee,
    title = "Rarest-first and coding are not enough",
    abstract = "Network coding has been applied successfully in peer-to-peer (P2P) systems to shorten the distribution time. Pieces of data, i.e. blocks, are combined, i.e. encoded, by the sending peers before forwarding to other peers. Even though requiring all peers to encode might achieve shortest distribution time, it is not necessarily optimal in terms of computational resource consumption. Short finish time, in many cases, can be achieved with just a subset of carefully chosen peers. P2P systems, in addition, tend to be heterogeneous in which some peers, such as hand-held devices, would not have the required capacity to encode. We therefore envision a P2P system where some peers encode to improve distribution time and other peers, due to limited computational capacity or due to some system-wide optimization, do not encode. Such a system gives rise to a block-selection problem which has never happened in both pure non-coding and full network coding-enabled P2P systems. We identify the problem and fix the current block-selection algorithm to address it. Simulation evaluation confirms the effectiveness of our proposed algorithm without which the system performance degrades considerably.",
    author = "Dinh Nguyen and Hidenori Nakazato",
    year = "2012",
    doi = "10.1109/GLOCOM.2012.6503522",
    language = "English",
    isbn = "9781467309219",
    pages = "2683--2688",
    booktitle = "GLOBECOM - IEEE Global Telecommunications Conference",

    }

    TY - GEN

    T1 - Rarest-first and coding are not enough

    AU - Nguyen, Dinh

    AU - Nakazato, Hidenori

    PY - 2012

    Y1 - 2012

    N2 - Network coding has been applied successfully in peer-to-peer (P2P) systems to shorten the distribution time. Pieces of data, i.e. blocks, are combined, i.e. encoded, by the sending peers before forwarding to other peers. Even though requiring all peers to encode might achieve shortest distribution time, it is not necessarily optimal in terms of computational resource consumption. Short finish time, in many cases, can be achieved with just a subset of carefully chosen peers. P2P systems, in addition, tend to be heterogeneous in which some peers, such as hand-held devices, would not have the required capacity to encode. We therefore envision a P2P system where some peers encode to improve distribution time and other peers, due to limited computational capacity or due to some system-wide optimization, do not encode. Such a system gives rise to a block-selection problem which has never happened in both pure non-coding and full network coding-enabled P2P systems. We identify the problem and fix the current block-selection algorithm to address it. Simulation evaluation confirms the effectiveness of our proposed algorithm without which the system performance degrades considerably.

    AB - Network coding has been applied successfully in peer-to-peer (P2P) systems to shorten the distribution time. Pieces of data, i.e. blocks, are combined, i.e. encoded, by the sending peers before forwarding to other peers. Even though requiring all peers to encode might achieve shortest distribution time, it is not necessarily optimal in terms of computational resource consumption. Short finish time, in many cases, can be achieved with just a subset of carefully chosen peers. P2P systems, in addition, tend to be heterogeneous in which some peers, such as hand-held devices, would not have the required capacity to encode. We therefore envision a P2P system where some peers encode to improve distribution time and other peers, due to limited computational capacity or due to some system-wide optimization, do not encode. Such a system gives rise to a block-selection problem which has never happened in both pure non-coding and full network coding-enabled P2P systems. We identify the problem and fix the current block-selection algorithm to address it. Simulation evaluation confirms the effectiveness of our proposed algorithm without which the system performance degrades considerably.

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

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

    U2 - 10.1109/GLOCOM.2012.6503522

    DO - 10.1109/GLOCOM.2012.6503522

    M3 - Conference contribution

    AN - SCOPUS:84877679183

    SN - 9781467309219

    SP - 2683

    EP - 2688

    BT - GLOBECOM - IEEE Global Telecommunications Conference

    ER -