Internet的复杂网络统计规律研究与分析  

Research and Analysis of Complex Networks Statistical Regularity for Internet

作　　者：关沫[1,2] 李波[3] 赵海[2] 

机构地区：[1]沈阳工业大学信息科学与工程学院 [2]东北大学复杂网络研究中心 [3]中国人民解放军65021部队

出　　处：《计算机工程》2008年第21期92-94,97,共4页Computer Engineering

基　　金：辽宁省博士科研启动基金资助项目(20071024)

摘　　要：运用CAIDA Skitter项目提供的Internet监测数据和统计手段对Internet的平均最短路径、节点度分布所具有的统计规律进行研究与分析。统计结果显示Internet的拓扑结构是不均匀的,其内部集聚程度较高,网络中任意2个节点间的最短距离很小,整个网络的平均最短路径约为14跳,且Internet节点的度分布服从幂律分布,证实了Internet不是一种随机网络,而是一种同时具有"小世界"和"无尺度"网络特征的复杂网络。Using the Internet monitoring data offered by CAIDA Skitter project and the method of statistics, the statistical regularity of average shortest path and node degree distribution of the Internet are studied and analyzed. Statistical result reveals the topology of the Internet is not homogeneous. It is a highly clustered network, which means the shortest distance between two random nodes is short. The average shortest path of the Internet is about 14 hops. The node degree distribution is power-law distribution. The statistical results also show that the Internet is not random network, but complex network with the characteristics of ＂small world＂ and ＂scale-free＂.

关 键 词：复杂网络 平均最短路径 幂律 度分布 无尺度 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]