Delay-Based Network Utility Maximization Modelling for Congestion Control in Named Data Networking
- 24 June 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 29 (5) , 2184-2197
Abstract
Content replication and name-based routing lead to a natural multi-source and multipath transmission paradigm in NDN. Due to the unique connectionless characteristic of NDN, current end-to-end multipath congestion control schemes (e.g. MPTCP) cannot be used directly on NDN. This paper proposes a Network Utility Maximization (NUM) model to formulate multi-source and multipath transmission in NDN with in-network caches. From this model, a family of receiver-driven transmission solutions can be derived, named as path-specified congestion control. The path-specified congestion control enables content consumers to separate the traffic control on each path, which consequently facilitates fair and efficient bandwidth sharing amongst all consumers. As a specific instance, a Delay-based Path-specified Congestion Control Protocol (DPCCP) is presented, which utilizes queuing delays as signals to measure and control congestion levels of different bottlenecks. In addition, a set of high-performance congestion control laws are designed to accelerate bandwidth and fairness convergence towards the optimum defined by the NUM model. Finally, DPCCP is compared with state-of-the-art solutions. The experimental evaluations show that DPCCP outperforms existing solutions in terms of bandwidth utilization, convergence time and packet loss.Keywords
Funding Information
- Irish Research Council (GOIPD/2019/874)
- Science Foundation Ireland (16/RC/3918, 13/SIRG/2178)
- European Regional Development Fund
- National Natural Science Foundation of China (61671126)
- Science and Technology Program of Sichuan Province of China (2019JDR0022)
This publication has 25 references indexed in Scilit:
- Efficient multipath forwarding and congestion control without route-labeling in CCN2015
- An extended Hop-by-hop interest shaping mechanism for content-centric networking2014
- A transport protocol for content-centric networking with explicit congestion control2014
- An On-demand Multi-Path Interest Forwarding strategy for content retrievals in CCN2014
- Optimal multipath congestion control and request forwarding in Information-Centric Networks2013
- Adaptive forwarding in named data networkingACM SIGCOMM Computer Communication Review, 2012
- An effective hop-by-hop Interest shaping mechanism for CCN communications2012
- Bufferbloat: Dark Buffers in the InternetQueue, 2011
- Multicommodity flows over time: Efficient algorithms and complexityTheoretical Computer Science, 2007
- A duality model of TCP and queue management algorithmsIEEE/ACM Transactions on Networking, 2003