节点文献
一种遵循幂率分布的网络拓扑生成算法PLOD~+
Network Topology Generating Algorithm for Power-Laws PLOD~+
【摘要】 拓扑建模是进行网络性能研究的基础。PLOD是一种基于幂率的网络拓扑生成算法,但该算法不能保证生成拓扑图的连通性,且存在“出度贷款过剩”现象。对PLOD算法进行了改进,在节点连接时添加了连通性检测,并对出度大的节点实行优先连接,较好地解决了PLOD算法存在的问题。实验结果表明了PLOD+算法的可行性和有效性。
【Abstract】 Network topology modeling is the foundation of network performance research.PLOD is a network topology generating algorithm for power-laws.But PLOD cannot guarantee the connectivity of the topology.Furthermore,PLOD has the "credit overstock" problem.Based on PLOD,PLOD+ added the connectivity check and gave link preference to nodes which have more out-degrees.PLOD+ ensures the connectivity and mitigates the "credit overstock" problem.The experiment indicates feasibility and efficiency of PLOD+.
【关键词】 拓扑建模;
幂率;
出度贷款过剩;
PLOD+;
【Key words】 network topology modeling; power law; credit overstock; PLOD+;
【Key words】 network topology modeling; power law; credit overstock; PLOD+;
【基金】 国家自然科学基金资助项目(602730350);国防科工委应用基础基金资助项目(K1704060511)
- 【文献出处】 计算机应用研究 ,Application Research of Computers , 编辑部邮箱 ,2007年04期
- 【分类号】TP393.01
- 【被引频次】8
- 【下载频次】213