期刊文献+

面向战场信息分发的应用层可靠组播策略 被引量:3

Research on Strategy of Reliable Application-layer Multicast for Battlefield Information Dissemination
在线阅读 下载PDF
导出
摘要 应用层组播是一种实现网络中心战环境下一对多战场信息分发的有效途径,在对网络中心战环境下应用层组播研究面临的各类问题进行分析的基础上,重点对组播可靠性问题进行了研究,提出了一种可靠组播策略,通过反压技术和备份缓存的方式来保证端对端传送的可靠性,对组播树的错误恢复算法进行了设计,并提供了一种随机路由的辅助策略来改善可靠组播传送的效率,从而满足战场信息分发的高效和高可靠性需求。 Application-layer multicast is an efficient approach for one-to-many battlefield information dissemination in network-centric warfare. In this paper, reliability of multicast is emphasized based on analysis of the problems in the application-layer multicast research. A reliable multicast strategy is proposed which achieves reliable end-to-end transfer by back-pressure and backup buffer. A recovery algorithm for multicast tree error is designed. To improve multicast efficiency, a random routing strategy is provided. This research will meet the need of high reliability and efficiency of battlefield information dissemination.
出处 《火力与指挥控制》 CSCD 北大核心 2008年第5期18-21,共4页 Fire Control & Command Control
基金 国家"863"高技术研究发展计划基金资助项目(2002AA131010和2002AA134010)
关键词 网络中心战 应用层组播 组播树 可靠性 network-centric warfare, application-layer multicast, multicast tree, reliability
作者简介 刘震(1976-),男,湖南长沙人,博士,主要研究方向:信息管理,P2P,智能决策支持技术。
  • 相关文献

参考文献8

  • 1Chu U H, Sanjay G R, Hui Z. A Case for End System Multicast[M]. ACM SIGMETRICS,2000.
  • 2Pendarakis D, Shi S D, Verma, et al. ALMI: An Application Level Multicast Infrastructure [A]. Proc. of the 3rd Usenix Symp. on Internet Technologies and Sys[C]. (USITS 2001),2001.
  • 3Banerjee S, Bhattacharjee B, Kommareddy C. Scalable Application Layer Multicast[A]. Proc. of ACM SIGCOMM[C]. 2002.
  • 4Jannotti J, Gifford D K, Johnson K L. Overcast: Reliable Multicasting with an Overlay Network[A]. Proc. of the 4th Usenix Syrup. on Operating Sys. Design and Implementation[C]. 2000.
  • 5Castro M, Druschel P, Kermarrec A M, et al. SCRIBE : A Large-scale and Decentralized Application-level Multicast Infrastructure[J]. IEEE Jrnl. on Selected Areas in Communications (JSAC ), Sp. Issue on Network Support for Group Communication 20,2002.
  • 6Tan S W, Waters G, Crawford J.A Survey and Performance Evaluation of Scalable Tree-based Application Layer Multicast Protocol[R]. Technical Report ,Canterbury : University of Kent, 2003 : 9-3.
  • 7Shi S Y, Turner J S. Multicast Routing and Bandwidth Dimensioning in Overlay Networks [J]. IEEE Journal on Selected Areas in Communications, 2002,20(8) : 1444-1455.
  • 8曹佳,鲁士文.应用层组播的最小延迟生成树算法[J].软件学报,2005,16(10):1766-1773. 被引量:37

二级参考文献10

  • 1Broash E, Shavitt Y. Approximation and heuristic algorithms for minimum delay application-layer multicast trees. In: INFOCOM 2004, the 23rd Annual Joint Conf. of the IEEE Computer and Communications Societies. Vol 4, 2004. 2697-2707. http:∥www.ieee-infocom.org/2004/Papers/56_ 1 .PDF.
  • 2Shi SY, Turner JS. Multicast routing and bandwidth dimensioning in overlay networks. IEEE Journal on Selected Areas in Communications, 2002,20(8):1444-1455..
  • 3Banerjee S, Kommareddy C, Kar K, Bhattacharjee B, Khuller S. Construction of an efficient overlay multicast infrastructure for real-time applications. In: INFOCOM 2003, the 22nd Annual Joint Conf. of the IEEE Computer and Communications Societies.Vol 2, 2003. 1521-1531. http:∥www.informtik.uni-trier.de/~ley/db/conf/infocom/infocom2003.html.
  • 4Tan SW, Waters G, Crawford J. A survey and performance evaluation of scalable tree-based application layer multicast protocol.Technical Report, No.9-03, Canterbury: University of Kent, 2003.
  • 5Salama HF, Reeves DS, Viniotis Y. The delay-constrained minimum spanning tree problem. In: Proc. of the 2nd IEEE Symp. on Computers and Communications. 1997.699-703. http:∥portal.acm.org/citation.cfm?id=845348.
  • 6Mokbel MF, El-Haweet WA, El-Derini MN. A delay-constrained shortest path algorithm for multicast routing in multimedia applications. In: Proc. of the IEEE Middle East Workshop on Networking. 1999. http:∥www-users.cs.umn.edu/~mokbel/Beriut99.pdf.
  • 7Jungnickel D. Graphs, Networks and Algorithms. Springer-Verlag, 1999. 120-123..
  • 8Elkin M, Kortsarz G. A combinatorial logarithmic approximation algorithm for the directed telephone broadcast problem. In: Proc.of the Annual ACM Symp. on Theory of Computing. Montreal, 2003. 438-447. htpp:∥www.crab.rutgers.edu/~guyk/pub/newbr/nabs.ps.
  • 9Tan SW, Waters G. Building low delay application layer multicast trees. In: Merabti M, Pereira R, eds. Proc. of the 4th Annual PostGraduate Symp.: The Convergence of Telecommunications, Networking & Broadcasting, EPSRC. 2003.27-32. http:∥www.cms.livj m.ac.uk/pgnet2003/submissions/Paper-05.pdf.
  • 10Riabov A, Liu Z, Zhang L. Overlay multicast trees of minimal delay. In: Proc. of the 24th Int'l Conf. on Distributed Computing Systems. 2004. 654-661. http:∥www.informatik.uni-trier.de/~ley/db/conf/icdcs/icdcs2004.html.

共引文献36

同被引文献26

  • 1王珩,聂敏,刘若奇,丁峰.信息分发模型研究[J].舰船电子工程,2008,28(6):6-9. 被引量:3
  • 2李军,黄绍君,龚光红.战术仿真系统中数据交互的实时性研究[J].系统仿真学报,2006,18(z2):381-382. 被引量:11
  • 3叶保留,李春洪,姚键,顾铁成,陈道蓄.应用层组播研究进展[J].计算机科学,2005,32(6):6-10. 被引量:13
  • 4徐超,张祖平.应用层组播协议仿真研究[J].计算机工程与应用,2006,42(1):112-114. 被引量:6
  • 5DavidAlberts,JohnGarstka(美)著,兰科研究中心译.网络中心行动的基本原理及其度量[M].北京:国防工业出版社,2007.
  • 6施荣.美国BMDS网络化作战核心系统C2BMC的发展[J].航天电子对抗,2007,23(1):1-4. 被引量:11
  • 7Henry S Kenyon. Missile Defense Command System on Target[ J]. Military Aerospace, 2007, 61 (5) : 17 -22.
  • 8U. S. Missile Defense Agency Staff. Integrating Missile Defenses[ J]. Military Space & Missile Forum, 2008, 3(2) :13-19.
  • 9Booz, Allen, Hamilton. A Statement of Operational Needs on the Operational Concept and Capabilities of the Ballistic Missile Defense System, Command and Control, Battle Management, and Communications (C^2BMC) Element [ R ]. U. S. Strategic Command, JFCC-IMD ,2006,6 : 1 -29.
  • 10MICHAEL J B, SHING M T, MIKLASKI M H, et al. Modeling and Simulation of System-of-Systems Timing Constraints with UML-RT and OMNeT + + [ C ]//IEEE International Workshop on Rapid System Prototyping Conference, 2004 : 1 -8.

引证文献3

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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