Rarest-first and coding are not enough

Dinh Nguyen, Hidenori Nakazato

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトル2012 IEEE Global Communications Conference, GLOBECOM 2012
ページ2683-2688
ページ数6
DOI
出版ステータスPublished - 2012 12 1
イベント2012 IEEE Global Communications Conference, GLOBECOM 2012 - Anaheim, CA, United States
継続期間: 2012 12 32012 12 7

出版物シリーズ

名前GLOBECOM - IEEE Global Telecommunications Conference

Other

Other2012 IEEE Global Communications Conference, GLOBECOM 2012
国/地域United States
CityAnaheim, CA
Period12/12/312/12/7

ASJC Scopus subject areas

  • 電子工学および電気工学

フィンガープリント

「Rarest-first and coding are not enough」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル