When the packet is reordered the most standard implementation of the Transmission control protocol (TCP) gives poor performance. This paper proposes a new version of the TCP which gives the high throughput when the packet reordering occurs and in another case if the packet reordering is not occurs then in that case also it is friendly to other version of the TCP. Transmission control protocol constant Packet Reordering (TCP-CPR) does not depend or rely on the duplicate acknowledgement to detect the packet loss. Instead the timer is used to maintain how long packet is transmitted. In this case timer is used to keep the track how long packets are transmitted. If acknowledgement are not received within the appropriate time then packet assume to loss because of the TCP-CPR does not depend on the duplicate acknowledgement. Packet reordering has does not effect on the performance of TCP-CPR. Through the performance of the TCP-CPR consistently better than existing mechanism that make the try to make the TCP more robust to packet reordering. In case where packets are not reordered, it’s verified that TCP-CPR maintains the same throughput as the typical implementation of TCP.
Gonnade, Sandeep Kumar and Nagwani, Naresh Kumar
"Recovery of loss of packet in network using constant packet reordering,"
International Journal of Communication Networks and Security: Vol. 1
, Article 4.
Available at: https://www.interscience.in/ijcns/vol1/iss1/4