Output Forms of Packets in a Multicast Session Using Network Coding With R Flow
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, constit...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2019-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8869885/ |
| _version_ | 1818924168411873280 |
|---|---|
| author | Jose D. Marquez Carolina A. Salcedo |
| author_facet | Jose D. Marquez Carolina A. Salcedo |
| author_sort | Jose D. Marquez |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-12-20T02:21:02Z |
| format | Article |
| id | doaj.art-8aee4826592846dd955c7338011465d9 |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-12-20T02:21:02Z |
| publishDate | 2019-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-8aee4826592846dd955c7338011465d92022-12-21T19:56:49ZengIEEEIEEE Access2169-35362019-01-01715206415207510.1109/ACCESS.2019.29475908869885Output Forms of Packets in a Multicast Session Using Network Coding With R FlowJose D. Marquez0https://orcid.org/0000-0003-0400-5020Carolina A. Salcedo1https://orcid.org/0000-0002-1494-5465System and Computer Engineering Department, Universidad del Norte, Barranquilla, ColombiaSystem and Computer Engineering Department, Universidad del Norte, Barranquilla, ColombiaA 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.https://ieeexplore.ieee.org/document/8869885/Combinatorial algorithmlinear network codingmaximum flownetwork coding solutionone-session multicast network |
| spellingShingle | Jose D. Marquez Carolina A. Salcedo Output Forms of Packets in a Multicast Session Using Network Coding With R Flow IEEE Access Combinatorial algorithm linear network coding maximum flow network coding solution one-session multicast network |
| title | Output Forms of Packets in a Multicast Session Using Network Coding With R Flow |
| title_full | Output Forms of Packets in a Multicast Session Using Network Coding With R Flow |
| title_fullStr | Output Forms of Packets in a Multicast Session Using Network Coding With R Flow |
| title_full_unstemmed | Output Forms of Packets in a Multicast Session Using Network Coding With R Flow |
| title_short | Output Forms of Packets in a Multicast Session Using Network Coding With R Flow |
| title_sort | output forms of packets in a multicast session using network coding with r flow |
| topic | Combinatorial algorithm linear network coding maximum flow network coding solution one-session multicast network |
| url | https://ieeexplore.ieee.org/document/8869885/ |
| work_keys_str_mv | AT josedmarquez outputformsofpacketsinamulticastsessionusingnetworkcodingwithrflow AT carolinaasalcedo outputformsofpacketsinamulticastsessionusingnetworkcodingwithrflow |