

浏览全部资源
扫码关注微信
1. 中国科学院沈阳自动化研究所,辽宁,沈阳,110016
2. 中国科学院网络化控制系统重点实验室,辽宁,沈阳,110016
3. 北京交通大学下一代互联网互联设备国家工程实验室,北京,100044
4. 中国互联网络信息中心互联网基础技术开放实验室,北京,100190
5. 中国科学院沈阳自动化研究所,辽宁,沈阳,110016
6. 中国科学院网络化控制系统重点实验室,辽宁,沈阳,110016
7. 北京交通大学下一代互联网互联设备国家工程实验室,北京,100044
8. 中国互联网络信息中心互联网基础技术开放实验室,北京,100190
Published:2015
移动端阅览
WAN Ming, ZHANG Hong-ke, SHANG Wen-li, et al. An Efficient Approachto Defend DoS Attack Against Mapping Cache Under Identifier-Based Universal Network[J]. Acta Electronica Sinica, 2015, 43(10): 1941-1947.
WAN Ming, ZHANG Hong-ke, SHANG Wen-li, et al. An Efficient Approachto Defend DoS Attack Against Mapping Cache Under Identifier-Based Universal Network[J]. Acta Electronica Sinica, 2015, 43(10): 1941-1947. DOI: 10.3969/j.issn.0372-2112.2015.10.010.
为了抵御一体化标识网络中接入路由器可能遭受的映射缓存DoS攻击
本文提出了一种基于双门限机制的映射缓存DoS攻击防范方法.该方法设计了一种基于迭代思想的谜题机制降低映射缓存中映射信息条目的增加速率
并采用了映射信息可信度算法识别和过滤映射缓存中恶意的映射信息条目.仿真实验与性能分析表明
该方法能够有效地抵御映射缓存DoS攻击
防止映射缓存溢出.
In order to prevent the potential DoS attack against mapping cache under identifier-based universal network
this paper proposes an efficient defense approach based on double-threshold scheme.This approach not only designs a novel puzzle challenge mechanism based on iterative idea to decrease the growth rate of mapping entries
but also presents the trust value algorithm of mapping information to identify and filter out the malicious mapping entries.In particular
our analytical results show that
this approach is efficient and feasible to prevent the DoS attack against mapping cache
and resists the mapping cache overflow.
0
Views
2
下载量
1
CSCD
Publicity Resources
Related Articles
Related Author
Related Institution
京公网安备11010802024621