摘要
拓扑建模是网络性能研究的关键技术。层次性和幂率分布是大型网络拓扑结构的两个固有的性质,现有的拓扑模型只反映了其中的某一个性质。将幂率分布规律和层次型拓扑生成算法结合起来,提出了一种基于幂率的层次型网络拓扑生成算法HIPL。实验通过对群集系数、直径、平均度数等拓扑参数的比较,表明了HIPL的可行性和有效性。
Network topology, modelling is the foundation in network performance research. Hierarchy and power-law degree distribution are two inherent properties of network topology. Current models have only captured one between them. Through integrating power-law distribution rule and hierarchical topology generating algorithm together, we introduce a hierarchical network topology generating algorithm based on powerlaw which is given the name of HIPL. By comparing the topology parameters such as clustering coefficient, diameter, average degree and so on in the experiments,it indicated the feasibility and efficiency of HIPL.
出处
《计算机应用与软件》
CSCD
北大核心
2008年第11期247-248,252,共3页
Computer Applications and Software
关键词
幂率
层次型
HIPL
群集系数
Power law Hierarchical HIPL Clustering coefficient
