Output Forms of Packets in a Multicast Session Using Network Coding With R Flow
José Duván Márquez Díaz, Carolina A. Salcedo · IEEE Access · 2019
A one-session multicast network, on which a coding scheme with Network Coding is defined, was implemented with a maximum common flow of r-packets arriving simultaneously at |T| sink nodes. Determining how to order the r-packets that emerge from the source node s through their output n-links, constitutes a combinatorial problem. In this work, the set of all the possible output configurations is constructed, where each configuration is a vector of packets tags of length equal to n. Each tag has a length equal to r. Through a combinatorial algorithm on the set of possible output configurations, a path is carried out on the graph representing the one-session multicast network. The path is based on a topological ordering of the multicast graph that allowed us finding all possible ways to order the output of the r-packets from s to the sink nodes in T. An ordering configuration based on Network Coding is valid, if the coding of packets is achieved through a linear combination in the coding nodes and the decoding of packets in the sink nodes. This validation verifies, then, a one-session multicast solution. The proposal of this work is independent of the network topology, the maximum flow value, and the size of the packets.