Abstract
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.
Highlights
The multicast routing mechanism [1] has been used for the transmission of messages from a source computer to a subset of sink computers in a network
Multicast routing is used for transmission of videoconferencing and teleconferencing to multiple sinks in different geographical locations, and this leads to an increase in traffic in the network that generates bottlenecks, worsening the Quality of Service for users
Network Coding (NC) changes the operation paradigm of the routing nodes, from being, traditionally, nodes of storage and forwarding to coding nodes. These nodes carry out the linear combination of the packets, that belong to the vector space Fm2, transferred by the incoming links, obtaining a new packet that will be forwarded by the output links, until reaching the sink nodes of the multicast group
Summary
The multicast routing mechanism [1] has been used for the transmission of messages from a source computer to a subset of sink computers in a network. NC changes the operation paradigm of the routing nodes, from being, traditionally, nodes of storage and forwarding to coding nodes These nodes carry out the linear combination of the packets, that belong to the vector space Fm2 , transferred by the incoming links, obtaining a new packet that will be forwarded by the output links, until reaching the sink nodes of the multicast group. In [7] a mechanism is proposed, that based on the configuration of a set of linear equations (linear combinations in the intermediate nodes) in the sink nodes and with the support of the Gauss-Jordan method, we obtain the original (simple [7]) r-packets sent simultaneously from the source node.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
