2MST can successfully generate a Δ-constraint MST in which a high percentage of nodes can interact within the bounded delay." />
For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
D2MST: A Shared Tree Construction Algorithm for Interactive Multimedia Applications on Overlay Networks
Tein-Yaw CHUNG Yen-Din WANG
IEICE TRANSACTIONS on Communications
Publication Date: 2005/10/01
Print ISSN: 0916-8516
Type of Manuscript: PAPER
interactive multimedia, delay bound, Δ-constraint, multicasting, shared tree, degree constraint, network gravity, overlay network,
Full Text: PDF(925.5KB)>>
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 (D2MST) algorithm to build an any-to-any share tree for IMAs. D2MST 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 D2MST can successfully generate a Δ-constraint MST in which a high percentage of nodes can interact within the bounded delay.