期刊文献+

基于树一轮结构的应用层组播模型研究

Research of Application Layer Multicast Model Based on Wheel-Tree Architecture
下载PDF
导出
摘要 在分析了树型和环型结构特点的基础上,该文提出一种基于树一轮拓扑结构的应用层组播模型。模型采用定域过程将距离近的节点集中在一起组成一个车轮结构,并利用近似平衡二叉树产生算法将轮心节点构建成一个时延最小的二叉树,以提高数据转发的效率。仿真结果表明,该模型具有较低的端到端延迟和链路压力以及较小的路径伸展率和控制开销,适用于大规模且实时性要求较高的应用层组播环境。 To combine the advantages of tree and ring architectures and improve the transmission efficiency of the Application Layer Multicast (ALM), this paper presents one new ALM model which constructs an overlay network based on Wheel-Tree. In this model, we use a localized process to gather those nodes with short distances together and form one wheel structure, so as to build a binary tree with the minimum delay to improve data forwarding efficiency. Simulation results show that this model could be used in the large-scale and real-time environments, and have a lower end-to-end delay and link stress, as well as smaller link stretch and control overhead.
作者 严英 YAN Ying (College of Computer, Nanjing University of Posts & Telecommunications, Nanjing 210003, China)
出处 《电脑知识与技术》 2011年第11期7653-7656,共4页 Computer Knowledge and Technology
关键词 应用层组播 树形结构 车轮结构 定域过程 节点性能 tree architecture wheel architecture localized process peer performance
  • 相关文献

参考文献5

二级参考文献32

  • 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.

共引文献40

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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