Hui Li

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

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 makes the congestion control algorithms of traditional TCP/IP networks unable to 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 Accel-Brake Control 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 gives accurate feedback on each dequeued data packet. The 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.

PDF

___

[1] Zhang L, Afanasyev A, Burke J, Jacobson V, Claffy K et al. Named data networking. ACM SIGCOMM Computer Communication Review 2014; 44 (3): 66-73. doi: 10.1145/2656877.2656887
[2] Floyd S, Jacobson V. Random early detection gateways for congestion avoidance. IEEE/ACM Transactions on Networking 1993; 1 (4): 397-413. doi: 10.1109/90.251892
[3] Nichols K, Jacobson V. Controlling queue delay. Communications of the ACM 2012; 55 (7): 42-50. doi: 10.1145/2209249.2209264
[4] Goyal P, Agarwal A, Netravali R, Alizadeh M, Balakrishnan H. ABC: a simple explicit congestion controller for wireless networks. In: 17th USENIX Symposium on Networked Systems Design and Implementation; Santa Clara, CA, USA; 2020. pp. 353-372.
[5] Mastorakis S, Afanasyev A, Moiseenko I, Zhang L. ndnSIM 2.0: A new version of the NDN simulator for NS-3. NDN, Technical Report NDN-0028, 2015.
[6] Carofiglio G, Gallo M, Muscariello L. ICP: Design and evaluation of an interest control protocol for content-centric networking. In: 2012 Proceedings IEEE INFOCOM Workshops; Orlando, FL, USA; 2012. pp. 304-309
[7] Saino L, Cocora C, Pavlou G. Cctcp: A scalable receiver-driven congestion control protocol for content centric networking. In: 2013 IEEE International Conference on Communications (ICC); Budapest, Hungary; 2013. pp. 3775-3780.
[8] Carofiglio G, Gallo M, Muscariello L, Papali M. Multipath congestion control in content-centric networks. In: 2013 IEEE conference on computer communications workshops (INFOCOM WKSHPS); Turin, Italy; 2013. pp. 363-368.
[9] Carofiglio G, Gallo M, Muscariello L. Joint hop-by-hop and receiver-driven interest control protocol for content-centric networks. ACM SIGCOMM Computer Communication Review 2012; 42 (4): 491-496. doi: 10.1145/2377677.2377772
[10] Ren Y, Li J, Shi S, Li L, Chang x. An interest control protocol for named data networking based on explicit feedback. In: 2015 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS); Oakland, CA, USA; 2015. pp. 199-200.
[11] Zhang F, Zhang Y, Reznik A, Liu H, Qian C et al. A transport protocol for content-centric networking with explicit congestion control. In: 23rd international conference on computer communication and networks (ICCCN); Shanghai, China; 2014. pp. 1-8.
[12] Schneider K, Yi C, Zhang B, Zhang L. A practical congestion control scheme for named data networking. In: Proceedings of the 3rd ACM Conference on Information-Centric Networking; Kyoto, Japan; 2016. pp. 21-30.
[13] Rozhnova N, Fdida S. An effective hop-by-hop interest shaping mechanism for ccn communications. In: Proceedings IEEE INFOCOM Workshops; Orlando, FL, USA; 2012. pp. 322-327.
[14] Rozhnova N, Fdida S. An extended hop-by-hop interest shaping mechanism for content-centric networking. In: 2014 IEEE global communications conference; Austin, TX, USA; 2014. pp. 1-7.
[15] Wang Y, Rozhnova N, Narayanan A, Oran D, Rhee I. An improved hop-by-hop interest shaper for congestion control in named data networking. ACM SIGCOMM Computer Communication Review 2013; 43 (4): 55-60. doi: 10.1145/2534169.2491233
[16] Zhong S, Liu Y, Li J, Lei K. A rate-based multipath-aware congestion control mechanism in named data networking. In: 2017 IEEE international symposium on parallel and distributed processing with applications and 2017 IEEE International Conference on Ubiquitous Computing and Communications (ISPA/IUCC); Guangzhou, China; 2017. pp. 174-181.
[17] Carofiglio G, Gallo M, Muscariello L. Optimal multipath congestion control and request forwarding in information-centric networks: Protocol design and experimentation. Computer Networks 2016; 110: 104-117. doi: 10.1016/j.comnet.2016.09.012
[18] Mahdian M, Arianfar S, Gibson J, Oran D. MIRCC: Multipath-aware icn rate-based congestion control. In: Proceedings of the 3rd ACM Conference on Information-Centric Networking; Kyoto, Japan; 2016. pp. 1-10.
[19] Bansal D, Balakrishnan H, Floyd S, Shenker S. Dynamic behavior of slowly-responsive congestion control algorithms. ACM SIGCOMM Computer Communication Review 2001; 31 (4): 263-274. doi: 10.1145/964723.383080
[20] Xu L, Harfoush K, Rhee I. Binary increase congestion control (BIC) for fast long-distance networks. In: IEEE INFOCOM 2004; Hong Kong, China; 2004. pp. 2514-2524.
[21] Nguyen D, Fukushima M, Sugiyama K, Tagami A. Eﬀicient multipath forwarding and congestion control without route-labeling in CCN. In: 2015 IEEE international conference on communication workshop (ICCW); London, UK; 2015. pp. 1533-1538