Resource minimization in network coding by integer programming

초록

To overcome the multicast throughput limit inherent in network topology and resources, in network coding, intermediate routing nodes can perform algebraic operations for incoming packets and receiver node to recover data by solving linear system of equations. To design efficient network coding scheme one must minimize the size of the finite field where coding vectors are defined and the number of coding nodes. Previous research on minimizing coding node relies on graph decomposition and evolution algorithms based on max flow and nonsingular transfer matrices. In this paper, a binary multi-commodity network flow model is proposed to minimize the number of coding nodes. The proposed model captures multiple Steiner branching problem and min-cut requirements of network coding problem. The validity of the proposed model is tested with several random test instances. © 2015 ICIC International.

키워드