An Improved Min-cost Max-flow Network Coding Algorithm
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.
Keywords
Network coding, Min-cost Max-flow, The shortest path, Encoding node
DOI
10.12783/dtcse/wcne2017/19876
10.12783/dtcse/wcne2017/19876
Refbacks
- There are currently no refbacks.