The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Dans cet article, nous proposons une technique de multidiffusion par superposition adaptée au réseau (NAOM) pour la diffusion de données volumineuses dans un réseau superposé bien géré. Pour améliorer le débit, NAOM utilise des hôtes en transfert uniquement ; ces hôtes participent au réseau superposé mais ne sont pas membres de la multidiffusion. Avec l'inclusion des hôtes en transfert uniquement, les tranches de données peuvent détourner les liens de goulot d'étranglement et davantage de ressources peuvent être utilisées pour créer des arborescences de multidiffusion efficaces. Les données volumineuses sont divisées en tranches de taille fixe, et les tranches sont transmises simultanément aux récepteurs de multidiffusion le long des multiples arborescences de multidiffusion. Nous modélisons le problème de la construction d’arbres de multidiffusion efficaces avec l’inclusion d’hôtes forward-only. Le problème est un problème NP-difficile, et nous introduisons un algorithme heuristique temporel polynomial. De plus, nous proposons un schéma de planification dynamique pour le transfert de données le long des arbres de multidiffusion évalués. Nos résultats expérimentaux dans un environnement réseau réel montrent une amélioration du débit mais au prix d’une consommation de ressources supplémentaire des nœuds forward-only.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Joonbok LEE, Kilnam CHON, "Network-Aware Overlay Multicast for Large Data Dissemination" in IEICE TRANSACTIONS on Communications,
vol. E92-B, no. 6, pp. 2263-2266, June 2009, doi: 10.1587/transcom.E92.B.2263.
Abstract: In this paper, we propose a network-aware overlay multicast (NAOM) technique for large data dissemination in a well-managed overlay network. To improve the throughput, NAOM utilizes forward-only hosts; these hosts participate in the overlay network but are not members of the multicast. With the inclusion of the forward-only hosts, data slices can detour bottleneck links and more resources can be used to build efficient multicast trees. Large data are divided into fixed-size slices, and the slices are delivered simultaneously to multicast receivers along the multiple multicast trees. We model the problem of building efficient multicast trees with the inclusion of forward-only hosts. The problem is an NP-hard problem, and we introduce a polynomial time heuristic algorithm. Furthermore, we propose a dynamic scheduling scheme for the transfer of data along the evaluated multicast trees. Our experimental results in a real network environment show an improvement of the throughput but at the cost of additional resource consumption of forward-only nodes.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E92.B.2263/_p
Copier
@ARTICLE{e92-b_6_2263,
author={Joonbok LEE, Kilnam CHON, },
journal={IEICE TRANSACTIONS on Communications},
title={Network-Aware Overlay Multicast for Large Data Dissemination},
year={2009},
volume={E92-B},
number={6},
pages={2263-2266},
abstract={In this paper, we propose a network-aware overlay multicast (NAOM) technique for large data dissemination in a well-managed overlay network. To improve the throughput, NAOM utilizes forward-only hosts; these hosts participate in the overlay network but are not members of the multicast. With the inclusion of the forward-only hosts, data slices can detour bottleneck links and more resources can be used to build efficient multicast trees. Large data are divided into fixed-size slices, and the slices are delivered simultaneously to multicast receivers along the multiple multicast trees. We model the problem of building efficient multicast trees with the inclusion of forward-only hosts. The problem is an NP-hard problem, and we introduce a polynomial time heuristic algorithm. Furthermore, we propose a dynamic scheduling scheme for the transfer of data along the evaluated multicast trees. Our experimental results in a real network environment show an improvement of the throughput but at the cost of additional resource consumption of forward-only nodes.},
keywords={},
doi={10.1587/transcom.E92.B.2263},
ISSN={1745-1345},
month={June},}
Copier
TY - JOUR
TI - Network-Aware Overlay Multicast for Large Data Dissemination
T2 - IEICE TRANSACTIONS on Communications
SP - 2263
EP - 2266
AU - Joonbok LEE
AU - Kilnam CHON
PY - 2009
DO - 10.1587/transcom.E92.B.2263
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E92-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 2009
AB - In this paper, we propose a network-aware overlay multicast (NAOM) technique for large data dissemination in a well-managed overlay network. To improve the throughput, NAOM utilizes forward-only hosts; these hosts participate in the overlay network but are not members of the multicast. With the inclusion of the forward-only hosts, data slices can detour bottleneck links and more resources can be used to build efficient multicast trees. Large data are divided into fixed-size slices, and the slices are delivered simultaneously to multicast receivers along the multiple multicast trees. We model the problem of building efficient multicast trees with the inclusion of forward-only hosts. The problem is an NP-hard problem, and we introduce a polynomial time heuristic algorithm. Furthermore, we propose a dynamic scheduling scheme for the transfer of data along the evaluated multicast trees. Our experimental results in a real network environment show an improvement of the throughput but at the cost of additional resource consumption of forward-only nodes.
ER -