非結構同儕網路上以特徵相似度為基準之搜尋方法

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：3

、訪客IP：3.17.28.48

姓名

張以洵(Yi-hsun Chang) 查詢紙本館藏

畢業系所

通訊工程學系

論文名稱

非結構同儕網路上以特徵相似度為基準之搜尋方法
(Feature-based Similarity Search ApproachFeature-based Similarity Search Approach in Unstructured Peer-to-Peer Network)

相關論文

★ 以階層式叢集聲譽為基礎之行動同儕網路拓撲架構	★ 線上RSS新聞資料流中主題性事件監測機制之設計與實作
★ 耐延遲網路下具密度感知的路由方法	★ 整合P2P與UPnP內容分享服務之家用多媒體閘道器：設計與實作
★ 家庭網路下簡易無縫式串流影音播放服務之設計與實作	★ 耐延遲網路下訊息傳遞時間分析與高效能路由演算法設計
★ BitTorrent P2P 檔案系統下載端網路資源之可調式配置方法與效能實測	★ 耐延遲網路中利用訊息編碼重組條件之資料傳播機制
★ 耐延遲網路中基於人類移動模式之路由機制	★ 車載網路中以資料匯集技術改善傳輸效能之封包傳送機制
★ 適用於交叉路口環境之車輛叢集方法	★ 車載網路下結合路側單元輔助之訊息廣播機制
★ 耐延遲網路下以靜態中繼節點（暫存盒）最佳化訊息傳遞效能之研究	★ 耐延遲網路下以動態叢集感知建構之訊息傳遞機制
★ 跨裝置影音匯流平台之設計與實作	★ 耐延遲網路下基於封包複製模式的路由機制之模擬及效能比較

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

至系統瀏覽論文 ( 永不開放)

摘要(中)

本論文提出一套在非結構同儕網路上以特徵相似度為基準之搜尋方法，此方法設計上以構成物件名稱的關鍵字為該物件之特徵，同儕之間利用自身所擁有物件的特徵，計算和其它同儕之間語義上的距離，建構一個語義性重疊網路(Semantic Overlay Network；SON)，縮短具有共同興趣的同儕在語義網路上的距離，使得詢問訊息能有目標地在一個局部範圍內傳遞，減少詢問訊息傳送所產生的網路流量負載(traffic overhead)。
此方法也同時考量同儕系統內物件具有不同的冷門或熱門的特性，提出以特徵相似性來決定詢問訊息傳送的對象的同儕評比機制，並且搭配快取檢索機制來促進熱門請求物件的傳送，最後，本研究整合上述之方法提出一套可適性並行搜尋演算法，模擬結果顯示在靜態語義重疊網路上，並行搜尋演算法能達到與Flooding方法相近的搜尋命中率，並大幅減少詢問訊息數量。
關鍵字：同儕網路, 搜尋相似度, 語義重疊網路, 同儕評比

摘要(英)

This paper proposes a keyword-based search approach based on search similarity in unstructured peer-to-peer networks. Peers extract the keyword terms from object names as the objects’ features. With the feature similarity among peers’ objects, they compute semantic distance between any two peers, and then collectively construct a semantic overlay network (SON). Peers with common access/request interests can be relatively close with shorter distances. This property can used to guide the search requests to be routed in semantic vicinity where target objects could be found, and thus reduce traffic overhead to some extent.
Consider the property of object popularity, i.e., popular vs. unpopular objects. This study designs a peer ranking mechanism based on the feature-based similarity which can be used to route queries efficiently and also proposes a cache index mechanism which can improve the forwarding of queries for popular objects. With all above, this paper therefore designs an adaptive parallel search approach. Simulation results show that the proposed search mechanism can not only improve the hit rate close to that by the flooding approach, but also significantly reduce the amount of query messages.
Keywords: Peer-to-peer networks, Search similarity, Semantic overlay network, Peer ranking

關鍵字(中)

★ 同儕評比
★ 同儕網路
★ 搜尋相似度
★ 語義重疊網路

關鍵字(英)

★ Peer-to-peer networks
★ Search similarity
★ Semantic overlay network
★ Peer ranking

論文目次

摘要 I
ABSTRACT II
表目錄 V
圖目錄 VI
第一章緒論 1
1.1 研究背景 1
1.2 研究動機與目的 2
1.3 論文結構 3
第二章　相關論文 4
第三章　系統設計 6
3.1 系統描述 6
3.2 特徵分類演算法 8
3.3 靜態語義性重疊網路(SON)建構 16
3.4 請求向量GQ與節點命中率向量HI* 19
3.5 同儕評比機制(PEER RANKING MECHANISM) 21
3.6 可適性並行搜尋演算法 22
第四章模擬驗證 27
4.1 模擬環境 27
4.2 WALKER數目對搜尋命中率的影響 28
4.3 FEATURE-SIMILARITY-BASED搜尋方法與FLOODING搜尋方法之比較 31
第五章　結論與未來研究工作 35
5.1結論 35
5.2未來研究工作 35
參考文獻 37

參考文獻

[1] The cooperative association for Internet data analysis (CAIDA), “ Internet traffic classification,” online available: http://www.caida.org/research/traffic-analysis /classification-overview/, 2009.
[2] S. Androutsellis-Theotokis, and D. Spinellis, “A survey of peer-to-peer content distribution technologies,” ACM Computing Surveys, vol. 36, no. 4, pp. 335-371, 2004.
[3] Napster Inc., Napster Website, http://home.napster.com/.
[4] I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, “Chord: A scalable peer-to-peer lookup service for internet applications,” in Proceedings of SIGCOMM, pp. 149–160, San Diego, CA, Aug 2001.
[5] A. Rowstron and P. Druschel, "Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems," in Proc. Middleware 2001, Germany, November 2001.
[6] B.Y. Zhao, H. Ling, J. Stribling, S.C. Rhea, A.D. Joseph, and J.D. Kubiatowicz, “Tapestry: A Resilient Global-Scale Overlay for Service Deployment,” in IEEE J. Selected Areas in Comm., vol. 22, no. 1, pp. 41-53, 2004.
[7] “Gnutella,” http://www.gnutella.com.
[8] W. Acosta and S. Chandra, “Understanding the practical limits of the gnutella p2p Systems: An analysis of query terms and object name distributions,” in Proceedings of the ACM/SPIE Multimedia Computing and Networking (MMCN’ 08), San Jose, CA, April 2008.
[9] “The phex gnutella client.” http://phex.kouk.de.
[10] X. Li and J. Wu. “Searching techniques in peer-to-peer networks,” J. Wu, editor, Handbook of Theoretical and Algorithmic Aspects of Ad Hoc, Sensor, and Peer-to-Peer Networks, Auerbach, New York, USA, 2006.
[11] J. Mischke and B. Stiller, “A Methodology for the Design of Distributed Search in P2P Middleware,” IEEE Networks, vol. 18, no. 1, Jan-Feb, 2004.
[12] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A scalable content addressable network,” in Proceedings of the ACM SIGCOMM’01, 161–172, 2001.
[13] A. Crespo and H. Garcia-Molina, “Routing Indices For Peer-to-Peer Systems,” in Proc. of Int. Conf. on Distributed Computing Systems, Vienna, Austria, 2002.
[14] V. Kalogeraki, D. Gunopulos, and D. Zeinalipour-yazti, “A local search mechanism for peer-to-peer networks,” in Proc. of the 11th ACM Conference on Information and Knowledge Management (CIKM’02), 2002.
[15] S. Ciraci, I. Korpeoglu, and O. Ulusoy, “Reducing query overhead through route learning in unstructured peer-to-peer network,” Journal of Network and Computer Applications, vol.32, pp.550-567, 2008.
[16] S. Voulgaris, A.M. Kermarrec, L. Massoulie, and M. van Steen, “Exploiting semantic proximity in p2p content searching,” in Proceedings of the 10th International Workshop on Future Trends in Distributed Computing Systems, China, 2004.
[17] ND Doulamis, PN Karamolegkos, A Doulamis, and I Nikolakopoulos, “Exploiting semantic proximities for content search over p2p networks,” Computer Communications, v.32 n.5, pp.814-827, March, 2009
[18] R. Siebes and S. Kotoulas, “pRoute: Peer selection using shared term similarity matrices,” Journal of Web Intelligence and Agent Systems, vol.5, no.1, pp.89–107, 2007.
[19] E. Cohen, A. Fiat, and H. Kaplan, “Associative Search in Peer-to-Peer Networks: Harnessing Latent Semantics,” in Proc. IEEE INFOCOM, 2003.
[20] D. Tsoumakos, and N. Roussopoulos, “Adaptive probabilistic search in peer-to-peer networks,” in Proc. of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS’03), 2003.
[21] G. Salton, “Automatic Text Processing”, Addison-Wesley Publishing Company, 1989.

指導教授

胡誌麟(Chih-lin Hu)

審核日期

2010-8-27

推文