期刊文献+

基于域饱和度的二维应用层多播模型

Two-dimensional Model Based on Region Saturation for Application Layer Multicast
下载PDF
导出
摘要 提出了一种基于域饱和度的二维应用层多播模型TDRS,该模型以域为基础,具有控制开销小、高效、分布式的结构。重点阐述了多播节点的加入和退出过程,首先以域饱和度为基础平衡选取目标域,接着以DCMR算法二次择优产生域内路径,最终达到ALM拓扑结构的整体优化。仿真结果表明TDRS模型能有效减少网络传输冗余,混乱情况下自愈性强、传输数据速度快,具有低延迟、低链路压力的特点,同时解决了现实网络中部分节点服务能力限制的问题,增强了系统的实用性和扩展性。 This paper proposed a two-dimensional model based on region saturation for ALM. The model has many merits, such as little control overhead, high efficiency, distributed structure. This paper focused on nodes joining and departure procedures, so region saturation is defined as the standard for the elementary selection, and DCMR algorithm for further selection, this achieves an entire optimization of ALM topology. The simulation results show that the model is an efficient mechanism to reduce traffic redundancy in the network, transmit data with high speed and resume itself in a disordered situation. It has a good match to the underlying physical network such that the link stress and the end-to-end delay can be effectively reduced. In the mean time, real-life network constraints can be handled.
出处 《计算机科学》 CSCD 北大核心 2009年第3期69-73,共5页 Computer Science
关键词 应用层多播 域饱和度 二维 度约束 Application layer multicast (ALM),Region saturation,Two dimension,Degree constraints
  • 相关文献

参考文献10

  • 1Francis P. Yoid: Extending the Multicast Internet Architecture. White paper, http://www. aciri. org/yoid/, 1999
  • 2Chu Y-H,Rao S G,Zhang H. A Case for End System Multicast //Proceedings of ACM SIGMETRICS. 2002,20(8):1456-1471
  • 3Banerjee S, Bhattacharjee B, Kommareddy C. Scalable Application Layer Multicast // Proceedings of ACM Sigcomm. Aug. 2002:205-217
  • 4Prim R C. Shortest Connection Networks and Some Generalizations [J]. Bell System Technical Journal,1957,36:1389-1401
  • 5Kruskal B. On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem[J]//Proc. of the American Mathematics Society, 1956,7 (1) : 48-50
  • 6Jin Xing, Wong Wan- Ching, Chan S- H G. High Performance Switching and Routing(HPSR)//2005 Workshop. May 2005 : 432-436
  • 7Zegura K C,Bhattacharjee S. How to Model an Internetwork// Proceedings of IEEE Infocom. 1996
  • 8Broash E, Shavitt Y. Approximation and Heuristic Algorithms for Minimum Delay Application-Layer Multicast Trees // Proc. of IEEE INFOCOM 2004. March 2004
  • 9Shi S Y, Turner J S. Multicast Routing and Bandwidth Dimensioning in Overlay Networks. IEEE Journal on Selected Areas in Communications,2002,20(8) : 1444- 455
  • 10Tan S W,Waters G. Building low delay application layer multicast trees//Merabti M, Pereira R, eds. Proc. of the 4th Annual PostGraduate Symp. The Convergence of Telecommunications, Networking & Broadcasting,EPSRC. 2003 : 27-32

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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