PFECC: a precise feedback-based explicit congestion control algorithm in named data networking

Abstract

Named Data Networking (NDN), as a future Internet architecture that is a promising alternative to TCP/IP networks, has the new features of connectionless, in-network cache and hop-by-hop forwarding, which make the congestion control algorithms of traditional TCP/IP networks cannot be directly applied to NDN. In addition, since the optimal size of the sending window cannot be determined, the existing window-based congestion control algorithms generally use the AIMD-like window adjustment algorithm, which cannot achieve the optimal throughput. In this paper, we propose a precise feedback-based, multipath-aware congestion control algorithm PFECC, which is inspired by ABC algorithm. PFECC considers the influence of Interest flows, uses a fair queuing algorithm at the intermediate node to calculate the target rate of each flow and makes accurate feedback on each dequeued Data packet, consumer changes the size of the sending window according to the feedback to quickly converge to the target bandwidth. To fully exploit the hop-by-hop adaptive forwarding feature of NDN, each downstream node timely senses the congestion trend of the upstream link to split the forwarding rate of Interest to avoid congestion. Simulation results show that PFECC can effectively reduce transmission delay, treat each flow fairly and converge to the best throughput faster.

Mathematical Models for Named Data Networking Producer Mobility Techniques: A Review

“…Considering the current network conditions, the IRE algorithm automatically adapts the rate at which interests are transmitted to avoid congestion. It uses feedback from routers to determine the network's capacity and adapt the rate of interest expression accordingly [71]. Other than that, it also seeks to prevent congestion by adjusting the interest expression rate before network conditions change.…”