作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2010, Vol. 36 ›› Issue (7): 115-118. doi: 10.3969/j.issn.1000-3428.2010.07.040

• 网络与通信 • 上一篇    下一篇

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

朱志伯,高 飞   

  1. (南通纺织职业技术学院信息系,南通 226007)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2010-04-05 发布日期:2010-04-05

PLDA: AS-level Internet Topology Generating Algorithm

ZHU Zhi-bo, GAO Fei   

  1. (Department of Information, Nantong Textile Vocational Technology College, Nantong 226007)
  • Received:1900-01-01 Revised:1900-01-01 Online:2010-04-05 Published:2010-04-05

摘要: Internet拓扑建模是进行Internet研究的基础。PLOD是一种AS级的Internet拓扑生成算法,但PLOD算法不能保证生成拓扑图的连通性,且存在“出度贷款过剩”现象。对PLOD算法进行改进,提出PLDA算法。在AS节点连接时添加连通性检测,并对出度大的AS节点实行优先连接,较好地解决PLOD算法存在的问题。实验结果表明,PLDA算法是有效可行的。

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

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 indicate feasibility and efficiency of PLDA.

Key words: topology modeling, out-degree credit overstock, Power-Law Degree Algorithm(PLDA)

中图分类号: