{'fraction_non_alphanumeric': 0.016719745222929936, 'fraction_numerical': 0.0, 'mean_word_length': 5.285, '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}}
Reliable multicast protocol adopting hierarchical tree-based repair mechanism

In this work, Tree Based Reliable Multicast protocol (TRAM) is analyzed. Modified algorithmic model to improve the functioning of the protocol is implemented. In TRAM model, authors have considered an approach for Retransmission of lost data packets which minimize the resource utilization at intermediate hosts and localize the effect of slow or malicious receivers on normal recovers. TRAM is designed to support bulk data transfer from a single sender to many receivers. A dynamically formed repair tree provides local error recovery allowing the multicast group to support a large number of receivers. Here TRAM is implemented in some smaller network environments. Authors have considered an efficient retransmission control scheme which can rectify some of the disadvantages of TRAM. Under this scheme, most of additional retransmissions are performed within a local group. This feature satisfies the original goal of tree-based protocol. This study is done for the error-free case. The modified protocol optimizes the buffer requirement at intermediate hosts and improves the end-to-end parameters for normal receivers in the presence of some slow or malicious receivers.