期刊文献+

基于最大流的网络编码组播路由算法 被引量:8

Maxflow-based Routing Algorithm for Network Coding Multicast
下载PDF
导出
摘要 网络编码是一种能显著提升组播传输性能的通信机制。在组播网络中部署和实施网络编码,必须建立传输路由和确定编码模式。对于后者,许多学者提出了有效的解决方法,而对于路由问题的研究则相对较少。由于网络编码自身固有的特点,基于网络编码的组播传输与传统的IP组播在建立传输路由的方式上有所不同。鉴于此,本文提出了一种基于最大流的网络编码组播路由算法,该算法与有的编码模式一起,能够构成完整的网络编码组播传输方案。仿真实验表明,与传统的IP组播相比,基于该算法的网络编码组播能够提升组播传输的性能。 Network coding is an effective way to improve the performance of multicast communication. There are two steps that should be realized while using network coding in multicast network: one of finding proper transmission paths from source to multi-receivers and the other of determining the encoding schem~ For the latter problem, a variety of methods have been proposed. However, little research about the former has been done in the present work. In this paper, we propose a detailed maxflow-based routing algorithm to build proper transmission paths in multicast when using network coding. The algorithm, together with the existing encoding scheme, such as random network coding, can construct a practical multicast system. Simulations based on the algorithm show that, for network coding multicast, performance in terms of achievable throughput has been improved significantly in comparison with the traditional IP multicast
出处 《计算机科学》 CSCD 北大核心 2008年第6期107-109,117,共4页 Computer Science
基金 国家自然科学基金资助项目(No60572049) 华为公司科技基金资助项目(NoYJCB2006049RE)
关键词 网络编码 组播 路由 最大流 Network coding, Multicast, Routing, Maxflow
  • 相关文献

参考文献10

  • 1Ahlswede R, Cai Ning, Li S-Y R, et al. Network information flow. IEEE Trans. Inform. Theory, 2000, 46(4):1204-1216
  • 2Li S-Y R, Yeung R W. Linear network coding. IEEE Trans. Inform. Theory, 2000
  • 3Gkantsidis C, Miller J, Rodriguez P. Anatomy of a P2P Content Distribution System with Network Coding//Proc. of the 5th International Workshop on Peer-to-Peer Systems (IPTPS 2006). 2006
  • 4Park J S, Lun D S, Soldo F,et al. Performance of Network Coding in Ad Hoc Networks // Military Communications Conference. 2006
  • 5Koeter R, Medard M. Beyond Routing.. An algebraic approach to network coding. In 2002 IEEE Infocom, 2002
  • 6Sanders P, Egner S, Tolhuizen L. Polynomial time algorithms for network information flow//Proc. 15th ACM Symposium on Parallel Algorithms and Architectures. 2003
  • 7Ho T, Leong B, Koetter R,et al. Byzantine modification detection in multicast networks using randomized network coding//IEEE International Symposium on Information Theory (ISIT 2004), June 2004
  • 8Zosin L, Khuller S. On directed Steiner trees // 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002). 2002: 59-63
  • 9Yeung R W, Li S-Y R, Cai N,et al. Network Coding Theory. Now Publishers Inc. , 2006
  • 10Waxman B M. Routing of multipoint connections. IEEE JSAC, 1988, 6(9): 1617-1622

同被引文献70

引证文献8

二级引证文献14

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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