期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
PLDA:AS级的Internet拓扑生成算法 被引量:1
1
作者 朱志伯 高飞 《计算机工程》 CAS CSCD 北大核心 2010年第7期115-118,共4页
Internet拓扑建模是进行Internet研究的基础。PLOD是一种AS级的Internet拓扑生成算法,但PLOD算法不能保证生成拓扑图的连通性,且存在"出度贷款过剩"现象。对PLOD算法进行改进,提出PLDA算法。在AS节点连接时添加连通性检测,并... Internet拓扑建模是进行Internet研究的基础。PLOD是一种AS级的Internet拓扑生成算法,但PLOD算法不能保证生成拓扑图的连通性,且存在"出度贷款过剩"现象。对PLOD算法进行改进,提出PLDA算法。在AS节点连接时添加连通性检测,并对出度大的AS节点实行优先连接,较好地解决PLOD算法存在的问题。实验结果表明,PLDA算法是有效可行的。 展开更多
关键词 拓扑建模 出度贷款过剩 plda算法
下载PDF
HDNBS: An approach for search in decentralized and unstructured P2P
2
作者 贾兆庆 尤晋元 《Journal of Harbin Institute of Technology(New Series)》 EI CAS 2007年第5期629-633,共5页
Decentralized and unstructured peer-to-peer applications such as Gnutella are attractive because they require no centralized directories and no precise control over network topology or data placement. Search algorithm... Decentralized and unstructured peer-to-peer applications such as Gnutella are attractive because they require no centralized directories and no precise control over network topology or data placement. Search algorithm is the major component of the distributed system and its efficiency also does influence the systems performance. However the flooding-based query algorithm used in Gnutella produces huge traffic and does not scale well. Gnutella-like P2P topology has power-law characteristic, so a search algorithm was proposed based on high degree nodes of power-law network, High Degree Nodes-Based Search (HDNBS). Extensive simulation results show that this algorithm performs on power-law networks very well, achieves almost 100% success rates, produces O(logN) messages per query and can locate target file within O(lagN) hops. 展开更多
关键词 unstructured P2P search algorithm high degree walk power-law network
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部