王勝德臺灣大學：電機工程學研究所江尚峰Chiang, Shang-FengShang-FengChiang2007-11-262018-07-062007-11-262018-07-062007http://ntur.lib.ntu.edu.tw//handle/246246/52953近年有些index caching的機制被應用於改善Gnutella-like P2P網路的scalability，其中部份research也修改了網路架構以及搜尋(search)方式以配合其index caching的機制。Index caching的方式可以大幅減少搜尋受歡迎物件的traffic，但是在網路上存有過多相同的index是其一個問題點。 在我們的Active Index Diffusing scheme，我們嘗試將各物件的index數量作平均化。被要求率接近的資源，他們的index會被群聚在一起，搜尋也會優先連去存有較高被要求率的index的節點。模擬的結果顯示出我們的架構可以提供更高的搜尋成功率比，搜尋的花費也是有顯著的減少。In order to improve the scalability and reduce the traffic of Gnutella-like unstructured peer-to-peer networks, index caching mechanisms had been discussed in recent years. Some of them had modified the network architecture and adapted existing search methods for their mechanisms. Although the traffic of querying popular keywords could be reduced by using index caching mechanisms, the cached indices too redundant replications in the whole network. We try to make the amount of indices fair for each file name in our index diffusing scheme. In our scheme, the indices with similar request rate would be grouped together, and the peers of the group who have indices with higher request rate will receive query messages earlier. In the simulations, our architecture could perform queries with higher success rates than existing research in multilayer peer-to-peer networks, and the traffic is also decreasing conspicuously.List of Tables . . . . . . . . . . . . . . . . . . . . . . . . . . . . vii List of Figures . . . . . . . . . . . . . . . . . . . . . . . . . . . . viii Chapter 1 Introduction . . . . . . . . . . . . . . . . . . . . . 1 1.1 History and Characteristic . . . . . . . . . . . . . . . . . . . . 1 1.2 Categorizations . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.3 Index Caching Mechanism . . . . . . . . . . . . . . . . . . . . 4 1.4 Multilayer Peer-to-Peer Network . . . . . . . . . . . . . . . . . 4 Chapter 2 Related Works . . . . . . . . . . . . . . . . . . . . 6 2.1 Why Not Use DHT . . . . . . . . . . . . . . . . . . . . . . . . 6 2.2 Blind Search Methods . . . . . . . . . . . . . . . . . . . . . . 7 2.3 Informed Search Methods . . . . . . . . . . . . . . . . . . . . 9 2.4 Caching Mechanisms . . . . . . . . . . . . . . . . . . . . . . . 10 2.5 Population of File . . . . . . . . . . . . . . . . . . . . . . . . . 11 Chapter 3 Approaches . . . . . . . . . . . . . . . . . . . . . . 12 3.1 Request Popularity and Disposition . . . . . . . . . . . . . . . 12 3.2 Central Control of Indices . . . . . . . . . . . . . . . . . . . . 13 3.2.1 Clustering peers who share the same file name . . . . . 15 3.2.2 Index update when hit occurs the index . . . . . . . . 16 3.2.3 Actively diffusing indices . . . . . . . . . . . . . . . . . 16 3.2.4 Copy indices when peer joins . . . . . . . . . . . . . . 17 3.3 Network Architecture . . . . . . . . . . . . . . . . . . . . . . . 18 3.4 Search Methods . . . . . . . . . . . . . . . . . . . . . . . . . . 19 3.4.1 Flooding Size and Success Rate . . . . . . . . . . . . . 19 3.4.2 Flooding of Query . . . . . . . . . . . . . . . . . . . . 20 3.4.3 Modified Search Methods . . . . . . . . . . . . . . . . 23 Chapter 4 Simulations and Results . . . . . . . . . . . . . . 26 4.0.4 Simulation Environment . . . . . . . . . . . . . . . . . 26 4.0.5 Experimental Results . . . . . . . . . . . . . . . . . . . 27 Chapter 5 Conclusion . . . . . . . . . . . . . . . . . . . . . . 34 Appendix A References . . . . . . . . . . . . . . . . . . . . . 35473307 bytesapplication/pdfen-US點對點網路peer-to-peer networkthesishttp://ntur.lib.ntu.edu.tw/bitstream/246246/52953/1/ntu-96-J93921043-1.pdf