{'fraction_non_alphanumeric': 0.03304347826086956, 'fraction_numerical': 0.0, 'mean_word_length': 5.08994708994709, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 1, '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}}
Evaluation of the Effects of Protocol Processing Overhead in Error Recovery Schemes for a High-Speed Packet Switched Network: Link-by-Link versus Edge-to-Edge Schemes

The authors investigate the effects of protocol processing overhead on the performance of error recovery schemes. The focus is on the edge-to-edge error recovery scheme, in which retransmissions of erred packets only take place between source and destination nodes. An approximation is obtained for the Laplace transform for the distribution of the end-to-end packet transfer delay, considering the processing time required for error recovery. The performance of the link-by-link error recovery scheme, in which retransmissions take place between adjacent nodes, is evaluated and compared to the performance of the edge-to-edge scheme. Numerical results from a tandem queuing network model show that for a network with very-high-speed/low-error-rate channels, an edge-to-edge scheme gives a smaller packet transmission delay than a link-by-link scheme for both go-back-N and selective-repeat retransmission procedures, while keeping the packet loss probability sufficiently small. >