Research Article
A Network Coding Optimization Algorithm for Reducing Encoding Nodes
145 downloads
@INPROCEEDINGS{10.1007/978-3-030-00557-3_27, author={Limin Meng and Yangtianxiu Hu}, title={A Network Coding Optimization Algorithm for Reducing Encoding Nodes}, proceedings={Machine Learning and Intelligent Communications. Third International Conference, MLICOM 2018, Hangzhou, China, July 6-8, 2018, Proceedings}, proceedings_a={MLICOM}, year={2018}, month={10}, keywords={Network coding Encoding nodes The shortest path Max-flow Capacity summation}, doi={10.1007/978-3-030-00557-3_27} }- Limin Meng
Yangtianxiu Hu
Year: 2018
A Network Coding Optimization Algorithm for Reducing Encoding Nodes
MLICOM
Springer
DOI: 10.1007/978-3-030-00557-3_27
Abstract
Network coding can effectively improve the transmission efficiency of the network, but compared with the traditional forwarding nodes, the participation of network encoding nodes will bring resource consumption. In this paper, we propose an improved algorithm of the max-flow based on the shortest path, which combines the concept of path capacity summation to achieve the maximum flow of the network, and the shortest path guarantees the minimal number of encoding nodes. The simulation results based on random network show that this algorithm can effectively reduce the encoding nodes and the consumption of network resources on the basis of realizing the maximum flow of the network.
Copyright © 2018–2024 ICST
