On Multicast Communications with Minimum Resources

详细信息    查看全文

• 作者：Young-Cheol Bang ; SungTaek Chung ; Moonseong Kim ; Seong-Soon Joo
• 刊名：Lecture Notes in Computer Science
• 出版年：2005
• 出版时间：2005
• 年：2005
• 卷：3726
• 期：1
• 页码：p.4
• 全文大小：782 KB
• 刊物类别：Computer Science
• 刊物主题：Artificial Intelligence and Robotics
  Computer Communication Networks
  Software Engineering
  Data Encryption
  Database Management
  Computation by Abstract Devices
  Algorithm Analysis and Problem Complexity
  
• 出版者：Springer Berlin / Heidelberg
• ISSN：1611-3349

文摘

We have developed and evaluated an efficient heuristic algorithm to construct a multicast tree with the minimum cost. Our algorithm uses multiple candidate paths to select a path from source to each destination, and works on directed asymmetric networks. We also show that our proposed algorithm have a perform gain in terms of tree cost for real life networks over existing algorithm. The time complexity of our algorithm is O( D (m + nlog n) ) for a m-arc n-node network with D number of members in the multicast group, and is comparable to well-known algorithm, TM [13], for a multicast tree construction in terms of the time-complexity. We have performed empirical evaluation that compares our algorithms with the others on large networks.