本文選題：云計算 + 對等網(wǎng)絡(luò)�。� 參考：《計算機(jī)工程與設(shè)計》2013年10期

【摘要】：定義了云服務(wù)器為P2P網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu)的基本節(jié)點,引進(jìn)Chord協(xié)議對其進(jìn)行資源定位與搜索。由于Chord算法一方面沒有考慮節(jié)點異構(gòu)的問題,另一方面其查詢路由表存在著較大的冗余信息,因此從這兩方面著手,對Chord算法進(jìn)行了改進(jìn)。建立了一個基于主從式結(jié)構(gòu)的多Chord環(huán)模型,對環(huán)中節(jié)點的查詢路由表進(jìn)行分析研究,提出一個新的路由表計算公式,在刪除冗余信息的基礎(chǔ)上,充分利用查詢路由表的空間資源,將節(jié)點的路由查找的覆蓋范圍從Chord環(huán)的1/2提升到3/4,最終提升到整個Chord環(huán)。實驗結(jié)果表明,改進(jìn)后的算法在平均路由跳數(shù)和平均網(wǎng)絡(luò)延遲都有明顯的減少,從而提高了資源搜索的效率。
[Abstract]:This paper defines cloud server as the basic node of P2P network topology, and introduces Chord protocol to locate and search its resources. Since the Chord algorithm does not consider the problem of heterogeneous nodes on the one hand, and the routing table query has a large amount of redundant information on the other hand, the Chord algorithm is improved from these two aspects. A multi- ring model based on master-slave structure is established. The query routing table of nodes in the ring is analyzed and studied. A new formula for calculating the routing table is proposed, on the basis of deleting redundant information. By making full use of the spatial resources of the query routing table, the coverage of routing lookup of nodes is raised from 1 / 2 of the Chord loop to 3 / 4, and finally to the whole Chord ring. Experimental results show that the improved algorithm can significantly reduce the average number of routing hops and the average network delay, thus improving the efficiency of resource search.
【作者單位】： 重慶郵電大學(xué)計算機(jī)科學(xué)與技術(shù)學(xué)院;
【分類號】：TP393.02

【參考文獻(xiàn)】

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

1 姜守旭;韓希先;李建中;;基于超節(jié)點的Chord系統(tǒng)[J];小型微型計算機(jī)系統(tǒng);2007年02期

相關(guān)博士學(xué)位論文 前1條

1 賈兆慶;非結(jié)構(gòu)化P2P中搜索算法及信任機(jī)制研究[D];上海交通大學(xué);2008年

【共引文獻(xiàn)】

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

1 米洪;鄭瑩;張，

本文編號：1797086