An Improved Min-cost Max-flow Network Coding Algorithm
Year: 2018
Type: article
Abstract: Network coding can significantly improve the network communication performance; however, the introduction of encoding nodes will lead to more resource consumption. In this paper, we proposed an improved Min-cost Max-flow network coding algorithm to reduce resource consumption under the new principle of encoding node, which has been augmented until achieves the network maximum flow according to the min-cost path in the shortest paths from the source node to the sink node. Simulation results show that compared with the previous max-flow algorithm, this improved algorithm can not only reduce the total cost, but also reduce the encoding nodes and the network resource overhead when applied to the network coding.
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W2790051147