D2MST: A Shared Tree Construction Algorithm for Interactive Multimedia Applications on Overlay Networks
Tein Yaw Chung · IEICE Transactions on Communications · 2005
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 2 MST) algorithm to build an any-to-any share tree for IMAs. D 2 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 2 MST can successfully generate a A-constraint MST in which a high percentage of nodes can interact within the bounded delay.