IEICE Technical Committee Submission System
Conference Paper's Information
Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2017-11-17 14:35
One-to-many file transfer using multipath multicast with gossiping
Kenji Heira, Masato Tsuru (Kyutech) ICM2017-31
Abstract (in Japanese) (See Japanese page) 
(in English) With the recent progress of cloud computing technology, a rapid growth of traffic by data migration and duplication among distributed data centers is becoming a problem.
Therefore, it is of necessity that a single sender sends a large-sized file to multiple recipients, i.e., one-to-many file transfer, in an efficient manner.
We have been developing Multipath-Multicast (MPMC) file transfer in which a file to transfer is appropriately divided into equally-sized blocks, and using OpenFlow technology, different blocks are concurrently transmitted to the same recipient over multiple paths to fully utilize the link capacities,
while the same block is concurrently transmitted to multiple recipients by multicast to efficiently utilize the link capacities, in order to shorten the reception completion time of each recipient.
To find a good schedule of block transmission over multiple phases in MPMC file transfer,
transmission routes and block assignments to those routes are determined on a phase-by-phase basis by using an algorithm with a parameter representing a sequential order of recipients.
Then a set of candidate schedules are obtained by randomly changing the parameter,
and finally the best performed one is selected from them.
In this report, a gossipping approach (an inter-recipient transfer in which a recipient can transmit an already received block to other recipients who do not have that block) is introduced
and its effectiveness is evaluated through simulation.
Since unused link capacities are efficiently utilized by gossiping,
in MPMC with gossipping, an almost ideal schedule is realized
in which most recipients achieve the reception completion time close to its lower-bound.
In addition, it is shown that such schedules can be found even with a small set of candidate schedules (i.e., with a small number of parameter searches).
Keyword (in Japanese) (See Japanese page) 
(in English) OpenFlow / multipath transfer / multicast transfer / one-to-many file transfer / gossiping / / /  
Reference Info. IEICE Tech. Rep., vol. 117, no. 305, ICM2017-31, pp. 57-62, Nov. 2017.
Paper # ICM2017-31 
Date of Issue 2017-11-09 (ICM) 
ISSN Print edition: ISSN 0913-5685    Online edition: ISSN 2432-6380
Copyright
and
reproduction
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF ICM2017-31

Conference Information
Committee ICM CQ NS NV  
Conference Date 2017-11-16 - 2017-11-17 
Place (in Japanese) (See Japanese page) 
Place (in English)  
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To ICM 
Conference Code 2017-11-ICM-CQ-NS-NV 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) One-to-many file transfer using multipath multicast with gossiping 
Sub Title (in English)  
Keyword(1) OpenFlow  
Keyword(2) multipath transfer  
Keyword(3) multicast transfer  
Keyword(4) one-to-many file transfer  
Keyword(5) gossiping  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Kenji Heira  
1st Author's Affiliation Kyushu Institute of Technology (Kyutech)
2nd Author's Name Masato Tsuru  
2nd Author's Affiliation Kyushu Institute of Technology (Kyutech)
3rd Author's Name  
3rd Author's Affiliation ()
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
Speaker Author-1 
Date Time 2017-11-17 14:35:00 
Presentation Time 25 minutes 
Registration for ICM 
Paper # ICM2017-31 
Volume (vol) vol.117 
Number (no) no.305 
Page pp.57-62 
#Pages
Date of Issue 2017-11-09 (ICM) 


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan