{'fraction_non_alphanumeric': 0.014900662251655629, 'fraction_numerical': 0.0, 'mean_word_length': 5.5, '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}}
Dynamic Cache Allocation Algorithm and Replacement Policy for Reliable Multicast Network

In the field of reliable multicast, the design of most current router cache management protocols is limited by network environment with single multicast group. With such protocols, expected targets can not be achieved in Internet environment in which a router is shared by a plurality of multicast groups. ACP is a router cache management protocol suitable for the environment shared by multiple groups. In Internet in which there exists frequently emerged bursty data flow, however, ACP allocation algorithm has such drawbacks as slow convergence and instable allocation results when the number of multicast groups or group members changes. Based on the design and implementation of a dynamic cache allocation algorithm as well as time-out algorithm and packet discard policy, a novel Adaptive and Active Reliable Multicast Protocol (AARM for short) suitable for large-scale multicast network was proposed. Simulation results show that AARM will achieve significant enhancement of performance for multicast network in terms of delayed restoration, bandwidth consumption and network throughput, etc. compared with ACP.