检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]广东电网电力调度控制中心,广东广州510600 [2]四川创立信息科技有限责任公司,四川成都610093
出 处:《电子设计工程》2016年第21期122-125,共4页Electronic Design Engineering
基 金:北京市自然科学基金项目(4142049)
摘 要:基于电力通信网业务特征,提出一种低风险路由方法(LRRM)。建立蓄意攻击和介数优先攻击模型,并针对攻击方式,综合考虑电力业务重要度分布、边介数分布和业务路径长度3个风险指标,建立网络路由风险模型。以网络路由风险值最小为优化目标兼顾电力业务时延要求,利用混沌克隆遗传算法(CCGA)和Dijkstra算法联合求解最优路由。通过数值仿真比较网络在低风险路由方法和最短路径路由方法下的脆弱性,结果证明低风险路由方法可有效降低电力通信网的脆弱性。A low risk routing method(LRRM) for electric power communication network(EPCN) is proposed based on the features of power businesses. First, deliberate attack and betweenness first attack models are created. Taking account into three risk index, power service importance distribution, edge betweenness distribution and path length, a low risk routing model is created based on the attack models. Then, considering both network risk and power businesses delay requirement,optimized routing is calculated using Dijkstra algorithm and chaotic clonal genetic algorithm(CCGA). The vulnerabilities of an EPCN applying LRRM and shortest path first method(SPFM) are compared by numerical simulation. The results show that LRRM can effectively reduce the network vulnerability.
分 类 号:TN91[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.219.92.7