首页 | 本学科首页   官方微博 | 高级检索  
     

PLDA:AS级的Internet拓扑生成算法
引用本文:朱志伯,高飞.PLDA:AS级的Internet拓扑生成算法[J].计算机工程,2010,36(7):115-118.
作者姓名:朱志伯  高飞
作者单位:南通纺织职业技术学院信息系,南通,226007
摘    要:Internet拓扑建模是进行Internet研究的基础。PLOD是一种AS级的Internet拓扑生成算法,但PLOD算法不能保证生成拓扑图的连通性,且存在“出度贷款过剩”现象。对PLOD算法进行改进,提出PLDA算法。在AS节点连接时添加连通性检测,并对出度大的AS节点实行优先连接,较好地解决PLOD算法存在的问题。实验结果表明,PLDA算法是有效可行的。

关 键 词:拓扑建模  出度贷款过剩  PLDA算法
修稿时间: 

PLDA: AS-level Internet Topology Generating Algorithm
ZHU Zhi-bo,GAO Fei.PLDA: AS-level Internet Topology Generating Algorithm[J].Computer Engineering,2010,36(7):115-118.
Authors:ZHU Zhi-bo  GAO Fei
Affiliation:(Department of Information, Nantong Textile Vocational Technology College, Nantong 226007)
Abstract:Internet topology modeling is the foundation of Internet performance research.Power-Law Out-Degree(PLOD) algorithm is an AS-level Internet topology generating algorithm.But it cannot guarantee the connectivity of the topology and has the credit overstock problem.Based on PLOD,Power-Law Degree Algorithm(PLDA) is proposed.It adds the connectivity check and gives link preference to nodes which have more out-degrees.PLDA ensures the connectivity and mitigates the credit overstock problem.Experimental results in...
Keywords:topology modeling  out-degree credit overstock  Power-Law Degree Algorithm(PLDA)
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号