可生存性及紧急算法特征分析

Analysis on Characters of Survivability and Emergent Algorithms

文章主要就无边界网络系统的可生存性问题及其解决方案-紧急算法两个方面进行分析。首先给出了作为网络信息系统发展方向的无边界系统的定义,分析其特征并引出无边界系统环境下的网络安全研究。然后提出满足安全新需求的无边界网络可生存性问题,分析了可生存性必须具备的特征及其与传统安全概念的区别,并简要分析了可生存系统的设计需求。最后着重分析了可以解决无边界网络可生存性问题的紧急算法的特征,给出了紧急算法的两种不同的定义描述,并对比分析了与传统分布式算法的不同,论文还就紧急算法的应用场合和开发策略进行了简单分析。

This paper mainly analyies survivability in unbounded networks and systems and its solution-emergent algorithms.Firstly,this paper defines unbounded systems as networks and information systems will develop into,analyzes characters of unbounded systems,and introduces the research of network security in unbounded systems.Secondly,it poses survivability in unbounded systems which meets new security requirements,analyzes the obligatory characters of survivability,points out the differences between survivability and traditional security concepts,and simply refers to requirements of survivable systems.Finally,it emphasizes the characters of emergent algorithms which can resolve survivability in unbounded networks,depict two different definition descriptions of emergent algorithms,differentiate them from traditional distributed algorithms,and briefly analyzes the application environments and development strategies of emergent algorithms.