期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

Internet高性能组播路由算法研究 被引量：1

A Survey of Internet High-Performance Multicast Routing Algorithm
下载PDF
导出
摘要 为了进一步适应 Internet 网络多媒体业务应用,高性能 Internet 组播路由算法已成为国内外网络研究热点和难点问题之一。分析了组播路由问题的定义和分类;论述了现有的 IP 层组播路由算法,主要包括五种类型:最多路径树算法、最小生成树算法、Steiner 树算法、单约束的 Steiner 树算法和多约束的 Steiner 树算法;并对它们进行比较和评价。最后提出了高性能 Internet 组播路由算法具有的特点和进一步的研究方向。 In order to accelerate the development of multimedia application in Internet, high-performance multicast routing algorithm has been discussed and is becoming an important and difficult research problem in Internet. First multicast routing is defined and categoried in the paper. Secondly, all important multicast routing algorithms are depicted and discussed according to different tree kinds： the SPT algorithm, the MST algorithm, the Steiner tree algorithm, the constrained Steiner tree algorithm and the multi-constrained Steiner tree algorithm. At the same time the paper evaluates and compares them with performance and computing complex. At last the character of high-performance mulricast routing algorithm and the future research work is proposed.
作者 周灵 孙亚民 卢先领
机构地区 南京理工大学计算机科学与技术系
出处 《计算机科学》 CSCD 北大核心 2006年第4期32-35,共4页 Computer Science
基金 湖南省教育厅科研基金(项目编号:05C059)
关键词 INTERNET 组播路由 高性能 综述 Internet,Multicast routing, High-performance, Survey
分类号 TP393.4 [自动化与计算机技术—计算机应用技术] TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献21

  • 1Holbrook H,Cain B. Source-Specific Muhieast for IP. draft-ietfssm-arch-06. Mar 07, 2005
  • 2Laxman H. Sahasrabuddhe, Biswanath Mukherjee, Multicast Routing Algorithms and Protocols: A Tutorial, IEEE Network,2000(1) : 92-102
  • 3Wang Bin, Hou J C, Multicast Routing and its Extension: Problems, Algorithms, Protocols [J], IEEE Network , January 2000(1):22-36
  • 4徐格 吴建平 徐明伟.高等计算机网络[M].北京:机械工业出版社,2003..
  • 5Dijkstra E. A Note on Two Problems in Connection with Graphs[J]. Numerical Mathematic, 1959(1): 269-271
  • 6Andrew S, Tanebbaurn. Computer Networks (Third Edition).Prentice Hall International, Inc. 1996
  • 7Zhang Baoxian, Mouftah H T. A Destination-Driven Shortest Path Tree Algrithrm In:Proc. of the 2002 IEEE Intq Conf. on communication, 2002(4) ;2258-2261
  • 8Fujinoke H,Christensen K J. The New Shortest Best Path Tree(SBPT) Algorithm for Dynamic Multicast Trees. In: Proc. of the 24th IEEE Int'l Conf. on Local Computer Networks, 1999. 204-210
  • 9Cormen T H, Leiserson C E, Rivest R L. Introduction to Algorithms. MIT Press, 1997
  • 10Kou L, Markowsky G, Berman L, A fast algorithm for Steiner trees in graphs. Acta Informatica, 1981,15(2) : 141-145

二级参考文献20

  • 1SUN Q, et al. An efficient delay-constrained multicast routing algorithm[J]. Journal of High-Speed Networks, 1998, 7(1).
  • 2LEE Y S, et al. A bandwidth and delay constrained minimum cost multicast routing algorithm[A]. ICCOIN-11 [C]. Taipei, 1997.
  • 3ERZIN I A. Polynomial algorithm for bandwidth-delay-constrained multicast routing problem [EB/OL]. http://citeseer.nj. nec.com/cachedpage/29205/2.
  • 4ROM C R, et al. Multi-path routing combined with resource reservation [A]. IEEE INFOCOM' 97[C]. Japan, 1997. 92-100.
  • 5SUN Q, LANGENDOERFER H. Efficient multicast muting for delay-sensitive applications[A]. Proc Second Workshop Protocols Multimedia Systems (PROMS'95)[C]. 1995.452-458.
  • 6SALAMA H F, REEVES D S, et al. Evaluation of multicast routing algorithms for real-time communication on high-speed networks[J]. IEEE JSAC, 1997, 15(3): 332-345.
  • 7SALAMA H. Multicast Routing for Real-Time Communication on High-Speed Networks[D]. North Carolina State University, 1996.
  • 8WIDYONO R. The Design and Evaluation of Routing Algorithms for Reeal-time Channels[R]. Technical report Tr-94-024, Tenet Group, Department of EECS, Uni of California at Berkeley, 1994.
  • 9WANG Z, et al. Quality-of-Service routing for supporting multimedia applications[J]. IEEE JSAC, 1996, 14(7): 1228-1234.
  • 10KOMPELLA V, et al. Multicast muting for multimedia communication[J]. IEEE/ACM Trans On Networking, 1993,1(3):286-292.

共引文献15

同被引文献7

  • 1白岩,刘大有.一种Agent通信中逻辑意外信息转换方法[J].计算机研究与发展,2007,44(3):427-433. 被引量：2
  • 2Estrin D,Postel J.Routing arbiter architectural[EB/OL].[2006-04-01]. http://www.isi.edu/R 1/Publications/.
  • 3Wakikawa R,Malinen JT.Global connectivity for IPv6 mobile Ad hoc networks[S].IETF Internet Draft,2002.
  • 4Obraczka K,Tsudik G,Viswanath K.Pushing the limits of multicast in Ad hoc networks[C]//Proc of the 21st Int'l Conf on Distributed Computing Systems(ICDCS),2001:719-722.
  • 5Labrou Y,Finin T.Agent communication languages:The current landscape[J].IEEE Intelligent Systems, 1999, 14(2) :45-52.
  • 6Studer R,Benjamins V R,Fensel D.Knowledge engineering,principles and methods[J].Data and Knowledge Engineering, 1998,25(122) : 161- 197.
  • 7Ehrig M,Sure Y.Ontology mapping-an integrated approach[C]//Proc of the 1st ESWS,Leeture Notes in Computer Seience.[S.l.]:Springer Verlag, 2004 ( 1 ) : 76-91.

引证文献1

计算机科学
2006年 第4期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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