ログイン
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

  1. 学会・会議発表論文
  2. 学会・会議発表論文

One-to-many file transfer using multipath multicast with gossiping

http://hdl.handle.net/10228/00006939
http://hdl.handle.net/10228/00006939
0e915417-fc65-4cf4-bc89-e5244a9b001a
名前 / ファイル ライセンス アクション
RECN_2018-44.pdf RECN_2018-44.pdf (575.3 kB)
Item type 会議発表論文 = Conference Paper(1)
公開日 2018-10-03
資源タイプ
資源タイプ識別子 http://purl.org/coar/resource_type/c_5794
資源タイプ conference paper
タイトル
タイトル One-to-many file transfer using multipath multicast with gossiping
言語 en
言語
言語 eng
著者 Heira, Kenji

× Heira, Kenji

WEKO 23232

en Heira, Kenji

Search repository
Ogawa, Kyohei

× Ogawa, Kyohei

WEKO 23233

en Ogawa, Kyohei

Search repository
鶴, 正人

× 鶴, 正人

WEKO 5853
e-Rad 40231443
Scopus著者ID 7005093872
ORCiD 0000-0001-7340-6798

ja 鶴, 正人


en Tsuru, Masato

ja-Kana ツル, マサト

Search repository
抄録
内容記述タイプ 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.
備考
内容記述タイプ Other
内容記述 The 4th IEEE International Conference on Network Softwarization (NetSoft 2018) , June 25-29, 2018, Montreal, Canada.
書誌情報 2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft)

p. 188-191, 発行日 2018-06
出版社
出版社 IEEE
DOI
関連タイプ isVersionOf
識別子タイプ DOI
関連識別子 https://doi.org/10.1109/NETSOFT.2018.8460123
ISBN
識別子タイプ ISBN
関連識別子 978-1-5386-4633-5
ISBN
識別子タイプ ISBN
関連識別子 978-1-5386-4634-2
著作権関連情報
権利情報 Copyright (c) 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
出版タイプ
出版タイプ AM
出版タイプResource http://purl.org/coar/version/c_ab4af688f83e57aa
査読の有無
値 yes
研究者情報
URL https://hyokadb02.jimu.kyutech.ac.jp/html/206_ja.html
論文ID(連携)
値 10332423
連携ID
値 7440
戻る
0
views
See details
Views

Versions

Ver.1 2023-05-15 13:41:19.377282
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR 2.0
  • OAI-PMH JPCOAR 1.0
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3