Rethinking Fast and Friendly Transport in Data Center Networks in Java


The sustainable growth of bandwidth has been an inevitable tendency in current Data Center Networks (DCN). However, the dramatic expansion of link capacity offers a remarkable challenge to the transport layer protocols of DCN, i.e., how to converge fast and enable data flow to utilize the high bandwidth effectively. Meanwhile, the new protocol should be compatible to the traditional TCP because the applications with old TCP versions are still widely deployed. Therefore, it is important to achieve a trade-off between the aggressiveness and TCP-friendliness in protocol design. In this article, we first empirically investigate why the existing typical data center TCP variants naturally fail to guarantee both fast convergence and TCP friendliness. Then, we design a new transport protocol for DCN, namely Fast and Friendly Converging (FFC), which makes independent decisions and self-adjustment through retrieving the two-dimensional congestion notification from both RTT and ECN. We further present a mathematic model to analyze its competing behavior and converging process. The results from simulation experiments and real implementation show that FFC can achieve fast convergence, thus benefiting the flow completion time. Moreover, when coexisting with the traditional TCP, FFC also presents a moderate behavior, while introducing trivial deployment overhead only at the end-hosts.