Abstract
Named data networking (NDN), as a future Internet architecture that is a promising alternative to TCP/IPnetworks, has the new features of connectionless, in-network cache, and hop-by-hop forwarding, which makes thecongestion control algorithms of traditional TCP/IP networks unable to be directly applied to NDN. In addition, sincethe optimal size of the sending window cannot be determined, the existing window-based congestion control algorithmsgenerally use the AIMD-like window adjustment algorithm, which cannot achieve the optimal throughput. In thispaper, we propose a precise feedback-based, multipath-aware congestion control algorithm PFECC, which is inspiredby Accel-Brake Control algorithm. PFECC considers the influence of Interest flows, uses a fair queuing algorithm atthe intermediate node to calculate the target rate of each flow, and gives accurate feedback on each dequeued datapacket. The consumer changes the size of the sending window according to the feedback to quickly converge to thetarget bandwidth. To fully exploit the hop-by-hop adaptive forwarding feature of NDN, each downstream node timelysenses the congestion trend of the upstream link to split the forwarding rate of Interest to avoid congestion. Simulationresults show that PFECC can effectively reduce transmission delay, treat each flow fairly, and converge to the bestthroughput faster.
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
