請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/32621
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 周承復(Cheng-Fu Chou) | |
dc.contributor.author | Shuo-Chan Tsai | en |
dc.contributor.author | 蔡碩展 | zh_TW |
dc.date.accessioned | 2021-06-13T04:12:26Z | - |
dc.date.available | 2008-07-28 | |
dc.date.copyright | 2006-07-28 | |
dc.date.issued | 2006 | |
dc.date.submitted | 2006-07-24 | |
dc.identifier.citation | [1] “www.napster.com.”
[2] “www.kazza.com.” [3] “www.bittorrent.com.” [4] R. Zhang and Y. C. Hu, “Assisted peer-to-peer search with partial indexing,” INFOCOM, March 2005. [5] A. P, A. D, and V. A.N, “Small world distributed access of multimedia data: an indexing system that mimics social acquaintance networks,” Signal Processing Magazine, IEEE , vol.23, no.2pp, pp. 142– 153, Mar, 2006. [6] “www.gnutella.com.” [7] H. Zhang, A. Goel, and R. Govindan, “Using the small-world model to improve freenet performance,” SIGCOMM Comput. Commun. Rev., vol. 32, no. 1, pp. 79– 79, 2002. [8] Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, “Search and replication in unstructured peer-to-peer networks,” Proceedings of the 16th international conference on Supercomputing, pp. 84–95, 2002. 44 BIBLIOGRAPHY [9] A. Crespo and H. Garcia-Molina, “Routing indices for peer-to-peer systems,” Distributed Computing Systems, 2002. Proceedings. 22nd International Conference on, pp. 23–32, 2002. [10] K. P. Gummadi, R. J. Dunn, S. Saroiu, S. D. Gribble, H. M. Levy, and J. Zahorjan, “Measurement, modeling, and analysis of a peer-to-peer file-sharing workload,” in SOSP ’03: Proceedings of the nineteenth ACM symposium on Operating systems principles. New York, NY, USA: ACM Press, 2003, pp. 314–329. [11] M. Ripeanu and I. Foster, “Mapping the Gnutella Network: Macroscopic Properties of Large-Scale Peer-to-Peer Systems,” First International Workshop on Peer-to-Peer Systems (IPTPS), vol. 68, 2002. [12] I. Clarke, O. Sandberg, B. Wiley, and T. Hong, “Freenet: A distributed anonymous information storage and retrieval system,” Workshop on Design Issues in Anonymity and Unobservability, vol. 320, 2000. [13] I. Stoica, R. Morris, D. Karger, M. Kaashoek, and H. Balakrishnan, “Chord: A scalable peer-to-peer lookup service for internet applications,” Proceedings of the 2001 SIGCOMM conference, vol. 31, no. 4, pp. 149–160, 2001. [14] A. Rowstron and P. Druschel, “Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems,” in IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Nov. 2001, pp. 329–350. [15] D. J. Watts and S. H. Strogatz, “Collective dynamics of small-world networks,” Nature 393, pp. 202–204, 1998. [16] A. Oram, Peer-to-Peer: Harnessing the Power of Disruptive Technologies, A. Oram, Ed. Sebastopol, CA, USA: O’Reilly & Associates, Inc., 2001. 45 BIBLIOGRAPHY [17] M. Ehrig, P. Haase, R. Siebes, S. Staab, H. Stuckenschmidt, R. Studer, and C. Tempich, “The swap data and metadata model for semantics-based peer-to-peer systems.” [Online]. Available: citeseer.ist.psu.edu/article/ehrig03swap.html [18] Z. Zhang, S. Shi, and J. Zhu, “Somo: Self-organized metadata overlay for resource management in p2p dht,” 2003. [19] W. Nejdl, B. Wolf, C. Qu, S. Decker, M. Sintek, A. Naeve, M. Nilsson, M. Palmer, and T. Risch, “Edutella: a p2p networking infrastructure based on rdf,” in WWW ’02: Proceedings of the 11th international conference on World Wide Web. New York, NY, USA: ACM Press, 2002, pp. 604–615. [20] A. Rapoport, “Mathematical models of social interaction,” Handbook of Mathematical Psychology, Volume 2, pp. 493–579, 1963. [21] S. Milgram, “The small world problem,” Psychology Today, vol. 2, no. 1, pp. 60–67, 1967. [22] J. Travers and S. Milgram, “An Experimental Study of the Small World Problem,” Sociometry, vol. 32, no. 4, pp. 425–443, 1969. [23] M. Buchanan, Nexus: Small Worlds and the Groundbreaking Science of Networks. W. W. Norton & Company, 2002. [24] “www.cs.bu.edu/brite/.” | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/32621 | - |
dc.description.abstract | 近幾年來,由於計算機的能力和網路的頻寬都快速地成長,同儕網路系統正蓬勃的發展現今最熱門的應用非檔案分享莫屬。而同儕網路搜尋技術也不斷的在改進當中,從同儕網路系統的始祖Napster,到後來慢慢發展出來的Gnutella、Kazaa,一直到現在最熱門的BitTorrent、Emule等等。近年來,許多的研究引入``小世界理論',以社群網路來模擬同儕網路,並獲得不錯的成效。但是``小世界理論'只考慮使用者之間的相似度,並未考慮到實際網路的狀況。因此,在資料下載時,並不能保證可以獲得最佳的效率。有鑑於此,我們提出一個以``小世界理論'為基礎的同儕網路搜尋系統,並考慮各種的網路因素,期使能同時保證搜尋時的效率以及下載時的品質。
更進一步地,我們更深入地探討中繼資料對於同儕網路搜尋系統的影響。在某些狀況之下,使用者可以使用中繼資料來協助搜尋的工作。比方使用者需要搜尋一些未知名字的資料,或是想利用中繼資料來加快搜尋的速度,例如由不同歌手手演唱的同一首歌曲,或是兩首歌名相同的歌曲等等。因此,我們將中繼資料對於搜尋效能的影響作深入的探討,以及討論哪些中繼資料對於同儕網路搜尋最有幫助。 我們透過系統模擬的方式來評估本文所提出方法之效能。除了本文提出的方法外,我們另外比較其他幾種的同儕網路搜尋架構。實驗結果顯示我們的機制可以同時提升搜尋的效率,並改善資料取得之傳輸品質。 | zh_TW |
dc.description.abstract | In recent years, as the network capacity becomes wider and the computation capability becomes more powerful, Peer-to-Peer applications have become very prevalent. The most popular application for P2P today is file sharing. P2P file sharing approaches have been constantly improved. From the earliest search approach - Napster, to the recent Gnutella, Kazaa, and BitTorrent. More recently, much research works put ``Small World' theory into P2P search systems to simulate the social networks. But ``Small World' theory builds the structure only based on similarity between peers, and does not reflect the network conditions. Similar peer may not provide satisfactory quality of service as content downloading. Thus, we want to incorporate network factors
into ``Small World' theory to improve the efficiency of both content search and content retrieval. Furthermore, we propose the search structure allows users to search by metadata of content. In some circumstances, users could adapt metadata to speed up P2P search. For example, users may want to search a song, but he does not know it name, or sometimes two different song with the same name. Thus, we evaluate the effect of metadata on the efficiency of P2P search, and discuss which metadata is appropriate for P2P search. We evaluate the performance of the scheme via simulations. Results show that our approaches can improve content search and retrieval efficiency, and the structure built by the metadata with moderate dimension can achieve better performance. | en |
dc.description.provenance | Made available in DSpace on 2021-06-13T04:12:26Z (GMT). No. of bitstreams: 1 ntu-95-R93922069-1.pdf: 605677 bytes, checksum: 0d36e319e80c57fec0c87de4a3ae5505 (MD5) Previous issue date: 2006 | en |
dc.description.tableofcontents | 1 Introduction 1
1.1 Background . . . . . . . . . . . . . . . . . . . . . . .1 1.2 Research Issues . . . . . . . . . . . . . . . . . . . . 4 1.3 Our Contribution . . . . . . . . . . . . . . . . . . . 5 1.4 Thesis Organization . . . . . . . . . . . . . . . . . . 5 2 Related Works 6 2.1 Unstructured P2P Search System . . . . . . . . . . . . 6 2.2 Structured P2P Search System. . . . . . . . . . . . . . 7 2.3 Interest-Based P2P Search System . . . . . . . . . . . .8 2.4 Search in P2P Overlays withmetadata . . . . . . . . . . 9 3 P2P Search System Based On Small-World Theory 10 3.1 SmallWorld Theory . . . . . . . . . . . . . . . . . . .10 3.2 SystemDescription . . . . . . . . . . . . . . . . . . .12 3.3 Node Join and Registration . . . . . . . . . . . . . . 12 3.4 Information Collection . . . . . . . . . . . . . . . . 13 3.5 Similarity Graph Generation . . . . . . . . . . . . . .14 3.6 P2P Search Using Similarity Graph . . . . . . . . . . .14 3.7 SystemRecovery . . . . . . . . . . . . . . . . . . . . 15 3.8 Other Issues . . . . . . . . . . . . . . . . . . . . . 15 4 Metadata-assisted P2P Search System 17 4.1 Our Intuitive Idea . . . . . . . . . . . . . . . . . . 17 4.2 SystemDescription . . . . . . . . . . . . . . . . . . .17 4.2.1 Linear Combination ofMetadata . . . . . . . . . . . .19 4.3 Metadata Collection . . . . . . . . . . . . . . . . . .20 4.4 Similarity Graph Generation . . . . . . . . . . . . . .20 4.5 P2P Search Using Similarity Graph . . . . . . . . . . .21 5 Performance Evaluation and Discussion 22 5.1 Simulation Environment and Setup . . . . . . . . . . . 22 5.1.1 Network Topology . . . . . . . . . . . . . . . . . . 22 5.1.2 Multimedia Data DistributionModels . . . . . . . . . 23 5.1.3 Metadata DistributionModels . . . . . . . . . . . . .24 5.1.4 QueryModels . . . . . . . . . . . . . . . . . . . . .25 5.1.5 SimulationMetrics . . . . . . . . . . . . . . . . . .25 5.2 The Simulation Results of P2P Search System Based on “Small World”Theory . . . . . . . . . . . . . . . . . . .26 5.2.1 Search Levels . . . . . . . . . . . . . . . . . . . .26 5.2.2 Degree of Similarity Graph . . . . . . . . . . . . . 30 5.2.3 Performance Degradation . . . . . . . . . . . . . . .33 5.2.4 Keeping Information of One-Hop Neighbors . . . . . . 34 5.2.5 Transmission Time . . . . . . . . . . . . . . . . . .35 5.2.6 Overhead of Graph Generation . . . . . . . . . . . . 35 5.3 The Simulation Results of Metadata-Assisted P2P Search System . . . . 36 5.3.1 Success Ratio . . . . . . . . . . . . . . . . . . . .36 5.3.2 Precision Rate . . . . . . . . . . . . . . . . . . . 38 5.3.3 Overhead of Returned Candidate Files . . . . . . . . 40 6 Conclusions 43 Bibliography 44 | |
dc.language.iso | en | |
dc.title | 以小世界理論為基礎之中繼資料輔助同儕網路搜尋系統 | zh_TW |
dc.title | Metadata-Assisted Peer-to-Peer Search Based on Small World Theory | en |
dc.type | Thesis | |
dc.date.schoolyear | 94-2 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 楊佳玲(Chia-Lin Yang),陳伶志(Ling-Jyh Chen),蔡子傑(Tzu-Chieh Tsai) | |
dc.subject.keyword | 同儕網路,小世界理論,中繼資料, | zh_TW |
dc.subject.keyword | P2P network,small world,metadata, | en |
dc.relation.page | 46 | |
dc.rights.note | 有償授權 | |
dc.date.accepted | 2006-07-26 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 資訊工程學研究所 | zh_TW |
顯示於系所單位: | 資訊工程學系 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-95-1.pdf 目前未授權公開取用 | 591.48 kB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。