Bufferbloat is a phenomenon that will cause extremely high latency due to the oversized buffer deployed in the network. There have been a lot of research for solving bufferbloat issue; however, there are still some drawbacks for existing research. Therefore, we proposed a robust receive window adjustment scheme to dynamically adjust the receive window. In our algorithm, we can always maximize the throughput first before minimizing the latency of the connection. From our simulation results, comparing to other algorithms, our algorithm can reduce the problem of bufferbloat subject to achieving maximum throughput, so that we won’t suffer from throughput degradation when solving bufferbloat problem.