D<SUP>2</SUP>MST: A Shared Tree Construction Algorithm for Interactive Multimedia Applications on Overlay Networks

Tein-Yaw CHUNG; Yen-Din WANG

doi:10.1093/ietcom/e88-b.10.4023

D²MST: A Shared Tree Construction Algorithm for Interactive Multimedia Applications on Overlay Networks

Tein-Yaw CHUNG, Yen-Din WANG

Full Text Views

0

Share
Cite this

Summary :

Interactive multimedia applications (IMAs) require not only adequate bandwidth to support large volume data transmission but also bounded end-to-end transmission delay between end users. This study proposes a Delay and Degree constrained Multicasting Spanning Tree (D²MST) algorithm to build an any-to-any share tree for IMAs. D²MST comprises root selection and spanning tree generation. A weighting function is defined based on the novel concept of network center and gravity to choose the root of a share tree. From the root, a spanning tree is built by incrementally connecting nodes with larger "power" to the tree so that the degree constraint is satisfied. Simulation results show that D²MST can successfully generate a Δ-constraint MST in which a high percentage of nodes can interact within the bounded delay.

Publication: IEICE TRANSACTIONS on Communications Vol.E88-B No.10 pp.4023-4029

Publication Date: 2005/10/01

Publicized

Online ISSN

DOI: 10.1093/ietcom/e88-b.10.4023

Type of Manuscript: PAPER

Category: Network

Cite this

Copy

Tein-Yaw CHUNG, Yen-Din WANG, "D2MST: A Shared Tree Construction Algorithm for Interactive Multimedia Applications on Overlay Networks" in IEICE TRANSACTIONS on Communications, vol. E88-B, no. 10, pp. 4023-4029, October 2005, doi: 10.1093/ietcom/e88-b.10.4023.
Abstract: Interactive multimedia applications (IMAs) require not only adequate bandwidth to support large volume data transmission but also bounded end-to-end transmission delay between end users. This study proposes a Delay and Degree constrained Multicasting Spanning Tree (D²MST) algorithm to build an any-to-any share tree for IMAs. D²MST comprises root selection and spanning tree generation. A weighting function is defined based on the novel concept of network center and gravity to choose the root of a share tree. From the root, a spanning tree is built by incrementally connecting nodes with larger "power" to the tree so that the degree constraint is satisfied. Simulation results show that D²MST can successfully generate a Δ-constraint MST in which a high percentage of nodes can interact within the bounded delay.
URL: https://globals.ieice.org/en_transactions/communications/10.1093/ietcom/e88-b.10.4023/_p

Copy

@ARTICLE{e88-b_10_4023,
author={Tein-Yaw CHUNG, Yen-Din WANG, },
journal={IEICE TRANSACTIONS on Communications},
title={D2MST: A Shared Tree Construction Algorithm for Interactive Multimedia Applications on Overlay Networks},
year={2005},
volume={E88-B},
number={10},
pages={4023-4029},
abstract={Interactive multimedia applications (IMAs) require not only adequate bandwidth to support large volume data transmission but also bounded end-to-end transmission delay between end users. This study proposes a Delay and Degree constrained Multicasting Spanning Tree (D²MST) algorithm to build an any-to-any share tree for IMAs. D²MST comprises root selection and spanning tree generation. A weighting function is defined based on the novel concept of network center and gravity to choose the root of a share tree. From the root, a spanning tree is built by incrementally connecting nodes with larger "power" to the tree so that the degree constraint is satisfied. Simulation results show that D²MST can successfully generate a Δ-constraint MST in which a high percentage of nodes can interact within the bounded delay.},
keywords={},
doi={10.1093/ietcom/e88-b.10.4023},
ISSN={},
month={October},}

Copy

TY - JOUR
TI - D2MST: A Shared Tree Construction Algorithm for Interactive Multimedia Applications on Overlay Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 4023
EP - 4029
AU - Tein-Yaw CHUNG
AU - Yen-Din WANG
PY - 2005
DO - 10.1093/ietcom/e88-b.10.4023
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E88-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 2005
AB - Interactive multimedia applications (IMAs) require not only adequate bandwidth to support large volume data transmission but also bounded end-to-end transmission delay between end users. This study proposes a Delay and Degree constrained Multicasting Spanning Tree (D²MST) algorithm to build an any-to-any share tree for IMAs. D²MST comprises root selection and spanning tree generation. A weighting function is defined based on the novel concept of network center and gravity to choose the root of a share tree. From the root, a spanning tree is built by incrementally connecting nodes with larger "power" to the tree so that the degree constraint is satisfied. Simulation results show that D²MST can successfully generate a Δ-constraint MST in which a high percentage of nodes can interact within the bounded delay.
ER -