RESEARCH ON NETWORK ENCODING NODES REDUCTION ALGORITHM

摘要：

Based on the Ford-Fulkerson labeling algorithm which can realize network maximum flow, combining with edge split path thought, and through the new understanding of reused link and super critical nodes, an improved algorithm of reducing the network encoding nodes is proposed in this paper. The algorithm can not only reduce the network encoding nodes to know the necessary encoding nodes, but also determine the information transmitted on the network links using simple linear coding method at coding nodes. Simulation shows that, the proposed algorithm reduces the number of encoding nodes obviously while achieving the multicast maximum flow.

关键词： Encoding nodes Maximum flow Reused link Super critical nodes

作者: LIAN-XIANG ZHU YAN-YAN ZHU

作者单位: Chongqing Key Laboratory of Signal and Information Processing,CQUPT Chongqing, 400065, China

会议类型: 国际会议

会议名称: 3rd International Conference on Mechanical and Electrical Technology(ICMET2011) (2011第三届机械与电气技术国际会议)

会议地点: 大连

会议语种:英文

页码: 35-39

在线出版日期: 2011-08-26（万方平台首次上网日期，不代表论文的发表时间）