Minimization of reception completion times by one-to-many file transfer using MultiPath-MultiCast with Reed-Solomon coding

IR HANDLE

Bibliographic Information

Other Title
  • リード・ソロモン符号化複数経路マルチキャストによる一対多ファイル転送時間の最小化

Search this article

Abstract

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 _le transfer using MultiPath-MultiCast (MPMC) on OpenFlow to realize an optimal schedule in which each recipient can complete the _le reception in its minimal time using the max-ow paths from a single sender. In MPMC, a _le 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.

Journal

Related Projects

See more

Keywords

Details 詳細情報について

Report a problem

Back to top