A Practical Network Coding and Routing Scheme based on Maximum Flow Combination
Network coding is a novel field of information theory and coding theory. It is a breakthrough over the traditional store-and-forward routing methods by allowing coding of two or more packets together. From an information flow aspect, multiple flows could be overlapped in a routing scheme. Hence, the theoretical upper bound of multicast capacity could be achieved by network coding. In this paper, a complete routing and coding scheme is constructed to realize the maximum multicast transportation task. In order to implement the scheme, the paths of multiple max-flows are determined Edges are divided into overlapped and normal type based on the merged max-flows. The transmitting data is represented using packets in a specific format.