{'fraction_non_alphanumeric': 0.016304347826086956, 'fraction_numerical': 0.002717391304347826, 'mean_word_length': 5.138888888888889, '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}}
On finding the best partial multicast protection tree under dual-homing architecture

In this paper, we introduce the concept of partial protection and propose an efficient solution for providing partial multicast protection given the dual-homing architecture in the access network. In the dual-homing architecture, each destination is connected to two edge routers to enhance the survivability in the access network. The routing algorithm which finds a path from the source to each edge router holds the key for the multicast protection. We study the problem of finding the best partial multicast protection tree for the multicast session given the dual-homing architecture assuming that the hop count on each path is limited. We show the NP-completeness of the problem and propose the partition and sharing (PAS) algorithm to solve the problem efficiently. Simulation results show that the PAS algorithm achieves performance very close to the computed lower bounds. The solution proposed in this paper fills the gap between traditional 100% protection and non-protection subject to single link failure.