{'fraction_non_alphanumeric': 0.0199203187250996, 'fraction_numerical': 0.0, 'mean_word_length': 5.20164609053498, '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}}
Reliability of Congestion Control Based on Packet Transmission Interval with Hybrid ARQ

Code error correction methods have been important techniques at a radio environment and video stream transmission. In general, when a server transmits some data packets to a client, the server resends the only loss packets. But in this method, a delay occurs in a transmission. In order to prevent the transmission delay, the loss packets are restored by the error correction packet on a client side. The code error correction method is called Hybrid Automatic Repeat reQuest (ARQ) and has been researched. On the other hand, congestion control schemes have been important techniques at a data communication. Some packet losses are generated by network congestion. In order to prevent some packet losses, the congestion control performs by prolonging packet transmission intervals, which is called High-performance and Flexible Protocol (HpFP). In this paper, we present a stochastic model of congestion control based on packet transmission interval with Hybrid ARQ for data transmission. That is, if the packet loss occurs, the data packet received in error is restored by the error correction packet. Moreover, if errors occur in data packets, the congestion control performs by prolonging packet transmission intervals. The mean time until packet transmissions succeed is derived analytically, and a window size which maximizes the quantity of packets per unit of time until the transmission succeeds is discussed.