{'fraction_non_alphanumeric': 0.013142174432497013, 'fraction_numerical': 0.0, 'mean_word_length': 5.116788321167883, '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}}
Controlling the Rates and Achieving the Capacity Region for Two Sources Two Sinks Network Coding

Network coding offers new capabilities for efficient information multicasting in communication networks to maximize network throughput. In this paper we address optimal network coding scheme for two source two sinks multicast network. The main contribution of this work is to achieve the outer bound on capacity of network coding for two source two sink network by decomposing the multicast problem into three sub-problems: a multicast network coding sub-problem and two multi-commodity flow sub-problems. We also address the problem of achieving rates that maximize the total receiver throughput for multirate multicast session. The proposed method is a tree-based in which each source has one or more multicast tree to all the receivers.