Al-Hasanat M.Seman K.Saadan K.2024-05-282024-05-282015978148000000010.1109/I4CT.2015.72195932-s2.0-84944392426https://www.scopus.com/inward/record.uri?eid=2-s2.0-84944392426&doi=10.1109%2fI4CT.2015.7219593&partnerID=40&md5=d5ea3d89ea0e10039bd5749875a03c46https://oarep.usim.edu.my/handle/123456789/9410In this paper we introduced two enhancement modifications to the well-known TCP Westwood fast retransmission and fast recovery mechanisms. Firstly, a new modification is introduced to fasten the fast retransmission procedure by preventing the TCP sender side from waiting the third duplicate ACKs to retransmit lost packets. Secondly, further modification is presented to achieve better recovery for the congestion window size in the fast recovery phase based on last round trip time and bandwidth estimation. The two modifications are implemented and evaluated using ns-3 simulator. We compared the throughput and congestion window size of the new proposed modifications to TCPW and NewReno. As a result, the proposed algorithm has shown significant improvement over the two implementations. � 2015 IEEE.en-USFast RetransmissionTCP congestion controlTCP NewRenoTCP WestwoodWireless NetworksComputer system recoveryMobile telecommunication systemsRecoveryTelecommunication networksWireless networksBandwidth estimationCongestion window sizeFast retransmissionHigh bit errorsNewRenoRound-trip timeTCP congestion controlTCP westwoodTransmission control protocolConference Paper3373407219593