經由社會網路改進點對點搜尋之效能; Improving P2P search performance through social network

NCUIR > College of Electrical Engineering & Computer Science > Graduate Institute of Computer Science and Information Engineering > Electronic Thesis & Dissertation > Item 987654321/9431

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/9431

Title:	經由社會網路改進點對點搜尋之效能;Improving P2P search performance through social network
Authors:	林易毅;Yi-Yi Lin
Contributors:	資訊工程研究所
Keywords:	超級節點;社會網路;點對;peer-to-peer;social network;super-peer
Date:	2007-06-25
Issue Date:	2009-09-22 11:47:37 (UTC+8)
Publisher:	國立中央大學圖書館
Abstract:	近年來由於資訊量的蓬勃發展，點對點的搜尋成為一個很熱門且很有潛力的研究議題。點對點的搜尋提供了一種新型的資源分享方式而且帶來了許多具有吸引力的特性，例如它提供了一種快速且方便使用的檔案分享方式並且分享相當大量的資源以及一種負載平衡的機制等等。無論如何它還是面臨了一項重大的挑戰，那就是要如何有效的在廣大的點對點網路中找到所需的資源。在社會網路中，人們通常利用兩種方法來來找到他們想要的資源，一種是問他們所認識且具有那些資源的相關知識的人，第二種方法是尋求他們朋友的幫助。無論如何點對點網路就是缺乏這種社會網路的特性，所以導致點對點的搜尋相當的沒有效率。所以我們提出一種社會學的方法去解決這個問題，在這裡節點就好像社會網路中的人而連線就好像是社會網路裡面的關係，我們去模仿人類獲取資源的行為來彌補點對點網路的不足。我們利用超級節點的結構去建構出具有相似喜好及背景的群組並藉由節點跟節點之間的互動來維持這些群組，讓節點可以將查詢詢問具有適合知識的群組以及尋求朋友節點的幫助。這個研究的結果說明了將社會網路的特性導入點對點網路中確實能有效的減短節點的查詢路徑並且使點對點的搜尋更加的有效率。 Recently, peer-to-peer (P2P) search is becoming a popular and potential research topic. It offers a new way for resource sharing and many attractive features, such as speedy and convenient file sharing method, more resources, load-balancing, etc. However, it also faces the important challenge that how to discover the resource in the huge P2P network. For resource discover in social networks, people always have two common approaches, one is asking the acquaintances with the knowledge about the resource, the other is seeking helps from his friends. However, the peer in the P2P network is lack the social characters, it making the queries routing inefficiently. So we present the social approach which imitates the human behaviors in social networks where peers are people and connections are relationships to enhance the search performance in P2P network. So we utilize the super-peer architecture to create preference groups and maintain the group by the interactions from peers. Therefore peer can query the peers in the relevant groups and route to its friend peer to seek helps. Results of this research demonstrate that applying social networks in P2P networks can shorten the length of routes and make the search more efficient.
Appears in Collections:	[Graduate Institute of Computer Science and Information Engineering] Electronic Thesis & Dissertation

Files in This Item:

File	Size	Format

社群 sharing

Loading...