Abstract

Abstract In one of the most impacting schemes proposed to address the TCP throughput problem over network coding, the network coding layer sends an acknowledgement if an innovative linear combination is received, even when a new packet is not decoded. Although this scheme is very effective, its implementation requires a limit on the coding window size. This limitation causes low TCP throughput in the presence of packet reordering. We argue that a TCP variant detecting a packet loss relying only on timers is effective in dealing with the packet reordering problem in network coding environments as well. Also we propose a new network coding layer to support such a TCP variant. Simulation results for a 2-path environment show that our proposed scheme improves TCP throughput by 19%. Key Words : Network Coding, TCP, ARQ, Packet Reordering * 정회원, 홍익대학교 컴퓨터정보통신공학과접수일자 2011.10.12, 수정완료 2011.11.28게재확정일자 2011.12.16 Ⅰ. 서 론 네트워크 코딩방식의 실용화를 가로막는 중요한 문제 중 하나는 TCP와 함께 사용될 때 종종 좋은 성능을 얻지 못하는 문제이다. 이를 해결하기 위한 연구 결과들

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call