One-to-many file transfer using multipath multicast with gossiping
Abstract
With the recent progress of cloud and distributed computing technologies, data migration and replication among distributed data centers grows rapidly. To manage a simplified scenario that a single sender sends a large-sized file to multiple recipients, i.e., one-to-many file transfer, on a network with full-duplex links, we are developing the Multipath-Multicast (MPMC) file transfer. A file is appropriately 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, aiming at shorter reception completion times of all recipients. However, on large-scale complex network topologies, it is not easy to find a good block transfer schedule, i.e., that realizes the reception completion times of most recipients close to their lower-bounds in MPMC. In this report, therefore, a gossiping approach to allow block transfer among recipients is introduced into MPMC and evaluated through simulation on two real backbone topologies. Since unused capacities of links in the original basic MPMC can be utilized in the MPMC with gossiping, a good schedule can be found more easily compared with the basic MPMC even with the same simple greedy block allocation.
The 4th IEEE International Conference on Network Softwarization (NetSoft 2018) , June 25-29, 2018, Montreal, Canada.
Journal
-
- 2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft)
-
2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft) 188-191, 2018-06
IEEE
- Tweet
Details 詳細情報について
-
- CRID
- 1050011097147474944
-
- NII Article ID
- 120006693565
-
- HANDLE
- 10228/00006939
-
- Text Lang
- en
-
- Article Type
- conference paper
-
- Data Source
-
- IRDB
- Crossref
- CiNii Articles
- KAKEN