浏览全部资源
扫码关注微信
1. 清华大学网络科学与网络空间研究院北京信息科学与技术国家研究中心,北京 100084
2. 鹏城实验室,广东 深圳 518000
3. 清华大学奇安信联合研究中心,北京 100084
[ "安常青(1970− ),女,江苏徐州人,清华大学副研究员,主要研究方向为计算机网络体系结构、互联网路由、网络协议、网络测量" ]
[ "刘玉家(1997− ),女,山西忻州人,清华大学硕士生,主要研究方向为网络测量" ]
[ "王会(1977− ),女,河南南阳人,博士,清华大学副教授、博士生导师,主要研究方向为互联网体系结构、互联网测量、大数据相关技术" ]
[ "郑志延(1979- ),男,北京人,清华大学工程师,主要研究方向为互联网路由、网络管理、未来网络试验设施" ]
[ "喻涛(1981− ),男,湖北荆州人,博士,清华大学助理研究员,主要研究方向为网络体系结构、网络空间安全、未来互联网试验床、SDN/人工智能/大数据应用" ]
[ "王继龙(1973- ),男,黑龙江大兴安岭人,博士,清华大学教授,主要研究方向为网络空间测绘、位置网、未来网络试验设施等" ]
网络出版日期:2021-11,
纸质出版日期:2021-11-25
移动端阅览
安常青, 刘玉家, 王会, 等. 基于拓扑分析的区域级网络抗毁性研究[J]. 通信学报, 2021,42(11):145-158.
Changqing AN, Yujia LIU, Hui WANG, et al. Research on the invulnerability of regional network based on topology analysis[J]. Journal on communications, 2021, 42(11): 145-158.
安常青, 刘玉家, 王会, 等. 基于拓扑分析的区域级网络抗毁性研究[J]. 通信学报, 2021,42(11):145-158. DOI: 10.11959/j.issn.1000-436x.2021179.
Changqing AN, Yujia LIU, Hui WANG, et al. Research on the invulnerability of regional network based on topology analysis[J]. Journal on communications, 2021, 42(11): 145-158. DOI: 10.11959/j.issn.1000-436x.2021179.
为了衡量区域受到不同攻击的整体影响,捕捉区域网络拓扑之间的抗毁性差异,提出一种区域抗毁性评估算法。从区域内部和区域外部出发,分析区域内部自身抗毁性和区域之间通信拓扑的抗毁性。多方获取测量数据并校验以构建拓扑关系图,实现区域间链接的预测作为拓扑数据的补充。基于分层概率采样,多次模拟破坏以逼近真实情况下区域的受破坏情况。实现显著性检验器,分别从整体水平和特殊薄弱点衡量区域受破坏的影响,发现区域之间受破坏情况的差异,计算区域抗毁性排名。最终给出48个区域的排名和聚类结果。
To measure the overall impact of different attacks a network region may encounter
an evaluation algorithm can be used to capture the difference in invulnerability of regional network topologies.Specifically
the vulnerability of regional network and that of connection topology between regions both internally and externally was analyzed.To find predictions between regions as supplemental topology data and create the Internet topology
data would be measured in various ways and verified.Using stratified probability sampling
multiple damage simulations could predict the worst-case scenarios in real conditions.Damage was simulated multiple times based on stratified probability sampling to approximate the damage situation of the area under real conditions.A significance tester was realized to measure the impact of damage from the overall level and special weak points respectively
discover the difference of the damage between the areas
and calculate the regional invulnerability ranking.Finally
the ranking and clustering results of forty-eight regions were given.
KOZOWSK A . Comparative analysis of cyberattacks on Estonia,Georgia and Kyrgyzstan [J ] . European Scientific Journal , 2014 , 10 ( 7 ): 237 - 245 .
OGUN M . Terrorist use of cyberspace and cyber terrorism:New challenges and responses [M ] . IOS Press , 2015 .
DAINOTTI A , AMMANN R , ABEN E , et al . Extracting benefit from harm:using malware pollution to analyze the impact of political and geophysical events on the Internet [J ] . Computer Communication Review:A Quarterly Publication of the Special Interest Group on Data Communication , 2012 , 42 ( 1 ): 32 - 39 .
DAINOTTI A , . Lessons learned by “measuring” the internet during/after the sandy storm [C ] // Invited talk at FCC Workshop on Network Resiliency , 2013 .
ALBERT R , JEONG H , BARABASI A L . Error and attack tolerance of complex networks [J ] . Nature , 2000 , 406 ( 6794 ): 378 - 382 .
BAUMANN A , FABIAN B . How robust is the Internet? – insights from graph analysis [C ] // Lecture Notes in Computer Science . Berlin:Springer , 2015 : 247 - 254 .
WU J , ZHANG Y , MAO Z M , et al . Internet routing resilience to failures:analysis and implications [C ] // Proceedings of the 2007 ACM CoNEXT Conference on - CoNEXT '07 . New York:ACM Press , 2007 : 1 - 12 .
DOLEV D , JAMIN S , MOKRYN O , et al . Internet resiliency to attacks and failures under BGP policy routing [J ] . Computer Networks , 2006 , 50 ( 16 ): 3183 - 3196 .
DOMBROWSKI S , ERMAKOVA T , FABIAN B . Graph-based analysis of cloud connectivity at the internet protocol level [J ] . International Journal of Communication Networks and Distributed Systems , 2019 , 23 ( 1 ): 117 .
OMER M , NILCHIANI R , MOSTASHARI A . Measuring the resilience of the global Internet infrastructure system [C ] // Proceedings of 2009 3rd Annual IEEE Systems Conference . Piscataway:IEEE Press , 2009 : 156 - 162 .
LEYBA K G , EDWARDS B , FREEMAN C , et al . Borders and gateways:measuring and analyzing national as chokepoints [C ] // Proceedings of Proceedings of the Conference on Computing & Sustainable Societies - COMPASS 19 . New York:ACM Press , 2019 : 184 - 194 .
FONTUGNE R , SHAH A , ABEN E . The (thin) bridges of AS connectivity:measuring dependency using AS hegemony [C ] // Passive and Active Measurement . Berlin:Springer , 2018 : 216 - 227 .
吴喜之 . 统计学:从数据到结论 [M ] . 北京 : 中国统计出版社 , 2009 .
WU X Z . Statistics:from data to conclusion [M ] . Beijing : China Statistics Press , 2009 .
WOLFE A W . Social network analysis:methods and applications [J ] . American Ethnologist , 1997 , 24 ( 1 ): 219 - 220 .
BONACICH P . Factoring and weighting approaches to status scores and clique identification [J ] . The Journal of Mathematical Sociology , 1972 , 2 ( 1 ): 113 - 120 .
许进 . 系统核与核度理论及其应用 [M ] . 西安 : 西安电子科技大学出版社 , 1994 .
XU J . System kernel and kernel degree theory and its application [M ] . Xi’an : Xidian University Press , 1994 .
王梓行 , 姜大立 , 漆磊 , 等 . 基于冗余度的复杂网络抗毁性及节点重要度评估模型 [J ] . 复杂系统与复杂性科学 , 2020 , 17 ( 3 ): 78 - 85 .
WANG Z H , JIANG D L , QI L , et al . Complex network invulnerability and node importance evaluation model based on redundancy [J ] . Complex Systems and Complexity Science , 2020 , 17 ( 3 ): 78 - 85 .
章永来 , 周耀鉴 . 聚类算法综述 [J ] . 计算机应用 , 2019 , 39 ( 7 ): 1869 - 1882 .
ZHANG Y L , ZHOU Y J . Review of clustering algorithms [J ] . Journal of Computer Applications , 2019 , 39 ( 7 ): 1869 - 1882 .
GILL P , SCHAPIRA M , GOLDBERG S . Modeling on quicksand [J ] . ACM SIGCOMM Computer Communication Review , 2012 , 42 ( 1 ): 40 - 46 .
JIN Z T , SHI X G , YANG Y , et al . TopoScope:recover AS relation ships from fragmentary observations [C ] // Proceedings of the ACM Internet Measurement Conference . New York:ACM Press , 2020 : 266 - 280 .
KARLIN J , FORREST S , REXFORD J . Nation-state routing:censorship,wiretapping,and BGP [R ] . 2009 .
GAO L X . On inferring autonomous system relationships in the Internet [J ] . IEEE/ACM Transactions on Networking , 2001 , 9 ( 6 ): 733 - 745 .
DIMITROPOULOS X , KRIOUKOV D , HUFFAKER B , et al . Inferring AS relationships:dead end or lively beginning? [C ] // Experimental and Efficient Algorithms . Berlin:Springer , 2005 : 113 - 125 .
JIN Y , SCOTT C , DHAMDHERE A , et al . Stable and practical AS relationship inference with problink [C ] // 16th USENIX Symposium on Networked Systems Design and Implementation (NSDI 19) . Berkeley:USENIX Association , 2019 : 581 - 598 .
NAAB J , SATTLER P , JELTEN J , et al . Prefix top lists:gaining insights with prefixes from domain-based top lists on DNS deployment [C ] // Proceedings of Proceedings of the Internet Measurement Conference . New York:ACM Press , 2019 : 351 - 357 .
LI W T . Zipf's Law everywhere [J ] . Glottometrics , 2002 , 5 : 14 - 21 .
KRASHAKOV S A , TESLYUK A B , SHCHUR L N . On the universality of rank distributions of website popularity [J ] . Computer Networks , 2006 , 50 ( 11 ): 1769 - 1780 .
0
浏览量
473
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构