[1]李 涛,吕立尧,贾庆民,等.基于汇聚树的 CCN 兴趣包研究[J].计算机技术与发展,2022,32(11):100-105.[doi:10. 3969 / j. issn. 1673-629X. 2022. 11. 015]
　LI Tao,LYU Li-yao,JIA Qing-min,et al.Research on CCN Interest Packet Based on Aggregation Tree[J].,2022,32(11):100-105.[doi:10. 3969 / j. issn. 1673-629X. 2022. 11. 015]
点击复制

基于汇聚树的 CCN 兴趣包研究()
分享到：

《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]

卷:
32
期数:
2022年11期
页码:
100-105
栏目:
移动与物联网络
出版日期:
2022-11-10

文章信息/Info

Title:
Research on CCN Interest Packet Based on Aggregation Tree
文章编号:
1673-629X(2022)11-0100-06
作者:
李 涛1 ; 吕立尧1 ; 贾庆民1 ; 张 晨1 ; 张钰雯2
1. 紫金山实验室未来网络研究中心,江苏 南京 211111;
2. 中国信息通信研究院,北京 100191
Author(s):
LI Tao1 ; LYU Li-yao1 ; JIA Qing-min1 ; ZHANG Chen1 ; ZHANG Yu-wen2
1. Purple Mountain Laboratories Future Network Research Center,Nanjing 211111,China;
2. China Academy of Information and Communications Technology ( CAICT) ,Beijing 100191,China
关键词:
汇聚树; 源端注册; CP 选举; 兴趣包; 慢采样
Keywords:
aggregation tree; source registration; CP election; interest packet; slow sampling
分类号:
TP393
DOI:
10. 3969 / j. issn. 1673-629X. 2022. 11. 015
摘要:
信息中心网络(CCN) 的转发信息路由( FIB) 因为内容存储表( CS) 动态变化而频繁的震荡刷新,导致兴趣报文间歇性无路由状态而泛洪;同时因为兴趣包按照最长路由匹配查找进行转发,攻击端利用这一特点,发送大量匹配最长路由的无效明细兴趣报文,从而导致网络待定请求路由( PIT) 资源的耗尽。 针对如上场景中兴趣包泛洪带来的带宽浪费及数据丢失问题以及兴趣包泛洪攻击带来的资源耗尽问题,在总结目前各种兴趣包研究的基础上,提出了一种兴趣包隧道路由机制,包括 CP(Center Point) 选举机制、源端注册机制、慢采样机制、请求端路由机制、CPT( Center Point Tree) 机制等。 通过如上机制在转发面建立以可灵活配置的 CP 节点为中心的 CPT 隧道,在隧道树对兴趣报文进行引流和分析,并做出相应的转发或者防御策略解决如上问题。 仿真结果表明,在网络噪声较大时,可以极大降低丢包率,节省网络带宽;在乱序兴趣包泛洪攻击时,可以实现路由器首跳无源兴趣报文的有效压制。
Abstract:
The forwarding information routing ( FIB) of the information center network ( CCN) is refreshed frequently due to thedynamic change of the content storage table ( CS) ,resulting in intermittent flooding of interest packets without routing status. At thesame time,because interest packets are forwarded according to the longest route matching search, the attackers take advantage of thisfeature to send a large number of invalid detailed interest packets matching the longest route, resulting in the exhaustion of networkpending request routing ( PIT) resources. Aiming at? the problem of bandwidth waste and data loss caused by the flooding of interestpackets and the problem of resource exhaustion caused by the flooding attacks of invalid interest packets,a interest-packet tunnel routingmechanism is proposed based on the summary of various current interest packet studies, including CP ( Center Point ) electionmechanism, source registration mechanism, slow sampling mechanism, requester routing mechanism and CPT ( Center Point Tree )mechanism,etc. Through the above mechanism, CPT tunnel centered on the flexibly configurable CP node is established on theforwarding surface,the interest packets are drained and analyzed in the tunnel tree,and the corresponding forwarding or defense strategiesare made to solve the above problems. The simulation results show that when the network noise is large, the packet loss rate can bereduced greatly and the network bandwidth can be saved. In the flooding-attack of out-of-order interest packets,the router can suppressthe first hop passive interest packets effectively.
更新日期/Last Update: 2022-11-10