期刊文献+

基于多目标优化的多源组播网络编码的构造 被引量:2

Network coding construction for multi-source multicast connection based on multi-objective optimization
下载PDF
导出
摘要 在基于单目标优化构造网络编码的基础上,提出了基于多目标优化的网络编码的构造方法。把多源组播网络划分成多个单源组播网络,各单源组播网络的组播容量互相制约,为了使各单源组播网络的组播容量达到最大,采用粒子群优化算法进行子图划分,动态求解包含各子图组播容量的Pareto解集。用户可以优先考虑某个子图的组播容量,选择相应的解向量进行线性网络编码构造。仿真测试结果表明,本方法是可行的。 This paper proposed network coding construction method for multi-objective optimization based on single-objective optimization. Divided the network into several sub-graphs, which were single-source multicast networks and the multi-cast capacities of all single-source muhicast networks constrain each other. In order to maximize the muhi-cast capacity of each singlesource multicast network, adopted particle swarm optimization algorithm to divide the network into sub-graphs ,worked out the pareto solution set which contain the multi-cast capacity of each sub-graphs dynamicly. The user can take into account the multi-cast capacity of certain sub-graphs firstly, and choose the corresponding solution, then construct the linear network coding. Simulation and test results show that the proposed approach is feasible.
出处 《计算机应用研究》 CSCD 北大核心 2010年第2期668-671,674,共5页 Application Research of Computers
关键词 多源组播 多目标优化 粒子群优化算法 子图划分 PARETO解集 线性网络编码” multi-source muhicast multi-objective optimization particle swarm optimization algorithm partition of subgraphs Pareto solution set linear network coding
  • 相关文献

参考文献9

  • 1ELIAS P, FEINSTEIN A, SHANNON C. A note on the maximum flow through a network [ J ]. Information Trans on Information Theory,1956,2 (4) :117-119.
  • 2AHISWEDE R,CAI N,LI S-Y R,et ol. Network information flow[J]. IEEE Trans on Information Theory,2000,46(4) :1204-1216.
  • 3LI S Y R, YEUNG R W, CAIN. Linear network coding[J]. IEEE Trans on Information Theory,2003,49(2) : 371-381.
  • 4HO T, MEDARD M, KOETTER R, et al. A random linear network coding approach to multicast[ J]. IEEE Trans on Information Theory,2006,52 (10) :4413-4430.
  • 5JAGGI S, SANDERS P, CHOU A, et al. Polynomial time algorithms for multieast network code construction [ J]. IEEUTrans on Information Theroy,2005,51 (6) : 1973-1982.
  • 6YEUNG R W, LI S-Y R, CAI N. et al. Network coding theory[J]. Foundation and Trends in Communications and Information Theory,2005,2(4) :241-381.
  • 7蒲保兴,杨路明,王伟平,段桂华.多源组播连接的线性网络编码构造[J].小型微型计算机系统,2009,30(4):642-646. 被引量:3
  • 8毕荣山,杨霞,谭心舜,项曙光.基于动态Pareto解集的微粒群优化算法及其在多目标规划中的应用[J].计算机工程与应用,2004,40(32):85-88. 被引量:8
  • 9王兵山.离散数学[M].长沙:国防科技大学出版社,2004.263-281.

二级参考文献15

  • 1Ahlswede R, Cai N, Li S-R, et al. Network information flow [J]. IEEE Transactions on Information Theory, 2000, 46(4): 1204-1216.
  • 2Li S-Y R, Yeung R W, Cai N. Linear network coding[J]. IEEE Transactions on Information Theory, 2003, 49(2): 371-381.
  • 3Koetter R, Medard M. An algebraic approach network coding[J]. IEEE/ACM Transactions on Networking, 2003, 11 (5): 782-795.
  • 4Jaggi S, Sanders P, Chou A, et al. Polynomial time algorithms for multicast network code construction[J]. IEEE Transactions on Information Theroy, 2005,51 (6) : 1973-1982.
  • 5Ho T, Medard M, Koetter R, et al. A random linear network coding approach to multicast[J]. IEEE Transactions on Information Theory, 2006,62(10) :4413-4430.
  • 6Wang Beng-shan. Discrete mathematics[M]. Changsha: National University of Defenee Technology Press, 2004.
  • 7Yeung R W, Li S-Y, Cai N, et al. Network coding theory[J]. Foundation and Trends in Communications and Information Theory, 2005,2(4) :241-381.
  • 8Yan X J, Yang J, Zhang Z. An outer bound for multisource muhisink network coding with minimum cost consideration[J]. IEEE Transactions on Information Theory, 2006,52(6):2373- 2385.
  • 9Li Ming-qiang, Kou Ji-song, Lin Dan, et al. The foundation theory and application of the Genetic Algorithms[M]. Beijing: Science Press, 2002.
  • 10Hu Yun-quan, Guo Yao-huang. Operations research tutorial [M]. Beijing: Tsinghua University Press, 2007.

共引文献14

同被引文献4

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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