Dept. of Electr. Eng., National Taiwan Univ.Li, Yi-DerYi-DerLiWANJIUN LIAO2007-04-192018-07-062007-04-192018-07-062001-06http://ntur.lib.ntu.edu.tw//handle/246246/2007041910021233http://ntur.lib.ntu.edu.tw/bitstream/246246/2007041910021233/1/00937106.pdfThis paper proposes a new TCP variation called Formosa that significantly improves TCP end-to-end performance in terms of high connection throughput and high degree of fairness in resource sharing among multiple competing connections in asymmetric networks. Existing TCP implementations are based on ACK-clock, which clocks out a single data packet on receipt of an ACK. Formosa TCP pushes the frequency of ACKs per round trip time (RTT) to the lowest limit, using an ACK to cumulatively acknowledge a window's worth of data packets. The congestion window is updated to reflect the available bandwidth estimated on the forward channel, without the aids of the intermediate routers. As a result, the number of ACK packets is significantly reduced, while the principle of "conservation of packets" is still maintained. Based on "an ACK per window," Formosa estimates forward delay and implements the additive increase and multiplicative decrease algorithm for better congestion avoidance. In addition, it employs the negative acknowledgement mechanism for better congestion control during loss recovery. As compared to existing implementations, TCP Formosa demonstrates the best performance in terms of high connection throughput, high degree of fairness among connections and robustness in the face of two-way, transfers in asymmetric networks.application/pdf459198 bytesapplication/pdfen-USAsymmetric networks; Formosa TCP; TCP[SDGs]SDG3[SDGs]SDG8Algorithms; Bandwidth; Channel capacity; Routers; Telecommunication traffic; Asymmetric networks; Network protocolsconference paper10.1109/icc.2001.93710610.1109/ICC.2001.9371062-s2.0-0034857911http://ntur.lib.ntu.edu.tw/bitstream/246246/2007041910021233/1/00937106.pdf