An Improved Hop-by-hop Interest Shaper for Congestion Control in Named Data Networking

被引:48
作者
Wang, Yaogong [1 ]
Rozhnova, Natalya [2 ]
Narayanan, Ashok
Oran, David
Rhee, Injong [1 ]
机构
[1] N Carolina State Univ, Raleigh, NC 27695 USA
[2] Univ Paris 06, F-75252 Paris 05, France
关键词
Congestion Control; Information-Centric Networking;
D O I
10.1145/2534169.2491233
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Hop-by-hop interest shaping has been proposed as a viable congestion control mechanism in Named Data Networking (NDN). Interest shaping exploits the strict receiver-driven traffic pattern and the symmetric bidirectional forwarding in NDN to control the returning data rate. In this paper, we point out that both interests and contents contribute to congestion and their interdependence must be considered in any interest shaping algorithm. We first analyze this issue mathematically by formulating it as an optimization problem to obtain the optimal shaping rate. Then a practical interest shaping algorithm is proposed to achieve high link utilization without congestive data loss. We further note that flow differentiation in NDN is complicated and design our scheme independently of traffic flows. We demonstrate our hop-by-hop interest shaper in conjunction with simple Additive-Increase-Multiplicative-Decrease (AIMD) clients using the ns3-based NDN simulator (ndnSIM). Our results show that the proposed shaping algorithm can effectively control congestion and achieve near-optimal throughput.
引用
收藏
页数:6
相关论文
共 11 条
[1]  
[Anonymous], 2010, NDN0001
[2]  
[Anonymous], 2012, NDN0002
[3]  
Braun S., 2013, IEEE ICCCN 13 JUL
[4]  
Carofiglio G., 2012, IEEE NOMEN 12 MAR
[5]  
Carofiglio G., 2013, IEEE NOMEN 13 APR
[6]  
Carofiglio G., 2012, ACM ICN 12 AUG
[7]  
Jacobson V., 2009, ACM REARCH 09 DEC
[8]   Charging and rate control for elastic traffic [J].
Kelly, F .
EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, 1997, 8 (01) :33-37
[9]  
Oueslati S, 2012, IEEE INFOCOM SER, P2417, DOI 10.1109/INFCOM.2012.6195631
[10]  
Rozhnova N., 2012, IEEE NOMEN 12 MAR