【摘要】：為了提高系統(tǒng)可靠性和查詢效率,提出了具有多管理節(jié)點(出口節(jié)點)的DHT分層模型,并給出了3種查詢算法:最短路徑選擇算法、基于熱土豆模型的最小化組內(nèi)流量算法和出口節(jié)點負載均衡選擇算法。通過仿真實驗對3種算法在查詢效率、流量分析和負載均衡3個維度進行了分析比較,基于熱土豆模型的最小化組內(nèi)流量算法具有最高的查詢效率,但是負載均衡性能最差,出口節(jié)點負載均衡選擇算法具有最好的負載平衡性,但查詢效率最低,最短路徑算法性能則介于上述兩種算法之間。同時對傳統(tǒng)分層結(jié)構(gòu)所采用的隨機查詢算法與基于熱土豆模型的最小化組內(nèi)流量和最短路徑查詢算法進行了性能對比。
[Abstract]:In order to improve system reliability and query efficiency, a hierarchical DHT model with multi-management nodes (exit nodes) is proposed, and three query algorithms are presented: shortest path selection algorithm. The algorithm of minimizing intra-group flow and load balancing selection algorithm based on hot potato model. Through the simulation experiments, the query efficiency, traffic analysis and load balancing of the three algorithms are analyzed and compared. The algorithm based on hot potato model has the highest query efficiency, but the worst load balancing performance. The load balancing selection algorithm of exit node has the best load balance, but the query efficiency is the lowest, and the performance of the shortest path algorithm is between the above two algorithms. At the same time, the performance of random query algorithm based on traditional layered structure is compared with that of minimizing intra-group flow and shortest path query algorithm based on hot potato model.
【作者單位】： 國網(wǎng)四川電科院信息通信安全技術(shù)監(jiān)督室;重慶大學(xué)信息物理社會可信服務(wù)計算教育部重點實驗室;西南交通大學(xué)信息科學(xué)與技術(shù)學(xué)院;
【基金】：國家自然科學(xué)基金青年資助項目(61402384)~~
【分類號】：TP393.02

【相似文獻】

相關(guān)期刊論文 前2條

1 鄧澤;馮丹;周可;施展;;一種面向結(jié)構(gòu)化P2P網(wǎng)絡(luò)的基于閑談的資源發(fā)現(xiàn)方法[J];電子學(xué)報;2010年11期

2 ;[J];;年期

，

本文編號：2190020