期刊文献+

IP编码网络及其优化算法

IP coding network and optimization algorithm
原文传递
导出
摘要 为了克服当前IP网络的带宽瓶颈问题,提出了一种基于网络编码的IP网络通信机制—IP编码网络。该文讨论了网络节点上包的代数运算与路由协议的结合方式,提出了IP编码网络中单、组播通信的实现方法。在此基础上,对应于现有最短路径、最小代价组播树的网络优化问题,提出了一种基于遗传算法的IP编码网络优化算法。该算法为单播和组播会话构造一个在最大流约束下通信代价优化的编码子网。算法的模拟实验结果表明对任意的单播和多源组播通信,都可以在有限的计算代价和计算时间内生成通信子网,有效减少了IP编码网络的编码开销和通信代价。该文的研究工作为网络编码的应用作了有益的实践探索。 A communication mechanism based on network coding, an IP coding network., was developed for current IP networks to relieve bandwidth bottlenecks. This paper presents algebraic models of the packets and routing protocols and designs of communication models for both unicast and multicast communications in IP coding networks. A genetic optimization algorithm was used to reduce the computations and bandwidth, existing optimization methods for the shortest path and minimum-cost multicast tree. The algorithm construct a packet coding sub-network for any unicast or multicast session for the max flow constraint. Simulations show a noticeable decrease in coding overhead and bandwidth consumption in the sub-network constructed at acceptable computation cost and time for any unicast or multi source muhicast communication.
出处 《清华大学学报(自然科学版)》 EI CAS CSCD 北大核心 2008年第10期1683-1687,共5页 Journal of Tsinghua University(Science and Technology)
基金 国家自然科学基金资助项目(60503053) 国家"八六三"高技术项目(2006AA01Z209) 国家"九七三"重点基础研究基金项目(2003CB314805)
关键词 IP编码网络 网络编码 遗传算法 单播 最小代价组播 IP coding network network coding genetic algorithm unicast minimum-cost muhicast
  • 相关文献

参考文献17

  • 1Ahlswede R, Cai N, Li S Y, et al. Network information flow [J]. IEEE Trans Information Theory, 2000, 46(4): 1204 - 1216.
  • 2Fragouli C, Le Boudec J Y, Widmer J. Network coding: An instant primer[EB/OL]. (2005). http: //infoscience. epfl. ch.
  • 3Koetter R, Medard M. An algebraic approach to network coding[J]. IEEE/ACM Trans Networking, 2003, 11(5) : 782 - 795.
  • 4Ho T, Medard M, Shi J, et al. On randomized network coding[C]// Proc Allerton Conference on Communication, Control and Computing. IEEE Press, 2003.
  • 5Chou P A, Wu Y, Jain K. Practical network coding[C] // Proc Allerton Conference on Communication. Control and Computing. IEEE Press, 2003.
  • 6MacKay D J C. Fountain codes[C] // IEE Proc Communication. IEE Press, 2005:1062 - 1068.
  • 7Lun D S, Medard M, Ho T, et al. Network coding with a cost criterion [C]// Proc Int'l Symp Information Theory and its Applications. IEEE Press, 2004.
  • 8Lun D S, Ratnakar N, Koetter R, et al. Achieving minimum cost multicast: A decentralized approach based on network coding[C]// Proc INFOCOM 2005. IEEE Press, 2005:1607 - 1617.
  • 9Kim M, Ahn C W, Medard M, et al. On minimizing network coding resources: An evolutionary approach[C] // Second Workshop on Network Coding, Theory and Applications (NetCod). Boston, MA, 2006.
  • 10Gen M, Lin L. Multi-objective hybrid genetic algorithm for bicriteria network design problem[J]. Complexity International, 2005, 11(11) : 73- 83.

二级参考文献34

  • 1Magoni D, Pansiot JJ. Evaluation of Internet topology generators by power law and distance indicators. In: Proc. of the IEEE ICON 2002. Singapore: IEEE, 2002. 401-406.
  • 2Floyd S, Paxson V. Difficulties in simulating the Internet. IEEE/ACM Trans. on Networking, 2001,9(4):392-403.
  • 3Zheng H. Internet worm research [Ph.D. Thesis]. Tianjin: Nankai University, 2003 (in Chinese with English abstract).
  • 4Chalmers RC, Almeroth KC. On the topology of multicast trees. IEEE/ACM Trans. on Networking, 2003,11(1):153-165.
  • 5NMS Home Page. http://www.darpa.mil/ipto/programs/nms/index.htm
  • 6Waxman BM. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications, 1988,6(9):1617-1622.
  • 7Doar MB. A better model for generating test networks. In: Proc. of the GLOBECOM'96. London: IEEE, 1996. 86-93.
  • 8Zegura EW, Calvert KL, Donahoo MJ. A quantitative comparison of graph-based models for Internet topology. IEEE/ACM Trans. on Networking, 1997,5(6):770-783.
  • 9Faloutsos M, Faloutsos P, Faloutsos C. On power-law relationships of the Internet topology. ACM SIGCOMM Computer Communication Review, 1999,29(4):251-262.
  • 10Palmer CR, Steffan JG. Generating network topologies that obey power laws. In: Proc. of the GLOBECOM 2000, Vol 1. San Francisco: IEEE, 2000. 434 -438.

共引文献502

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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