{'fraction_non_alphanumeric': 0.014783526927138331, 'fraction_numerical': 0.0, 'mean_word_length': 5.32, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Practical Network Coding Scheme Based on Maximum Flow Combination and Coding Node Identification

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.