Abstract
Network coding theory has provided a revolutionary approach to challenge the traditional switching theory. Instead of simple stored-and-forward in the intermediate node of network, information can be packaged in order to archive the maximum network flow. Instead of unit capacity, this paper presents an approach to employ maximum flows under integer capacity for multiple receivers to design a network coding scheme. A set of rules for constructing the coding networks are summarized. Firstly, the rules are proposed to transport maximum flows of multiple receivers to the architecture of a coding network. Secondly, the coding node, multicast node and forwarding nodes are defined to determine information routing rules in the corresponding nodes. We show that the proposed approach provides a practical means to construct a network coding scheme.
Sign-in/Register to access full text options 
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.
