BBR-Inspired Congestion Control for Data Fetching over NDN.

In this paper we explore congestion control solutions in a network running the Named Data Networking (NDN) protocol. Since requested data can be retrieved from either original producers or in-network caches, the end-to-end connection oriented TCP congestion control solutions, such as BBR (Bottleneck Bandwidth and Round-trip propagation time) do not work well for NDN transport, especially in wireless networks. We propose a BBR-guided congestion control, BBR-CD, for bulk data fetching by a group of users. BBR-CD applies RTT filtering and interest scheduling to improve BBR's efficiency in NDN. Our evaluation shows that BBR-CD achieves much higher application goodput compared with ndncatchunks which implements the TCP AIMD and CUBIC congestion control algorithms. Moreover, compared with one-flow-per-file SIRC, an NDN congestion control algorithm that paces interests based on inter-data-gap, BBR-CD provides better fairness and bandwidth utilization. Finally, BBR-CD outperforms a direct adoption of the original BBR to NDN, suggesting that our changes to BBR are effective.