請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/28766
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 王勝德(Sheng-De Wang) | |
dc.contributor.author | Chun-Hung Wu | en |
dc.contributor.author | 巫駿宏 | zh_TW |
dc.date.accessioned | 2021-06-13T00:21:40Z | - |
dc.date.available | 2009-07-30 | |
dc.date.copyright | 2007-07-30 | |
dc.date.issued | 2007 | |
dc.date.submitted | 2007-07-25 | |
dc.identifier.citation | [1] B. Yang and H. Garcia-Molina, “Efficient Search in Peer-to-Peer Networks,” in Proc. Int. Conf. Distributed Computing Systems, 2002, pp. 5 – 15.
[2] Yunhao Liu, Zhenyun Zhuang, Li Xiao and Lionel M. Ni, “A Distributed Approach to Solving Overlay Mismatching Problem” in Proc. ICDCS Conf., 2004, pp. 132 – 139. [3] Xin Yan Zhang, Qian Zhang, Zhensheng Zhang, Gang Song, and Wenwu Zhu, “A Construction of Locality-Aware Overlay Network: mOverlay and Its Performance,” IEEE JNL. Selected Areas in Communications, vol. 22, no. 1, Jan. 2004, pp. 18 – 28. [4] Chi-Hong Chao,“AN INTEREST-BASED ARCHITECTURE FOR PEER-TO-PEER NETWORK SYSTEMS,” in Proc. Int. Conf. AINA, April. 2006. [5] Shang-Feng Chiang, Chun-Hung Wu, and Sheng-De Wang , “Active Index Diffusion in Multilayer Unstructured Peer-to-Peer Networks,” in CTHPC Conf., 2007. [6] Hung-Chang Hsiao and Hao Liao, “The Peering Problem in Tree-Based Master/Worker Overlays,” in Proc. Int. GPC Conf., May. 2006, pp. 83 – 92. [7] E. Cohen and S. Shenker, “Replication Strategies in Unstructured Peer-to-Peer Networks,”in Proc. ACM SIGCOMM Conf., 2002, pp. 177 – 190. [8] Weisheng Si, and MingChu Li, “On the Connectedness of Peer-to-Peer Overlay Networks,” in Proc. Int. ICPADS Conf., 2005, pp. 474 – 480. [9] XinYan Zhang, Gang Song, Qian Zhang, Wenwu Zhu, Lixin Gao ,and Zhensheng Zhang, “Measurement-Based Construction of Locality-Aware Overlay Networks,” in IEEE Int. Conf., 2004, pp. 1401 – 1405. [10] Diego Doval and Donal O'Mahony, Overlay Networks Trinity Coll., Dublin, Ireland., July-Aug. 2003, Tech. Internet Computing, IEEE [11] Azer Bestavros, and Shudong Jin, “OSMOSIS: Scalable Delivery of Real-Time Streaming Media in Ad-Hoc Overlay Networks,” in Proc. Int. ICDCSW Conf., 2003, pp. 214 – 219. [12] Jianjun Zhang, Ling Liu, and Calton Pu, “Constructing a Proximity-Aware Power Law Overlay Network,”in Globecom Conf., 2005, pp. 5. [13] Hiroaki Kobayashi, Hiroyuki Takizawa, Tsutomu Inaba, and Yasuaki Takizawa, ” A Self-Organizing Overlay Network to Exploit the Locality of Interests for Effective Resource Discovery in P2P Systems,” in SAINT Conf., 2005, pp. 246 – 255. [14] James Z. Wang, and Matti A. Vanninen, “A Novel Self-Configuration Mechanism for Heterogeneous P2P Networks,” in IAT Conf., 2004, pp. 281 – 287. [15] Jawwad Shamsi, Monica Brockmeyer and Liya Abebe “TACON: Tactical Construction of Overlay Networks,”in GLOBECOM Conf., 2005, pp. 6. [16] Yinglin Sun, China Liang Sun, Xiaohui Huang, and Yu Lin, “Resource Discovery in Locality-aware Group-based Semantic Overlay of Peer-to-Peer Networks,” in InfoScale Conf., 2006, vol. 152. [17] Kwangwook Shin, and Seunghak Lee, “Grapes: Topology-based Hierarchical Virtual Network for Peer-to-Peer Lookup Services,” in Proc. Parallel Processing Workshops, 2002, pp. 159 – 164. [18] Li Xiao, Yunhao Liu, and Lionel M. Ni, “Improving Unstructured Peer-to-Peer Systems by Adaptive Connection Establishment,” in Computers IEEE Transactions, 2005, pp. 1091 – 1103. [19] Curt Cramer, Kendy Kutzner, and Thomas Fuhrmann, “BOOTSTRAPPING LOCALITY-AWARE P2P NETWORKS,” in Networks Proc. IEEE Int. Conf., 2004, pp. 357 – 361. [20] Saleh, O, Hefeeda, M “Modeling and Caching of Peer-to-Peer Traffic,” in Proc. IEEE Int. Conf. Network Protocols, Nov. 2006, pp. 249 – 258. [21] C. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, ”Search and Replication in Unstructured Peer-to-Peer Networks,” in Proc. ACM SIGMETRICS Int. Conf. Measurement and modeling of computer systems, Jun. 2002, pp.258 – 259. [22] S. Patro and Y.C. Hu, “Transparent Query Caching in Peer-to-Peer Overlay Networks,” in Proc. Int. Parallel and Distributed Processing Symp., 2003, pp. 22 – 26. [21] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A scalable content-addressable network,”in ACM SIGCOMM, Aug. 2001, pp. 161 – 172. [22] I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, “Chord: A scalable peer-to-peer lookup service for internet applications,” in ACM SIGCOMM, Aug. 2001, pp. 149 – 160. [23] A. Rowstron and P. Druschel, “Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems,” in IFIP/ACM Int. Conf. Distributed Systems Platforms, Nov. 2001, pp. 329 – 350. [24] S. Patro and Y.C. Hu, “Transparent Query Caching in Peer-to-Peer Overlay Networks,” in Proc. Int. Parallel and Distributed Processing Symp, 2003, pp. 32. [25] Q. Lv, S. Ratnasamy, and S. Shenker, “Can heterogeneity make Gnutella scalable?,” in IPTPS Conf., 2002, pp. 94 – 103. [26] Y.-H. Chu, S. G. Rao, and H. Zhang, “A case for end system multicast,” in ACM SIGMETRICS, June. 2000, pp. 1 – 12. [27] S. Banerjee, B. Bhattacharjee, and C. Kommareddy, “Scalable application layer multicast,” in ACM SIGCOMM, 2002, pp. 205 – 217. [28]B. Zhang, S. Jamin, and L. Zhang, “Host multicast: A framework for delivering multicast to end users,” in Proc. IEEE INFOCOM, vol. 3, June 2002, pp. 1366–1375. [29] S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, “Topologicallyaware overlay construction and server selection,” in Proc. INFOCOM, 2002, pp. 1190–1199. [30] Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker,“ Search and Replication in Unstructured Peer-to-Peer Networks,” in ACM Proc. Int. Conf. Supercomputing, 2002, pp. 84 – 95. [31] Z. Xu, C. Tang, and Z. Zhang, “Building Topology-Aware Overlays Using Global Soft-State,” in Proc. Int. Conf. Distributed Computing Systems, 2003, pp. 500 – 508. [34] A. Fisk. Gnutella dynamic query protocol v0.1, http://www9.limewire.com/developer/dynamic query.html, May 2003. | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/28766 | - |
dc.description.abstract | 近年來有很多研究想要改進點對點網路上面的覆蓋網路(overlay network)架構,雖然結構式點對點網路系統採用分散式雜湊表(DHT)可以比非結構式點對點網路系統使用泛流的方式有效率,但是由於雜湊函數先天的方式,不適合用來提供關鍵字搜尋這項機制,因此我們的架構還是採用非結構式點對點網路系統。另外一方面,為了解決topology mismatch的問題,目前在建置覆蓋網路的時候,大部份的研究會考慮侷限性(locality),我們把侷限性以及資源同時列入考慮。為了改進非結構式的點對點網路系統的搜尋效率,這邊同時利用檔案複製(Data Replication) 、選擇性傳送(Selective Search) 、叢集(Clustering)以及興趣群組(Interest Group)來改進系統效能。演算法分析說明了locating procedure的複雜度為 O(logN),N為覆蓋網路中的節點個數。實驗結果可以證明在我們提出的LARO演算法會比mOverlay有更好的訊息花費以及搜尋命中率。 | zh_TW |
dc.description.abstract | P2P overlay architectures are gaining more and more attention. Structured P2P network systems that use Distributed Hashing Tables (DHTs) can be more efficient than flooding based unstructured P2P network systems. But DHTs did not suit for key word search, so we choose using unstructured P2P networks as our architecture. In order to solve the topology mismatch problem, many people take account of locality information when designing peer-to-peer overlay networks. Here, we not only exploit locality but also take resource features into account. Taking advantage of concepts of data replication, selective search, clustering, and interest group can improve the search performance of unstructured P2P networks. Our analysis shows that the overhead of locating procedure is O (log N), and N is the number of peers in the overlay network. Simulation proves that our algorithm is better than the mOverlay network in the number of messages per search and the hit ratio. | en |
dc.description.provenance | Made available in DSpace on 2021-06-13T00:21:40Z (GMT). No. of bitstreams: 1 ntu-96-R94921109-1.pdf: 462175 bytes, checksum: 7b009c2f148cc9000e12613f0e7b7403 (MD5) Previous issue date: 2007 | en |
dc.description.tableofcontents | 第一章 緒論 1
1.1覆蓋網路(Overlay networks) 1 1.2 需要覆蓋網路的原因 3 1.3 在覆蓋網路中的Mismatch Problem 5 第二章 研究背景及相關研究 6 2.1 研究背景及相關研究 6 第三章 建立具侷限性以及資源相關性的覆蓋網路 9 3.1 基本概念 9 3.1.1 資源以及侷限性 9 3.1.2 兩層式的架構: 節點以及群組 10 3.1.3 混合式的架構: 檔案複製、選擇性的搜尋、叢集、以及興趣群組 11 3.2 Locating procedure 13 3.2.1 如何選取節點要加入的群組 13 3.2.2 演算法 14 第四章 基本的覆蓋網路運作 18 4.1加入到一個群組 18 4.2 形成一個新的群組 18 4.3 資訊的分享 19 第五章 搜尋方法 19 5.1 更改過的random walks 19 第六章 效能評估 20 6.1演算法分析 21 6.2效能分析 21 6.3覆蓋網路的強健度 23 6.4覆蓋網路的彈性度 24 第七章 模擬 25 7.1 檔案的分佈 25 7.2在不同檔案分佈下的模擬結果 26 7.2和亂數連接的覆蓋網路做比較 28 7.3和mOverlay做比較 29 第八章 結論 35 | |
dc.language.iso | zh-TW | |
dc.title | 具侷限以以及資源相關性的覆蓋網路 | zh_TW |
dc.title | Locality and Resource Aware Overlay Networks | en |
dc.type | Thesis | |
dc.date.schoolyear | 95-2 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 雷欽隆(Chin-Laung Lei),何建明(Jan-Ming Ho),王建民(Chien-Min Wang) | |
dc.subject.keyword | 覆蓋網路,侷限性,群組,節點,分散式雜湊表, | zh_TW |
dc.subject.keyword | overlay network,locality,gorup,node,DHT, | en |
dc.relation.page | 39 | |
dc.rights.note | 有償授權 | |
dc.date.accepted | 2007-07-27 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 電機工程學研究所 | zh_TW |
顯示於系所單位: | 電機工程學系 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-96-1.pdf 目前未授權公開取用 | 451.34 kB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。