TY - JOUR
T1 - Delay-Based Network Utility Maximization Modelling for Congestion Control in Named Data Networking
AU - Lee, Brian
AU - Flynn, Ronan
AU - Xu, Jin
AU - Fang, Guiming
AU - Qiao, Yuansong
AU - Ye, Yuhang
N1 - Publisher Copyright:
© 1993-2012 IEEE.
PY - 2021/10/1
Y1 - 2021/10/1
N2 - 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.
AB - 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.
KW - Named data networking
KW - congestion control
KW - multi-source
KW - multipath
UR - http://www.scopus.com/inward/record.url?scp=85112213653&partnerID=8YFLogxK
U2 - 10.1109/TNET.2021.3090174
DO - 10.1109/TNET.2021.3090174
M3 - Article
AN - SCOPUS:85112213653
SN - 1063-6692
VL - 29
SP - 2184
EP - 2197
JO - IEEE/ACM Transactions on Networking
JF - IEEE/ACM Transactions on Networking
IS - 5
ER -