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

Dinh Nguyen, Hidenori Nakazato

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトル2014 IEEE International Conference on Communications, ICC 2014
出版社IEEE Computer Society
ページ3112-3117
ページ数6
ISBN(印刷版)9781479920037
DOI
出版ステータスPublished - 2014 1 1
イベント2014 1st IEEE International Conference on Communications, ICC 2014 - Sydney, NSW, Australia
継続期間: 2014 6 102014 6 14

出版物シリーズ

名前2014 IEEE International Conference on Communications, ICC 2014

Conference

Conference2014 1st IEEE International Conference on Communications, ICC 2014
国/地域Australia
CitySydney, NSW
Period14/6/1014/6/14

ASJC Scopus subject areas

  • コンピュータ ネットワークおよび通信

フィンガープリント

「Minimal network coding redundancy for peer-to-peer content distribution」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル