Reliability Analysis of Window Flow Control Based on Packet Transmission Interval with ECN Considering Packet Loss

This paper discusses the reliability model of a window flow control scheme using High-performance and Flexible Protocol (HpFP) with Explicit Congestion Notification (ECN) considering packet loss. HpFP is an important techniques as congestion control scheme in a radio environment and video stream communication. HpFP has the character that throughput is adjusted by changing a packet transmission interval. We have already discussed some reliability models of a window flow control scheme based on a packet transmission interval. In these models, if some packets has failed at a first-time transmission, the packet transmission interval is prolonged. On the other hand, the server checks the state of network congestion by ECN bit. That is, if ECN bit has been set during connection, a packet transmission interval is also prolonged. We consider an extended stochastic model of a window flow control scheme based on a packet transmission interval with ECN considering packet loss. That is, the server checks ECN bit during connection and if the server detects the network congestion, the server executes congestion control that a packet transmission interval is prolonged. Thereafter, if a constant number of the retransmission has failed, or a constant number of packets has failed, the server checks it again. We derive the mean time until packet transmissions succeed, and discuss analytically a window size which maximizes the amount of packets per unit of mean transmission time.

Optimal Policy of Window Flow Control Based on Packet Transmission Interval with Explicit Congestion Notification

This paper discusses a reliability problem of window flow control scheme with Explicit Congestion Notification (ECN) in the communication system, which is an essential issue in the long-distance transmission such as cloud computing. For example, there is a problem of reduction in transmission efficiency caused by a packet loss from network congestion. In order to solve the problem, recently, High-performance and Flexible Protocol (HpFP) has been proposed and performed a verification of effectiveness by simulation. 6 HpFP provides efficient packet communication by changing a packet transmission interval [T. Murata, T. Mizuhara, A. Takagi, K. Fukushima, K. Yamamoto, Y. Nagaya, K. Muranaga and E. Kimura, HpFP: A new protocol for LFNs with packet-loss based on UDP: A basic concept and detailed design of the protocol, IEICE Technical Report 115(484) IN2015-109, pp. 7–12 (2016)]. We have discussed the reliability model of a window flow control scheme based on a packet transmission interval. 7 We have proposed the model which judges the occurrence of congestion in a network by the number of retransmission [M. Kimura, M. Imaizumi and T. Nakagawa, Reliability modelling of window flow control scheme for a communication system based on packet transmission interval, in Proc. 23rd ISSAT Int. Conf. Reliability and Quality in Design (2017), pp. 171–175]. On the other hand, ECN mechanism for the detection of incipient congestion has been already proposed. ECN mechanism is efficient for the window flow control scheme because ECN bit is set in the packet header as an indication of congestion and is avoided unnecessary packet drops. We consider a stochastic model of a window flow control scheme based on a packet transmission interval with ECN. If ECN bit has been set during connection, a packet transmission interval is prolonged. We derive the mean time until packet transmissions succeed, and analytically discuss an optimal policy to maximize the amount of packets per unit of time until the transmission succeeds.