Presentation 2019-03-15
Minimizing the reception completion times in one-to-many file transfer using MultiPath-MultiCast with Reed-Solomon coding
Masayuki Kurata, Kenji Heira, Masahiro Shibata, Masato Tsuru,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) A rapid increase in network traffic has caused a problem along with the penetration of sharing, duplicating, or migrating a large-sized data and software among distributed servers or sites. We previously proposed the one-to-many file transfer using MultiPath-MultiCast (MPMC) on OpenFlow to realize an optimal schedule in which each recipient can complete the file reception in its minimal time using the max-flow paths from a single sender. In MPMC, a file is divided into equally-sized blocks; different blocks are concurrently transmitted to the same recipient on multiple paths; while the same block is concurrently transmitted to multiple recipients by multicast. This report newly proposes the coded-MPMC in which a sender proactively generates a necessary number of coded blocks using Reed-Solomon coding and transmits different coded blocks in each phase (a period between when a set of recipients completed and when the next set of recipients complete), allowing an optimal block allocation regardless of a difference among recipients' already-received blocks in the previous phases. A few heuristics in the block allocation order are developed in coded-MPMC and shown to efficiently find optimal schedules on large-scale real-world network topologies through simulation. A preliminary implementation of coded-MPMC is verified on an OpenFlow emulator.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) OpenFlow / MultiPath-MultiCast transfer / One-to-many file transfer / Max-flow problem / Reed-Solomon coding
Paper # CQ2018-116
Date of Issue 2019-03-07 (CQ)

Conference Information
Committee IMQ / IE / MVE / CQ
Conference Date 2019/3/14(2days)
Place (in Japanese) (See Japanese page)
Place (in English) Kagoshima University
Topics (in Japanese) (See Japanese page)
Topics (in English) media of five senses, multimedia, media experience, picture codinge, image media quality, network,quality and reliability, etc
Chair Kenji Sugiyama(Seikei Univ.) / Takayuki Hamamoto(Tokyo Univ. of Science) / Kenji Mase(Nagoya Univ.) / Takanori Hayashi(Hiroshima Inst. of Tech.)
Vice Chair Toshiya Nakaguchi(Chiba Univ.) / Mitsuru Maeda(Canon) / Hideaki Kimata(NTT) / Kazuya Kodama(NII) / Masayuki Ihara(NTT) / Hideyuki Shimonishi(NEC) / Jun Okamoto(NTT)
Secretary Toshiya Nakaguchi(Nagoya Univ.) / Mitsuru Maeda(Sony) / Hideaki Kimata(KDDI Research) / Kazuya Kodama(Nagoya Univ.) / Masayuki Ihara(NTT) / Hideyuki Shimonishi(Kyushu Univ.) / Jun Okamoto(Nagoya Univ.)
Assistant Masaru Tsuchida(NTT) / Gosuke Ohashi(Shizuoka Univ.) / Kazuya Hayase(NTT) / Yasutaka Matsuo(NHK) / Satoshi Nishiguchi(Oosaka Inst. of Tech.) / Masanori Yokoyama(*) / Chikara Sasaki(KDDI Research) / Yoshiaki Nishikawa(NEC) / Ryo Yamamoto(UEC)

Paper Information
Registration To Technical Committee on Image Media Quality / Technical Committee on Image Engineering / Technical Committee on Media Experience and Virtual Environment / Technical Committee on Communication Quality
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Minimizing the reception completion times in one-to-many file transfer using MultiPath-MultiCast with Reed-Solomon coding
Sub Title (in English)
Keyword(1) OpenFlow
Keyword(2) MultiPath-MultiCast transfer
Keyword(3) One-to-many file transfer
Keyword(4) Max-flow problem
Keyword(5) Reed-Solomon coding
1st Author's Name Masayuki Kurata
1st Author's Affiliation Kyushu Institute of Technology(KIT)
2nd Author's Name Kenji Heira
2nd Author's Affiliation Kyushu Institute of Technology(KIT)
3rd Author's Name Masahiro Shibata
3rd Author's Affiliation Kyushu Institute of Technology(KIT)
4th Author's Name Masato Tsuru
4th Author's Affiliation Kyushu Institute of Technology(KIT)
Date 2019-03-15
Paper # CQ2018-116
Volume (vol) vol.118
Number (no) CQ-503
Page pp.pp.129-134(CQ),
#Pages 6
Date of Issue 2019-03-07 (CQ)