期刊文献+

OSPF路由协议的脆弱性分析 被引量:8

Analysis of vulnerabilities of OSPF routing protocol
下载PDF
导出
摘要 首先介绍了OSPF(OpenShortestPathFirst开放最短路径优先)路由协议及其数据包的头部结构,接下来介绍了与之相关的链路年龄、链路序号、链路校验等三个参数以及OSPF协议存在的脆弱性,分析了针对OSPF的三种外部攻击方法(即链路序号加一攻击,最大链路年龄攻击和最大链路序号攻击)和两类内部攻击方法.针对如何检测某一种特殊攻击的问题,介绍了公钥验证的思路.最后,提出了利用入侵检测系统来识别各种攻击的办法. This paper first introduces OSPF(open shortest path first) routing protocol and header format of its data packet, then it describes three parameters: link age, link sequence number and link checkout sum, as well as OSPF routing protocol vulnerabilities. It also analyzes three OSPF attack methods from outside(i.e. link sequence number attack, oldest link age attack and biggest link sequence number attack) and two attack methods from inside. So as how to detect one special attack, it brings out the publick key method. At last, a method using the intrusion detection system to detect the OSPF routing protocol attacks is proposed.
出处 《武汉大学学报(工学版)》 CAS CSCD 北大核心 2004年第3期98-101,共4页 Engineering Journal of Wuhan University
关键词 OSPF路由协议 脆弱性 入侵检测 开放最短路径优先 网络安全 攻击方法 OSPF(open shortest path first) vulnerability intrusion detection
  • 相关文献

参考文献3

  • 1Wang Xianpei, Zhang Jun, Wang Quande. On the measuring of network vulnerability[J].Proceedings of SPIE:Fifth International Symposium on Instrumentation and Control Technology,2003,5253:520-523.
  • 2Wang Xianpei, Xu H, etc.Evidential reasoning research on intrusion detection[J].Proceedings of SPIE :Fifth International Symposium on Instrumentation and Control Technology,2003,5253:930-934.
  • 3王先培 高志新.运用实时协议分析检测针对OSPF路由协议的攻击[J].东南大学学报,2002,(12):212-214.

同被引文献34

  • 1杨晓东,刘玉珍,张焕国,杨安培.OSPF路由协议的认证分析[J].计算机工程与设计,2005,26(1):18-21. 被引量:6
  • 2陈海燕,季仲梅,李鸥,胡捍英.OSPF路由协议安全性分析及其攻击检测[J].微计算机信息,2005,21(5):230-231. 被引量:17
  • 3钟廷龙,李鑫,郭云飞.OSPF路由协议安全性分析[J].微计算机信息,2005,21(08X):15-17. 被引量:9
  • 4李彦华,黄华,孙绪荣.大规模网络中两种动态路由协议的分析比较[J].科学技术与工程,2006,6(9):1288-1291. 被引量:4
  • 5刘魁星,汪斌强,贾娟.OSPF路由协议安全性分析与研究[J].电视技术,2007,31(2):49-51. 被引量:7
  • 6Frigioni D, Marchetti-Spaccamela A Nanni U. Incremental Algorithms for Single-Source Shortest Path Trees [C]//Proc of the 14th Conf on Foundations of Software Technology and Theoretical Computer Science, 1994 : 113-124.
  • 7Frigioni D, Marchetti A, Nanni U. Fully Dynamic Output Bounded Single Source Shot-Test Path Problem[C] //Proc of the 7th ACM/ SIAM Syrup Discrete Algorithms, 1996: 212-221.
  • 8Xiao Bin, Cao Jiannong. Dynamic Shortest Path Tree Update for Multiple Link State Decrements[C] //Proc of the 2004 Global Telecommunications Conf, 2004:1163-1167.
  • 9谢希仁.计算机网络[M].4版.北京:电子工业出版社,2006:214-220.
  • 10蒋华,魏占祯,邱诚等.路由协议的安全性分析与对策[C].2003年中国通信学会信息通信网络技术委员会学术年会论文集.北京:中国通信学会信息通信网络技术委员会,2003,72-75.

引证文献8

二级引证文献18

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部