Popularity-based congestion control in named data networking

Named Data Networking (NDN) has some transport characteristics different from those of TCP/IP because it is pull-based, in-path caching, hop-by-hop, and multi-path. For these reasons, it is necessary to adapt a distinguished congestion control mechanism to the NDN environment. Congestion control algorithms based on traditional RTT measurements will not work correctly since the data source may change due to innetwork caching during communication flow. In this paper, we propose a novel approach for developing a congestion control scheme in NDN by predicting content popularity. Performance evaluation demonstrates the effectiveness of the proposed congestion control scheme using the ns3-based NDN simulator (ndnSIM).

[1]  Andreas S. Weigend,et al.  Time Series Prediction: Forecasting the Future and Understanding the Past , 1994 .

[2]  Van Jacobson,et al.  Networking named content , 2009, CoNEXT '09.

[3]  Alexander Afanasyev,et al.  journal homepage: www.elsevier.com/locate/comcom , 2022 .

[4]  Cui-Qing Yang,et al.  A taxonomy for congestion control algorithms in packet switching networks , 1995, IEEE Netw..

[5]  Massimo Gallo,et al.  ICP: Design and evaluation of an Interest control protocol for content-centric networking , 2012, 2012 Proceedings IEEE INFOCOM Workshops.

[6]  Massimo Gallo,et al.  Joint hop-by-hop and receiver-driven interest control protocol for content-centric networks , 2012, CCRV.

[7]  Deborah Estrin,et al.  Named Data Networking (NDN) Project , 2010 .

[8]  Serge Fdida,et al.  An effective hop-by-hop Interest shaping mechanism for CCN communications , 2012, 2012 Proceedings IEEE INFOCOM Workshops.

[9]  James Roberts,et al.  Flow-aware traffic control for a content-centric network , 2012, 2012 Proceedings IEEE INFOCOM.

[10]  Nick McKeown,et al.  Why flow-completion time is the right metric for congestion control , 2006, CCRV.

[11]  George Pavlou,et al.  CCTCP: A scalable receiver-driven congestion control protocol for content centric networking , 2013, 2013 IEEE International Conference on Communications (ICC).

[12]  Bernardo A. Huberman,et al.  Predicting the popularity of online content , 2008, Commun. ACM.

[13]  Jörg Ott,et al.  Deadline-based resource management for information-centric networks , 2013, ICN '13.

[14]  Spyros Makridakis.  Time series prediction: Forecasting the future and understanding the past: Andreas S. Weigend and Neil A. Gershenfeld, eds., 1993, (Addison-Wesley Publishing Company, Reading, MA, USA), 643 pp., paperback $49.50, ISBN 0-201-62 , 1994 .

[15]  Massimo Gallo,et al.  Multipath congestion control in content-centric networks , 2013, 2013 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[16]  Christian F. Tschudin,et al.  An Empirical Study of Receiver-Based AIMD Flow-Control Strategies for CCN , 2013, 2013 22nd International Conference on Computer Communication and Networks (ICCCN).

[17]  Filip De Turck,et al.  On the merits of popularity prediction in multimedia content caching , 2011, 12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops.

[18]  Injong Rhee,et al.  An improved hop-by-hop interest shaper for congestion control in named data networking , 2013, ICN '13.