D^2MST : A Shared Tree Construction Algorithm for Interactive Multimedia Applications on Overlay Networks(Network)

スポンサーリンク

概要

• 論文の詳細を見る

• 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^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 D^2MST can successfully generate a Δ-constraint MST in which a high percentage of nodes can interact within the bounded delay.

• 社団法人電子情報通信学会の論文
• 2005-10-01

著者

• CHUNG Tein-Yaw

  Department of Computer Engineering and Science, Yuan Ze University

• Chung Tein-yaw

  Department Of Computer Science And Engineering Yuan Ze University

• Chung Tein-yaw

  Department Of Computer Engineering And Science Yuan Ze University

• WANG Yen-Din

  Department of Computer Science and Engineering, Yuan Ze University

• Wang Yen-din

  Department Of Computer Science And Engineering Yuan Ze University

関連論文

• A Novel Capacity Analysis for Wireless Backhaul Mesh Networks
• S^3 : Smart Session Selection for Voice Communications in Next Generation Wireless Network
• QMNF: QoS Multicast Routing Protocol Using N-Hop Dominating Flooding Approach on Programmable Network(Internet Technology VI)
• D^2MST : A Shared Tree Construction Algorithm for Interactive Multimedia Applications on Overlay Networks(Network)
• A Cross Layer Perceptual Speech Quality Based Wireless VoIP Service

スポンサーリンク