分布式环境下的路由器级互联网抗毁性研究

doi:10.11896/j.issn.1002-137X.2017.11.025

摘要/Abstract

摘要： 基于MapReduce分布式计算框架对路由器级互联网拓扑的抗毁性进行研究,从连通性和传输效率两个角度衡量网络的拓扑抗毁性,提出了两个抗毁性新测度:网络连通率和网络传输效率比。基于MapReduce设计并实现了互联网抗毁性分析算法(AIIMR),算法在分布式环境下采用不同的攻击策略对互联网拓扑进行仿真攻击。实验对比分析了传统测度在衡量路由器网络时存在的问题,证明了所提测度的有效性。在不同网络上的实验结果表明,路由器级互联网在遭受随机攻击时表现出很强的抗毁性,而在面对蓄意攻击时则表现得十分脆弱。最后,在不同规模的Hadoop集群上进行实验,结果验证了算法的高效性和扩展性。

关键词: 路由器级Internet,抗毁性,分布式计算,AIIMR

Abstract: We used MapReduce to study the invulnerability of router-level Internet.In order to evaluate network invulnerability,two new measures of invulnerability were proposed:network connectivity ratio and efficiency ratio.We designed the analysis algorithm of the Internet invulnerability based on MapReduce (AIIMR) using the two new mea-sures.The algorithm simulates the different attack on the Internet.The experimental results show the problem of traditional measure in measuring the router network and prove the validity of the proposed measure.The experimental results also show that the attacked router-level Internet is robust at random attack and fragile at targeted attack.Finally,the experiment proves that the proposed MapReduce algorithm effectively improves the efficiency,and has good sca-lability.

Key words: Router-level Internet,Invulnerability,Distributed computing,AIIMR

朱凯龙,陆余良,杨斌. 分布式环境下的路由器级互联网抗毁性研究[J]. 计算机科学, 2017, 44(11): 168-174. https://doi.org/10.11896/j.issn.1002-137X.2017.11.025

ZHU Kai-long, LU Yu-liang and YANG Bin. Study on Invulnerability of Router-level Internet Based on MapReduce[J]. Computer Science, 2017, 44(11): 168-174. https://doi.org/10.11896/j.issn.1002-137X.2017.11.025

参考文献

[1] HUANG A Q,CROW M L,HEYDT G T,et al.The future renewable electric energy delivery and management (FREEDM) system:the energy internet [J].Proceedings of the IEEE,2011,99(1):133-148.
[2] SU W,HUANG A Q.Proposing an electricity market frame-work for the energy internet [C]∥IEEE Power & Energy Socie-ty General Meeting.Vancouver,British Columbia,Canada,2013:1-5.
[3] HERNANDEZ B,JIMENEZ J,MARTIN M.Customer Behavior in Electronic Commerce:The Moderating Effect of E-purchasing Experience [J].Journal of Business Research,2010,63(9/10):964-971.
[4] LIU J S,ZHOU C Q,GUO L S.Application of “Internet plus” era of big data technology in military field [J].National Defense Science & Technology,2011,36(6):35-41.(in Chinese) 刘金山,周朝谦,郭连升.“互联网+”时代大数据技术在军事领域的应用[J].国防科技,2015,6(6):35-41.
[5] ALBERT R,JEONG H,BARABASI A L.Attack and errortolerance in complex networks [J].Nature,2000,406(6794):387-482.
[6] BRODER A,KUMAR R,MAGHOUL F,et al.Graph structure in the web [J].Computer Networks,2000,3(1-6):309-320.
[7] JEONG H,MASON S,BARABASI A L,et al.Lethality andcentrality in protein networks [J].Nature,2001,411(6833):41-42.
[8] DUNNE J A,WILLIAMS R J,MARTINEZ N D.Networkstructure and biodiversity loss in food webs:robustness increases with connectance [J].Ecology Letters,2002,5(4):558-567.
[9] NEWMAN M E J,FORREST S,BALTHROP J.Email net-works and the spread of computer viruses [J].Physical Review E Statistical Nonlinear & Soft Matter Physics,2002,66(3):1162-1167.
[10] ZHOU S,MONDRAGON R J.Redunadancy and Robustness of the AS-level Internet topology and its models [J].Electronics Letters,2004,40(2):151-152.
[11] WANG T,WU L L.Research on invulnerability of urban transit network based on complex network[J].Application Research of Computers,2010,27(11):4080-4086.(in Chinese) 汪涛,吴琳丽,基于复杂网络的城市公交网络抗毁性分析[J].计算机应用研究,2010,7(11):4080-4086.
[12] HOLME P,KIM B J,YOON C N,et al.Attack vulnerability of complex networks [J].Physical Review E Statistical Nonlinear &Soft Matter Physics,2002,65(5):634-649.
[13] WU J,TAN Y J.Study on measure of complex network invulnerability [J].Journal of Systems Engineering,2005,20(2):128-131.(in Chinese) 吴俊,谭跃进.复杂网络抗毁性测度研究[J].系统工程学报,2005,0(2):128-131.
[14] WU J,BARAHANA M,TAN Y J,et al.Natural connectivity of complex networks [J].Chinese Physics Letters,2010,27(7):078902.
[15] WU J,BARAHANA M,TANY J,et al.Spectral measure ofstructural robustness in complex networks [J].IEEE Transactions on Systems Man and Cybernetics Part A,2011,41(6):1244-1252.
[16] DEAN J,GHEMAWAT S.MapReduce:Simplified data proces-sing on large clusters[J].Communication of the ACM,2008,51(1):107-113.
[17] OUYANG M,FEI Q,YU M.Survey on Efficiency and Vulnerability of Complex Network [J].Computer Science,2008,35(6):1-4.(in Chinese) 欧阳敏,费奇,余明.复杂网络的功效性与脆弱性研究综述[J].计算机科学,2008,5(6):1-4.
[18] TAN Y J,WU J,DENG H Z.Progress in invulnerability of complex network [J],University of Shanghai for Science and Technology,2011,33(6):643-668.(in Chinese) 谭跃进,吴俊,邓宏钟.复杂网络抗毁性研究进展[J].上海理工大学学报,2011,3(6):643-668.
[19] DU Y H.The research of graph algorithm based on cloud computing [D].Beijing:Beijing University of Posts and Telecommunications,2011.(in Chinese) 杜雅红.基于云计算平台的图算法研究[D].北京:北京邮电大学计算机学院,2011.
[20] CAIDA.Topology:Macroscopic Internet Topology Data Kit (ArkITDK；restricted) [EB/OL].(2015-10-01) [2016-03-15] https://topo-data.caida.org.
[21] 汪小帆,李翔,陈关荣.复杂网络理论及其应用[M].北京:清华大学出版社,2006:10-11.
[22] XIE C,MAI L D,DU Z H,et al.Research and analysis of Parallel computing system speedup [J].Computer Engineering and Applications,2003,39(26):66-68.(in Chinese) 谢超,麦联叨,都志辉,等.关于并行计算系统中加速比的研究与分析[J].计算机工程与应用,2003,9(26):66-68.

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed