DocumentCode
3524824
Title
D2MST: a shared tree construction algorithm for interactive multimedia applications on overlay networks
Author
Chung, Teia-Yaw ; Wang, Yen-Din
Author_Institution
Dept. of Comput. Sci. Eng., Yuan-Ze Univ., Taoyuan
Volume
2
fYear
0
fDate
0-0 0
Firstpage
1219
Lastpage
1224
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 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
Keywords
Internet; delays; interactive systems; multicast communication; multimedia communication; trees (mathematics); D2MST algorithm; data transmission; degree constraint; delay degree constrained multicasting spanning tree algorithm; end-to-end transmission delay; interactive multimedia application; network gravity; overlay network; shared tree construction algorithm; Application software; Bandwidth; Computer science; Cost function; Delay; Digital multimedia broadcasting; Electronic mail; Gravity; Peer to peer computing; Spine;
fLanguage
English
Publisher
ieee
Conference_Titel
Advanced Communication Technology, 2005, ICACT 2005. The 7th International Conference on
Conference_Location
Phoenix Park
Type
conf
DOI
10.1109/ICACT.2005.246184
Filename
1463009
Link To Document