Construction of a Robust Multicast Tree for Application-Level Multicast

Taku NOGUCHI; Miki YAMAMOTO

doi:10.1093/ietcom/e88-b.12.4427

Construction of a Robust Multicast Tree for Application-Level Multicast

Taku NOGUCHI, Miki YAMAMOTO

Full Text Views

0

Share
Cite this

Summary :

Application-level multicast (ALM) is a feasible alternative to IP multicast. In ALM, multicast related features, such as group membership management, multicast routing and packet replication, are implemented at end-hosts instead of routers. A multicast distribution tree is constructed in the application layer, so all nodes in this tree are end-hosts. Packet transmission between end-hosts uses conventional IP unicast service. Therefore, all end-hosts can enjoy multicast communications without IP multicast service. However, ALM has a serious problem that the multicast distribution tree is intrinsically fragile and an end-host failure causes tree partitions. In this paper, to deal with this problem, we propose a new tree construction protocol which makes outdegrees of intermediate nodes be balanced. The degree-balanced distribution tree can reduce the average number of nodes decoupled by tree partitions. To investigate performance of our protocol, it is compared with an existing ALM protocol. Our simulation results show that our protocol outperforms the existing protocol from the viewpoints of robustness, loss probability and receiver-perceived delay.

Publication: IEICE TRANSACTIONS on Communications Vol.E88-B No.12 pp.4427-4434

Publication Date: 2005/12/01

Publicized

Online ISSN

DOI: 10.1093/ietcom/e88-b.12.4427

Type of Manuscript: Special Section PAPER (IEICE/IEEE Joint Special Section on Autonomous Decentralized Systems)

Category: Multicast

Cite this

Copy

Taku NOGUCHI, Miki YAMAMOTO, "Construction of a Robust Multicast Tree for Application-Level Multicast" in IEICE TRANSACTIONS on Communications, vol. E88-B, no. 12, pp. 4427-4434, December 2005, doi: 10.1093/ietcom/e88-b.12.4427.
Abstract: Application-level multicast (ALM) is a feasible alternative to IP multicast. In ALM, multicast related features, such as group membership management, multicast routing and packet replication, are implemented at end-hosts instead of routers. A multicast distribution tree is constructed in the application layer, so all nodes in this tree are end-hosts. Packet transmission between end-hosts uses conventional IP unicast service. Therefore, all end-hosts can enjoy multicast communications without IP multicast service. However, ALM has a serious problem that the multicast distribution tree is intrinsically fragile and an end-host failure causes tree partitions. In this paper, to deal with this problem, we propose a new tree construction protocol which makes outdegrees of intermediate nodes be balanced. The degree-balanced distribution tree can reduce the average number of nodes decoupled by tree partitions. To investigate performance of our protocol, it is compared with an existing ALM protocol. Our simulation results show that our protocol outperforms the existing protocol from the viewpoints of robustness, loss probability and receiver-perceived delay.
URL: https://globals.ieice.org/en_transactions/communications/10.1093/ietcom/e88-b.12.4427/_p

Copy

@ARTICLE{e88-b_12_4427,
author={Taku NOGUCHI, Miki YAMAMOTO, },
journal={IEICE TRANSACTIONS on Communications},
title={Construction of a Robust Multicast Tree for Application-Level Multicast},
year={2005},
volume={E88-B},
number={12},
pages={4427-4434},
abstract={Application-level multicast (ALM) is a feasible alternative to IP multicast. In ALM, multicast related features, such as group membership management, multicast routing and packet replication, are implemented at end-hosts instead of routers. A multicast distribution tree is constructed in the application layer, so all nodes in this tree are end-hosts. Packet transmission between end-hosts uses conventional IP unicast service. Therefore, all end-hosts can enjoy multicast communications without IP multicast service. However, ALM has a serious problem that the multicast distribution tree is intrinsically fragile and an end-host failure causes tree partitions. In this paper, to deal with this problem, we propose a new tree construction protocol which makes outdegrees of intermediate nodes be balanced. The degree-balanced distribution tree can reduce the average number of nodes decoupled by tree partitions. To investigate performance of our protocol, it is compared with an existing ALM protocol. Our simulation results show that our protocol outperforms the existing protocol from the viewpoints of robustness, loss probability and receiver-perceived delay.},
keywords={},
doi={10.1093/ietcom/e88-b.12.4427},
ISSN={},
month={December},}

Copy

TY - JOUR
TI - Construction of a Robust Multicast Tree for Application-Level Multicast
T2 - IEICE TRANSACTIONS on Communications
SP - 4427
EP - 4434
AU - Taku NOGUCHI
AU - Miki YAMAMOTO
PY - 2005
DO - 10.1093/ietcom/e88-b.12.4427
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E88-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2005
AB - Application-level multicast (ALM) is a feasible alternative to IP multicast. In ALM, multicast related features, such as group membership management, multicast routing and packet replication, are implemented at end-hosts instead of routers. A multicast distribution tree is constructed in the application layer, so all nodes in this tree are end-hosts. Packet transmission between end-hosts uses conventional IP unicast service. Therefore, all end-hosts can enjoy multicast communications without IP multicast service. However, ALM has a serious problem that the multicast distribution tree is intrinsically fragile and an end-host failure causes tree partitions. In this paper, to deal with this problem, we propose a new tree construction protocol which makes outdegrees of intermediate nodes be balanced. The degree-balanced distribution tree can reduce the average number of nodes decoupled by tree partitions. To investigate performance of our protocol, it is compared with an existing ALM protocol. Our simulation results show that our protocol outperforms the existing protocol from the viewpoints of robustness, loss probability and receiver-perceived delay.
ER -