以使用者興趣為基礎之具自我調整結構P2P系統之研究

A Study of a Peer-to-Peer System with Self-Adjusting Structure Based on Users' Interests

蘇祺勛(Chi-Shiun Su)

指導教授 ： 林敏勝

國立臺北科技大學/電資學院/電機工程系研究所/碩士(2009年)

https://doi.org/10.6841/NTUT.2009.00510

摘要

在近年來P2P(peer-to-peer)系統逐漸被用於網路上分享各種資源，尤其是應用於資料量較為龐大的資訊分享。而在龐大的資料量中，如何要有效率地找出所需要的資訊變成一個重要的議題。在於分散式非結構的P2P網路架構中，Gnutella，是一個最基本的搜尋系統，主要是使用flooding來進行搜尋，但是這個方法會造成網路上流量太多不必要的消耗，因此後續又演發出random-walk、cache等方法，來減少流量消耗。
但是以上這幾種方法都在於流量消耗以及搜尋效率這兩種主題打轉，而忽略了這種搜尋系統主要還是由使用者來發出查詢，因此基於小世界網路模型(small-world network model)的概念特性下，本篇論文提出了依使用者查詢時的興趣特性，來調整其整體網路連結，試圖來縮短搜尋路徑以及時間，並且減少網路的流量。

關鍵字

P2P(Peer-to-Peer)網路 ； 自我調整結構 ； 鄰近節點 ； 小世界網路模型

並列摘要

In recent years, P2P (Peer-to-Peer) systems are widely used to share and exchange files, especially for large ones, between peers. How to efficiently locate peers that are relevant for a given query is a central issue in P2P systems. In unstructured P2P networks, Gnutella is the most famous P2P system. Gnutella would waste a lot of bandwidth, since it uses flooding to locate and search resource. Furthermore, random-walk and cache were presented to reduce bandwidth and improve search efficiency. But all of these systems ignore the user’s background such as user’s interest and common behavior. Based on the small-world network model, this thesis proposes a new approach, which allows peers to dynamically change the topology according to user’s interest. Experimental results show that the proposed approach outperforms the prior works in terms of hit ratio, routing path, or packet flows.

並列關鍵字

P2P(Peer-to-Peer) network ； Self-Adjusting Structure ； neighbor ； small-world network model

參考文獻

[2] W.T. Chen, C.H. Chao, J.L. Chiang, "An interested-based architecture for peer-to-peer network systems," 20th International Conference on Advanced Information Networking and Applications, Vienna, 2006, pp.707-712.

[3] M. Portmann, P. Sookavatana, S. Ardon, A. Seneviratne, "The cost of peer discovery and searching in the Gnutella peer-to-peer file sharing protocol," Proc. 9th IEEE Int’l Conf. on Networks, 2001, pp.263-268.

[4] A. Crespo, H. Garcia-Molina, "Routing Indices for peer-to-peer systems," Proc. IEEE ICDCS, Vienna, 2002, pp.23-32.

[7] W. Wang, L. Zhao, R. Yuan, "Improving cooperation in peer-to-peer systems using social networks," 20th IEEE Parallel and Distributed Processing Symposium, Greece, 2006, pp.8.

[10] I. Stoica, et al., "Chord: A scalable peer-to-peer lookup service for internet applications, " Proc. of ACM SIGCOMM, San Diego, 2001, pp.149-160.