欢迎访问中国科学院大学学报,今天是

中国科学院大学学报 ›› 2008, Vol. 25 ›› Issue (5): 602-610.DOI: 10.7523/j.issn.2095-6134.2008.5.005

• 论文 • 上一篇    下一篇

一种可生存性的通用突变算法模式及其模拟框架

黄燕芳, 张玉清, 陈深龙   

  1. 中国科学院研究生院国家计算机网络防范入侵中心,北京100049
  • 收稿日期:1900-01-01 修回日期:1900-01-01 发布日期:2008-09-15

A Pattern and Simulation Framework of Emergent Algorithms for Survivability

Huang Yan-Fang, Zhang Yu-Qing, Chen Shen-Long   

  1. National Computer Network Intrusion Protection Center, Graduate University of Chinese Academy of Sciences, Beijing 100049, China
  • Received:1900-01-01 Revised:1900-01-01 Published:2008-09-15

摘要: 可生存性是近年来网络安全领域的研究热点。提出将可生存性的目标系统分为有界系统和无界系统,并给出用于实现无界系统的可生存性突变算法的通用模式,其使用多代理系统和协议进行系统建模,部署可生存性控制代理,设计代理间的互操作协议,以此提高系统的可生存性。最后还设计了用于验证和评估突变算法的模拟框架。

关键词: 可生存性, 无界系统, 通用突变算法模式, 模拟框架, 多代理系统

Abstract: Survivability is one of research focuses of network security. This paper classified the target systems of survivability into Bounded Systems and Unbounded Systems and deemed Emergent Algorithms as a suitable solution to enhance the survivability of Unbounded Systems. A pattern of Emergent Algorithms is proposed using Multi-agent System and protocol to model the system. By deploying survivability control agents and designing the protocol among agents the survivability of the target Unbounded Systems is enhanced. Simulation framework to verify and evaluate Emergent Algorithms is also proposed.