期刊文献+

一种拓扑感知的应用层组播方案 被引量:1

Topology-Aware Application Layer Multicast Scheme
下载PDF
导出
摘要 提出了一种具有拓扑感知能力的拓扑簇模型TCM(topology-aware clustering model),并在此基础上提出了一种有效的应用层组播方案TCMM(TCM-based multicast).TCMM能够将一些相近的节点组织在一个拓扑簇中,从而在一定程度上实现了数据包的本地传输,并能缓解不同加入顺序对转发树的不利影响.分析和实验结果表明,TCMM能够实现有效的聚簇,能够在不同的加入顺序下构造性能大体一致的转发树,并能在不同程度上改善其他一些组播性能指标. This paper proposes a topology-aware clustering model (called TCM). Furthermore, it proposes a TCM-based application layer multicast scheme (called TCMM). In TCMM, many nearby nodes are clustered, which localizes the transport of some nodes and alleviates the negative impact caused by different join sequences. Analysis and experiments show that TCMM can effectively group nearby nodes and build multicast trees with similar gross performance in different join orders. In addition, TCMM can improve some of other multicast performance in some degree.
出处 《软件学报》 EI CSCD 北大核心 2010年第8期2010-2022,共13页 Journal of Software
基金 国家重点基础研究发展计划(973)No.2003CB314807~~
关键词 应用层组播 转发树 聚簇 网络拓扑 覆盖网络 application layer multicast delivery tree clustering network topology overlay network
  • 相关文献

参考文献1

二级参考文献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

同被引文献1

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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