Delay performance analysis of token-based fast TCP in window limit systems

In this paper, we first provide a closed form differential formula to analyze the buffer requirement for zero loss of TCP in networks with a high bandwidth-delay product. Then, a token based fast-TCP algorithm is analyzed and modeled which proved that in WANs (wide-area networks), when the window size is smaller than bandwidth-delay products (BDP), or in wireless networks, where window size is not allowed to be larger than BDP because of link errors, token based ACKs delay control can not only largely reduce buffer occupancy, but can also gain the same average throughput as TCP with infinite buffer size. We also apply our analysis, which is not included in previous work, to the multiple connection case