By Topic

D2MST: a shared tree construction algorithm for interactive multimedia applications on overlay networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Tein-Yaw Chung ; Dept. of Comput. Sci. Eng., Yuan-Ze Univ., Taoyuan ; Yen-Din Wang

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 study1 proposes a Delay and Degree constrained Multicasting Spanning Tree (D 2MST) algorithm to build an any-to-any share tree for IMAs. D 2MST 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 Deltaconstraint MST in which a high percentage of nodes can interact within the bounded delay

Published in:

Advanced Communication Technology, 2005, ICACT 2005. The 7th International Conference on  (Volume:2 )

Date of Conference:

0-0 0