检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机应用研究》2015年第1期17-20,共4页Application Research of Computers
基 金:国家基金广东省联合基金资助项目(U1201251)
摘 要:由于信息物理融合系统中网络之间的依赖关系,使得连锁故障现象频繁出现,系统变得脆弱,甚至可能引起网络瘫痪。如何减少连锁故障现象的发生是研究的重点内容。提出一种KID组合优化算法,通过寻求网络中节点的双向外连接数目K、网络内聚度ID(intra-degree)与阈值Pc值(维持网络运行所需要的最小值)的关系,找到K与ID如何组合使得Pc值降低,从而达到减少连锁故障现象的发生、提高网络稳定性的目的。从仿真可以看出:在ID一定的情况下,可以改变K值,使得阈值Pc最低,此时的系统稳定性最好;在相同K、ID组合的情况下该算法比随机分配、单向外连接边等算法更能提高系统的稳定性。It makes the cascading failure phenomenon occurs frequently, the system becomes "fragile" and may even cause the network, to a standstill because there are dependences among networks in cyber-physical system. How to reduce the casca- ding failure phenomenon is the focus of the content of the study. This paper proposed a KID combination optimal algorithm, which boosted the robustness of system by finding out the relationship among K,ID(intra-degree) and threshold Pc ( to maintain the minimum required to run the network ) , and reduced Pc by changing the combination of K and ID. Form the simulation, it is found that. a) in the case of certain ID, it can get the min value of P, by changing the value of K. In this case, the robustness of the system is the best. b) in the case of certain combination of K and ID, this algorithm has better performance than random allocation~ unidirectional inter-links algorithm.
关 键 词:信息物理融合系统 连锁故障 网络内聚度 依赖 组合
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.117.250.210