Abstract:
Transmission Control Protocol (TCP) use cumulative acknowledgement scheme to provide reliable stream delivery service. Cumulative acknowledgement has one major inefficiency, it does not provide information about all successful transmission. In this paper, we represent the problem of how lack of information about all successful transmission makes TCP inefficient and present a way to recover such inefficiency. When transmitting a segment, bits will be added to identify the segment’s current position in window and receiving end will also send acknowledgement with extra bits for providing information about loss and arrived segments. This system will simulate cumulative acknowledgement of TCP and our modified scheme, and evaluate the performance in time, waste of network bandwidth of both schemes. Experiments show that cumulative acknowledgement is efficient when network is lossless because our scheme need a little more computation but our proposed scheme becomes more and more efficient as loss of segments in transmission increases.
