ETRI-Knowledge Sharing Plaform



논문 검색
구분 SCI
연도 ~ 키워드


학술지 Randomizing TCP Payload Size for TCP Fairness in Data Center Networks
Cited 6 time in scopus Download 11 time Share share facebook twitter linkedin kakaostory
이수전, 이동만, 이명진, 정형수, 이병선
Computer Networks : The International Journal of Telecommunications Networking, v.129 no.Part 1, pp.79-92
16JR1300, 정지궤도 위성관제시스템 코어 S/W 표준 플랫폼 개발, 이병선
As many-to-one traffic patterns prevail in data center networks, TCP flows often suffer from severe unfairness in sharing bottleneck bandwidth, which is known as the TCP outcast problem. The cause of the TCP outcast problem is the bursty packet losses by a drop-tail queue that triggers TCP timeouts and leads to decreasing the congestion window. This paper proposes TCPRand, a transport layer solution to TCP outcast. The main idea of TCPRand is the randomization of TCP payload size, which breaks synchronized packet arrivals between flows from different input ports. Based on the current congestion window size and the CUBIC's congestion window growth function, TCPRand adaptively determines the proper level of randomness. With extensive ns-3 simulations and experiments, we show that TCPRand guarantees the superior enhancement of TCP fairness by reducing the TCP timeout period noticeably even in an environment where serious TCP outcast happens. TCPRand also minimizes the total goodput loss since its adaptive mechanism avoids unnecessary payload size randomization. Compared with DCTCP, TCPRand performs fairly well and only requires modification at the transport layer of the sender which makes its deployment relatively easier.
KSP 제안 키워드
Adaptive mechanism, Congestion Window, Data Center Networks, ITS Deployment, Packet arrivals, TCP fairness, TCP flows, TCP outcast, Traffic pattern, Transport layer, Window Size