摘要
人们普遍认为,对于一般的网络图而言,当网络弧在生长时将有益于网络可靠性的增强。然而事实证明该论断并不完全正确。对于某些注重最短路径长度的网络而言:(1)当网络G受到随机攻击时,以网络最短路熵作为网络可靠性的判断依据,分别计算在增加一条弧前后网络结点或网络弧受到攻击而失效时的网络最短路熵,比较网络最短路熵的大小,熵值越大,可靠性越弱;(2)当网络G受到恶意攻击时,根据悲观原则定义了一种新的可靠性指标,该指标值越大,网络可靠性越强。结果表明:(1)当G与G′的最短路径长度相等时,G′的可靠性不弱于G;(2)当G与G′的最短路径长度不相等时,G与G′的可靠性相对大小关系不唯一。对该问题的研究有助于人们清楚的认识到网络弧生长对网络可靠性的影响。最后用简化的江苏省城市间高速公路网络图为例来说明该研究的有效性与实用性。
It is commonly recognized that,as to a general network,the network reliability will be increasingly enhanced when network arcs are growing.However,this argument is not entirely correct.For some researches on networks that mainly focus on shortest path length,the conclusions can be got as follows.First,if network Gsuffers from random attacks,the network shortest path entropy is utilized as a criterion judging the network reliability and will be computed before and after an extra arc is added when the network node or arc is attacked and thus fails.In this case,the larger the entropy value is,the weaker the reliability becomes.Second,if network Gsuffers from malicious attacks,a newly-defined reliability indicator is applied in accordance with pessimistic principle,which is positively correlated with network reliability.The result further shows that：when Gis identical to G′in the shortest path length,then the reliability of G′is not weaker than G′s;when Gis not equal to G′in the shortest path length,their reliability＇s relative value is not unique.This study helps cultivate an in-depth understanding of the influence of network arc＇s growth on the network＇s reliability.Finally,a simplified inter-city expressway network graph of Jiangsu province is exemplified to demonstrate the effectiveness and practicability of this approach.
出处
《中国管理科学》
CSSCI
北大核心
2015年第1期65-72,共8页
Chinese Journal of Management Science
基金
国家自然科学基金资助项目(71073079,11271257)
江苏省普通高校研究生科研创新计划资助项目(CX-LX12_0174)
中央高校基本科研业务费专项资金资助项目
关键词
随机失效
恶意攻击
网络可靠性
网络最短路熵
悲观原则
random failures
mailcious attacks
network reliability
network shortest path entropy
pessimistic principle
