期刊文献+

一种改进的多播网络编码算法

Improved multicast network coding algorithm
下载PDF
导出
摘要 在多播网络通信中,网络编码的应用,实现了最大流最小割定理所决定的多播传输的最大理论传输容量。对这一问题,可采用线性multicast,线性broadcast,线性dispersion,以及generic等线性网络编码构造算法进行求解。但这些方法,计算复杂度较高。在研究generic线性网络编码算法的基础上,结合离散路由的使用,对其进行了改进,提出了一种改进的多播网络编码算法,并给出了算法的合理性证明。复杂度分析表明,该算法较generic线性网络编码算法,复杂度有显著的下降。 The application of network coding in the multicast communication network,which has achieved the maximum value of network traffic determined by the Max-flow and Min-cut theorem.The problem can be solved by linear network coding algorithms such as linear multicast, linear brodcast, linear dispersion as well as generic linear network coding algorithm. However,all of these methods have high degrees of computational complexity.Based on the generic linear network coding algorithm, and combined with the usage of discrete routing, a novel improved multicast network coding algorithm is proposed in this paper.The rationality of the algorithm has been proved.Complexity analysis indicates that, compared with generic algorithm,the algorithm in this paper reduces the computational complexity obviously.
出处 《计算机工程与应用》 CSCD 北大核心 2011年第15期116-118,共3页 Computer Engineering and Applications
基金 国家自然科学基金No.60832001/f0101~~
关键词 网络编码 多播 全局编码核向量 generic线性网络编码算法 network coding multicast the global encoding kernel vectors generic network coding algorithm
  • 相关文献

参考文献6

  • 1王静,刘景美,王新梅,袁荣亮,刘向阳.一种网络编码的多播路由算法[J].西安电子科技大学学报,2008,35(1):71-75. 被引量:9
  • 2Ahlswede R,Cai Ning,Li Y S,et al.Network information flow[J].IEEE Trans on Inform Theory,2000,46(4):1204-1216.
  • 3Yeung R W,Li S Y R,Cai N,et al.Network coding theory[M].[S.l.] :Now Publishers Inc,2006.
  • 4Li S Y R,Yeung R W,Cai N.Linear network coding[J].IEEE Trans Inf Theory,2003,49(2):371-381.
  • 5Koetter R,Medard M.An algebraic approach to network coding[J].IEEE/ACM Trans on Networking,2003,11 (5):782-795.
  • 6李擎,宋顶立,张双江,李哲,刘建光,王志良.两种改进的最优路径规划算法[J].北京科技大学学报,2005,27(3):367-370. 被引量:27

二级参考文献20

  • 1孟祥云.最短路径及其求法[J].唐山学院学报,2002,15(2):51-53. 被引量:1
  • 2段莉琼,朱建军,王庆社,马玲.改进的最短路径搜索A*算法的高效实现[J].海洋测绘,2004,24(5):20-22. 被引量:27
  • 3李擎,宋顶立,张双江,李哲,刘建光,王志良.两种改进的最优路径规划算法[J].北京科技大学学报,2005,27(3):367-370. 被引量:27
  • 4孙岳,杨远,王新梅.基于网络编码的多播网络故障恢复[J].西安电子科技大学学报,2007,34(1):122-125. 被引量:4
  • 5龚洁辉 白玲 高健美.最短路径算法的改进及其实现[J].解放军测绘学院学报,1998,15(2):23-23.
  • 6Frank Blischke and Bernd Hessing. Dynamic Route Guidence-Different Approaches to the System Concepts. Soc Automatic Eng, Inc, 1998
  • 7Lee J. Calculation of the shortest path sbyoptimal decomposition. IEEE Trans Syst Man Cybern, 1982(3): 410
  • 8Zhu Ying, Li Baochun, Guo Jiang. Multicast with Network Coding in Application-layer Overlay Networks[J]. IEEE Journal on Selected Areas in Communications, 2004, 22(1): 107-120.
  • 9Waxman B M. Routing of M ultipoint Connections[J]. IEEE Journal on Selected Areas in Communications, 1988, 6 (9) : 1 617-1 622.
  • 10Fang S C, Puthenpura S. Linear Optimization and Extensions: Theory and Algorithms[M]. Prentice Hall: Englewood Cliffs, 1993.

共引文献34

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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