期刊文献+

计算机网络中的多播路由问题 被引量:5

Multicast routing problem in computer networks
下载PDF
导出
摘要 在计算机网络中,多播是目前研究最多、应用最广的连接方式。就目前存在的多播路由算法及路由协议进行了分析与总结,给出了解决多播问题的一般方法,提出了在光网络中推行多播的必要性。 In computer networks, multicasting is becoming increasingly important. The present multicast routing algorithm and protocol are summarized and analysed. The method of solving multicast is given as well. Finally, the necessity of multicast is introduced in optical networks.
出处 《计算机工程与设计》 CSCD 2004年第7期1056-1058,共3页 Computer Engineering and Design
基金 国家自然科学基金项目(69972036) 陕西省自然科学基金项目(2001SL05)。
关键词 计算机网络 多播路由问题 QOS 协议 多播树 光网络 multicast routing QoS protocol multicast tree
  • 相关文献

参考文献11

  • 1Hwang F K.Steiner tree problems [J]. Networks, 1992, 22(1):55-89.
  • 2Dalal Y K. Reverse path forwarding of broadcast packets [J].Commn ACM, 1978,21 (12).
  • 3Deering S. Multicast routing in datagram internetworks and extended LANs[J].ACM Trans on Comp Syst, 1990,(5):85-111.
  • 4Wall D W. Mechanisms for broadcast and selective broadcast [D]. Stanford University, 1980.
  • 5Thaler D G. Distributed center-location algorithms[J].IEEE J on Sel Areas in Commun, 1997,15(3):291-303.
  • 6Waxman B M. Routing of multipoint connections[J].IEEE J on Selected Areas in Communications, 1998, 6(9): 1617-1622.
  • 7Kadinire J, Knight G. Comparison of dyna-mic multicast routing algorithms for wide-area packet switched network[C].IEEE INFCOM'95,Boston,IEEE, 1995,212-219.
  • 8Mehrdad Parsa. An iterative algorithms for delay-constrained minimun-cost multicast[J].IEEE/ACM Trans networking, 1998,(6):461-474.
  • 9Gianluigi Alai.Ajoy dattajerry derby and james laewrence faulttolerant hierachical routing[C]. Proceeding of the 1997 IEEE International Performance Computer&Communications Conference, 1977. 159-165.
  • 10Jochen Behrens, Garcia-Luna-Aceves J J. A loop-free routing protocal for large-scale internets using distance vectors[J].Computer Communications, 1998,(21): 147-161.

同被引文献48

引证文献5

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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