1.Kcp is not intended to serve massive targeted traffic, but to lower the RTT service for restricted targeted traffic. My homepage is quite clear, not to make it easier to increase the bandwidth utilization price of KB per second, but to help you lessen RTT. Moreover, what parameters do you set when working with kcp? In the similar time, how did you test? Intranet? public net? If how to recover deleted partition table cannot open the network simulation inside the internal network test, there is generally no packet loss. tcp will be the best overall performance. The issue is the fact that this is not the case around the public network. You will discover packet losses around the public network, particularly throughout the peak period.
2. If nack occasions out to send a retransmission request, it is necessary to estimate each sides' rtt, plus the request is initiated when it exceeds 1.5 occasions the short-term average rtt. You can find two sorts of responses. There is certainly no packet or there is a packet.
three. You didn't create tfrc proper, a great deal of protocols that use tfrc are usually not excellent? Price control did you lower packet loss?
four. For example, teacher Yao, take into account sending many tcp at the exact same time, but it is enough to open some tcp threads, and much more than five are from time to time counterproductive.


It is possible to try and use the transport layer coding technology, particularly you may use fountain coding and LDPC codes to delete codes. You can stay clear of this scenario where the final packet transmission is especially slow, but the price of introduction is usually to encode and decode. The truth is, the final handful of information blocks are also difficult to download in P2P transmission, as well as the transmission layer coding technologies can also be applicable. In recover lvm partition table , such a routine may be the identical because the file transmission challenge in deep space communication. To be able to overcome the massive RTT, deep space communication must use a deletion code to pre-encode the file, so that a number of data packets is usually sent at a time, increasing the probability of prosperous reception in the getting end . Deep space communication also frequently makes use of the NACK approach, but this is a one-time delayed NACK, which can be sent a single round just after another. The sending end sends one round of data packets, and determines the best way to send the following round of data packets in line with NACK until Finish.