PLDA:AS级的Internet拓扑生成算法  

PLDA:AS-level Internet Topology Generating Algorithm

作　　者：朱志伯[1] 高飞[1] 

机构地区：[1]南通纺织职业技术学院信息系,南通226007

出　　处：《计算机工程》2010年第7期115-118,共4页Computer Engineering

摘　　要：Internet拓扑建模是进行Internet研究的基础。PLOD是一种AS级的Internet拓扑生成算法,但PLOD算法不能保证生成拓扑图的连通性,且存在"出度贷款过剩"现象。对PLOD算法进行改进,提出PLDA算法。在AS节点连接时添加连通性检测,并对出度大的AS节点实行优先连接,较好地解决PLOD算法存在的问题。实验结果表明,PLDA算法是有效可行的。Internet topology modeling is the foundation of lnternet performance research. Power-Law Out-Degree（PLOD） algorithm is an AS-level lnternet 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 oral-degrees. PLDA ensures the connectivity and mitigates the ＂credit overstock＂ problem. Experimental results indicate feasibility and efficiency of PLDA.

关 键 词：拓扑建模 出度贷款过剩 PLDA算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]