Overlay Tree Construction Algorithm for Synchronized Realtime Media Multicast Service over the Best-Effort Service Internet
Summary :
This paper presents an overlay multicast tree construction algorithm for synchronized realtime media multicast service over Internet which traditionally supports only best-effort service. The proposed tree construction algorithm is implemented to reduce not only the average delay of group members in order to support realtime media service, but also the delay variance among group members to provide an effective synchronized service. Basically, the orthogonal genetic algorithm is employed to obtain the near optimal tree among clusters with low computational complexity since the given problem is NP-complete. In addition, a dynamic tree maintenance process is proposed to effectively update the tree when members change due to leave or join. Finally, we describe experiments that show the superior performance of the proposed algorithm.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E90-B No.12 pp.3552-3560
- Publication Date
- 2007/12/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1093/ietcom/e90-b.12.3552
- Type of Manuscript
- PAPER
- Category
- Network
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Hyunchul JOO, Hwangjun SONG, "Overlay Tree Construction Algorithm for Synchronized Realtime Media Multicast Service over the Best-Effort Service Internet" in IEICE TRANSACTIONS on Communications,
vol. E90-B, no. 12, pp. 3552-3560, December 2007, doi: 10.1093/ietcom/e90-b.12.3552.
Abstract: This paper presents an overlay multicast tree construction algorithm for synchronized realtime media multicast service over Internet which traditionally supports only best-effort service. The proposed tree construction algorithm is implemented to reduce not only the average delay of group members in order to support realtime media service, but also the delay variance among group members to provide an effective synchronized service. Basically, the orthogonal genetic algorithm is employed to obtain the near optimal tree among clusters with low computational complexity since the given problem is NP-complete. In addition, a dynamic tree maintenance process is proposed to effectively update the tree when members change due to leave or join. Finally, we describe experiments that show the superior performance of the proposed algorithm.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e90-b.12.3552/_p
Copy
@ARTICLE{e90-b_12_3552,
author={Hyunchul JOO, Hwangjun SONG, },
journal={IEICE TRANSACTIONS on Communications},
title={Overlay Tree Construction Algorithm for Synchronized Realtime Media Multicast Service over the Best-Effort Service Internet},
year={2007},
volume={E90-B},
number={12},
pages={3552-3560},
abstract={This paper presents an overlay multicast tree construction algorithm for synchronized realtime media multicast service over Internet which traditionally supports only best-effort service. The proposed tree construction algorithm is implemented to reduce not only the average delay of group members in order to support realtime media service, but also the delay variance among group members to provide an effective synchronized service. Basically, the orthogonal genetic algorithm is employed to obtain the near optimal tree among clusters with low computational complexity since the given problem is NP-complete. In addition, a dynamic tree maintenance process is proposed to effectively update the tree when members change due to leave or join. Finally, we describe experiments that show the superior performance of the proposed algorithm.},
keywords={},
doi={10.1093/ietcom/e90-b.12.3552},
ISSN={1745-1345},
month={December},}
Copy
TY - JOUR
TI - Overlay Tree Construction Algorithm for Synchronized Realtime Media Multicast Service over the Best-Effort Service Internet
T2 - IEICE TRANSACTIONS on Communications
SP - 3552
EP - 3560
AU - Hyunchul JOO
AU - Hwangjun SONG
PY - 2007
DO - 10.1093/ietcom/e90-b.12.3552
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E90-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2007
AB - This paper presents an overlay multicast tree construction algorithm for synchronized realtime media multicast service over Internet which traditionally supports only best-effort service. The proposed tree construction algorithm is implemented to reduce not only the average delay of group members in order to support realtime media service, but also the delay variance among group members to provide an effective synchronized service. Basically, the orthogonal genetic algorithm is employed to obtain the near optimal tree among clusters with low computational complexity since the given problem is NP-complete. In addition, a dynamic tree maintenance process is proposed to effectively update the tree when members change due to leave or join. Finally, we describe experiments that show the superior performance of the proposed algorithm.
ER -
English
