UCSY's Research Repository

An Efficient Error Control Scheme for TCP Segments

Show simple item record

dc.contributor.author Win, Toe Nai
dc.contributor.author Aye, Win
dc.date.accessioned 2019-08-05T14:36:18Z
dc.date.available 2019-08-05T14:36:18Z
dc.date.issued 2009-12-30
dc.identifier.uri http://onlineresource.ucsy.edu.mm/handle/123456789/1798
dc.description.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. en_US
dc.language.iso en en_US
dc.publisher Fourth Local Conference on Parallel and Soft Computing en_US
dc.title An Efficient Error Control Scheme for TCP Segments en_US
dc.type Article en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Repository



Browse

My Account

Statistics