Optimization-Based Linear Network Coding for General Connections of Continuous Flows

For general connections, the problem of finding network codes and optimizing resources for those codes is intrinsically difficult and a little is known about its complexity. Most of the existing methods for identifying solutions rely on very restricted classes of network codes in terms of the number of flows allowed to be coded together, and are not entirely distributed. In this paper, we consider a new method for constructing linear network codes for general connections of continuous flows to minimize the total cost of the edge use based on mixing. We first formulate the minimum-cost network coding design problem. To solve the optimization problem, we propose two equivalent alternative formulations with discrete mixing and continuous mixing, respectively, and develop distributed algorithms to solve them. Our approach fairly allows general coding across flows and guarantees no greater cost than existing solutions. Numerical results illustrate the performance of our approach.