期刊文献+

计算机通信中的一个组播路由算法 被引量:5

A Multicast Routing Algorithm in Computer Communications
在线阅读 下载PDF
导出
摘要 在计算机通信的实际应用中,组播(multicasting)技术日益重要,但由于网络节点处理信息的能力不同,有些节点并不具备组播能力,为此该文用节点的度约束来表示每个节点所具备的组播能力,研究在网络节点具有不同组播能力的路由问题,提出了一种新的解决此问题的利用局部信息的组播路由算法。 : In computer communications ,the multicasting is increasingly important。Because the abilities of nodes differ from each other in processing informationsome nodes do not have multicasting ability.By using the degree of the node to represent its multicasting ability,the degree-constrained multicasting is dealt with and a new multicast routing algorithm is presentedwhich uses only local information。
出处 《计算机工程与应用》 CSCD 北大核心 2001年第7期37-38,41,共3页 Computer Engineering and Applications
基金 国家自然科学基金项目!(编号69972036)
关键词 组播 计算机通信 路由算法 数学模型 STEINER树 : Multicasting,Degree-constraint,Local information
  • 相关文献

参考文献1

  • 1Chung Sungjin,IEEE Globe Com'98,1054页

同被引文献46

  • 1WILLIAM R Parkhust 京京工作室(译).Cisco组播路由与交换技术[M].北京:机械工业出版社,1999.24-139.
  • 2[1]Xiaohua Jia. A Distributed Algorithm of Delay-Bounded Multicast Routing for Multimedia Applications in Wide Area Networks[J].IEEE/ACM TRANSACTIONS ON NETWORKING, VOL 6, NO.6, DECEMBER 1998:828-837.
  • 3[3]Pawel Winter. Steiner Problem in Networks:A Survey[J].Networks ,1987,17: 129-167.
  • 4[4]S. Raghavan, G. Manimaran, C.Siva Ram Murthy. A Rearrangeable Algorithm for the Construction of Delay-Constrained Hynamic Multicast Trees[J].IEEE/ACM Trans.on Networking,7(4) 1999: 514-529.
  • 5[5]Q. Zhu, M. Parsa, and J.Garcia-Luna-Aceves. A source-based algorithm for delay-constrained minimum-cost multicasting[J]. Proc.IEEE INFOCOM'95, 1995:377-385.
  • 6[6]Bauer and A.Varma. Distributed algorithms for multicast path set up in data networks[J].IEEE/ACM Trans. Networking, vol. 4,Apr. 1996:181-191.
  • 7[7]Fred Bauer. Multicast Routing in Point-to-Point Networks Under Constraints[D].Ph.D. Dissertation, June 1996.
  • 8M R Gray,D S Johnsom.Computer and Intractrability:A guide to the theory of NP-completeness[M].1979.
  • 9Kenneth L, Calvert, Ellen W, et al. Core Selection Methods for Multicast Routing[J]. Computer Communications and Networks, July 1995, 7: 638-642.
  • 10Raghavendra A D, Rai S. Multicast Routing in Internetworks Using Dynamic Core Based Trees[J]. Computers and Communications,1996, 3: 232-238.

引证文献5

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部