A hop-by-hop window-based congestion control method for named data networking

摘要

Congestion control is a hot topic in named data networking (NDN). Congestion control methods for NDN are classified into two approaches: the rate-based approach and the window-based approach. In the window-based approach, the optimum window size cannot be determined due to the largely changing round-trip time. Therefore, the rate-based approach is considered to be suitable for NDN and has been studied actively. However, there is still room for improvement in the window-based approach because hop-by-hop control in this approach has not been explored. In this paper, we propose a hop-by-hop widow-based congestion control method for NDN, which resolves these problems. The proposed method introduces a window-size control for per-hop Interest transmission using hop-by-hop acknowledgment. The simulation results show that the proposed method achieves high throughput performance, as well as the max-min fairness, while effectively avoiding congestion.