期刊文献+

基于网络编码的组播率与编码节点数的平衡 被引量:1

Tradeoff between multicast rate and number of coding nodes based on network coding
下载PDF
导出
摘要 为探究单源组播网络编码的组播率与最少编码节点数之间的关系,利用线性网络编码的导出与扩展技术,对两者间的关系进行了理论分析和推导,得出了"最少编码节点数随组播率单调递增"的结论。构造了一个多目标优化模型用于精确地描述两者间的数量关系。为求解这个多目标优化模型,设计出能搜索所有可行编码方案的策略。运用该策略,并结合NSGA-II,提出了求解该模型的算法。在需要兼顾两者平衡的情况下,模型的解为确定编码方案提供了选择依据。所提算法不仅能搜索出整个Pareto集,而且能在指定可行组播率区域的前提下,以较小的运算代价得出相应的部分Pareto集。仿真结果验证了理论分析的结论,表明了所提算法的可行性和有效性。 Based on single-source multicast network coding, in order to explore the relationship between multicast rate and the number of minimal needed coding nodes, by employing the technique of generation and extension of linear network coding, theoretical analysis and formula derivation of the relationship were given. It is concluded that the number of the minimal needed coding nodes monotonously increases with the increasing of multicast rate. A multi-objective optimization model was constructed, which accurately described the quantitative relationship between them. For the sake of solving this model, a search strategy was derived to search all feasible coding schemes. By combining the search strategy with NSGA-II,an algorithm for solving this model was presented. In the case of being required to consider the tradeoff between them, the solution of the model is the basis of choice for determining network coding scheme. The proposed algorithm not only can search whole Pareto set, but also search part Pareto set related with certain feasible multicast rate region given by user with less search cost. The simulation results verify the conclusion of theoretical analysis, and indicate that the proposed algorithm is feasible and efficient.
出处 《计算机应用》 CSCD 北大核心 2015年第4期929-933,共5页 journal of Computer Applications
基金 湖南省教育厅重点科研项目(11A111 12A068) 湖南省科技计划项目(2012FJ3108)
关键词 单源组播 随机线性网络编码 组播率 最少编码节点数 多目标优化 single-source multicast random linear network coding multicast rate minimum coding node number multi-objective optimization
  • 相关文献

参考文献16

  • 1AHLSWEDE R, CAI N, LI S R Y, et al. Network information flow [ J]. IEEE Transactions on Information Theory, 2000, 46(4) : 1204 -1216.
  • 2杨林,郑刚,胡晓惠.网络编码的研究进展[J].计算机研究与发展,2008,45(3):400-407. 被引量:47
  • 3LI S Y R, YEUNG R W, CAIN. Linear network coding[ J]. IEEE Transactions on Information Theory, 2003, 49(2) : 371 - 381.
  • 4KOETYER R, MEDARD M. An algebraic approach to network cod- ing[ J]. IEEE/ACM Transactions on Networking, 2003, 11 (5):782 - 795.
  • 5WANG M, LIB. How practical is network coding? [ C]// IWQoS 2006: Proceedings of the 14th IEEE International Workshop on Quality of Service. Piscataway: IEEE Press, 2006:274 -278.
  • 6蒲保兴,王伟平.线性网络编码运算代价的估算与分析[J].通信学报,2011,32(5):47-55. 被引量:13
  • 7LANGBERG M, SPINTSON A, BRUCK J. The encoding complexi- ty of network coding[ J[. IEEE Transactions on Information Theory, 2006, 52(6) : 2386 -2397.
  • 8LANGBERG M, SPINTSON A, BRUCK J. Network coding: a compu- tational perspective [ J ]. IEEE Transaction Information Theory, 2009, 55(1): 147-157.
  • 9KIM M, AHN C W, MEDARD M, et al. On minimizing network coding resources: an evolutionary approach[ C]//INFOCOM 2007: Proceedings of the 26th IEEE International Conference on Computer Communications. Piscataway: IEEE Press, 2006:1991 - 1999.
  • 10MINKYU K, MEDARD M, AGGARWAL V, et al. Evolutionary approaches to minimizing network coding resources [ C]// INFO- COM 2007: Proceedings of the 26th IEEE International Conference on Computer Communications. Piscataway: IEEE Press, 2007: 1991 - 1999.

二级参考文献102

  • 1刘亚杰,窦文华.基于网络编码的P2P流媒体[J].计算机工程与科学,2006,28(9):33-34. 被引量:10
  • 2马冠骏,许胤龙,林明宏,宣颖.基于网络编码的P2P内容分发性能分析[J].中国科学技术大学学报,2006,36(11):1237-1240. 被引量:14
  • 3石川,李清勇,史忠植.一种快速的基于占优树的多目标进化算法[J].软件学报,2007,18(3):505-516. 被引量:14
  • 4王兵山.离散数学[M].长沙:国防科技大学出版社,2004.263-281.
  • 5Yeung R W, Li S-Y R, and Cai N, et al.. Network Coding Theory [M]. Hanover: NOW Publishers Inc, 2006: 12-18.
  • 6Ahlswede R, Cai N, Li S-Y R, and Yeung R W. Network information flow[J]. IEEE Transactions on Information Theory, 2000, 46(4): 1204-1216.
  • 7Kim M, Lima L, Zhao F, Barros J, and Medard M, et al.. On counteracting Byzantine attacks in network coded peer-to-peer networks[J]. IEEE Journal on Selected Areas in Communications: Special Issue on Mission- Critical Infrastructure, 2010, 28(5): 692-702.
  • 8Fragouli C and Soljanin E. Information flow decomposition for network coding [J]. IEEE Transactions on Information Theory, 2006, 52(3): 829-848.
  • 9Langberg M, Sprintson A, and Bruck J. The encoding complexity of network coding[J]. IEEE Transactions on Information Theory, 2006, 52(6): 2386-2397.
  • 10Bhattad K, Ratnakar N, and Koetter R. Minimal network coding for multicast[C]. IEEE International Symposium on Information Theory. Melbourne Australia: IEEE Communication Society, 2005: 1730-1734.

共引文献111

同被引文献15

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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