請用此 Handle URI 來引用此文件：
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/28736完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 莊裕澤(Yuh-Jzer Joung) | |
| dc.contributor.author | Man-Ling Hung | en |
| dc.contributor.author | 洪曼玲 | zh_TW |
| dc.date.accessioned | 2021-06-13T00:20:08Z | - |
| dc.date.available | 2007-07-30 | |
| dc.date.copyright | 2007-07-30 | |
| dc.date.issued | 2007 | |
| dc.date.submitted | 2007-07-27 | |
| dc.identifier.citation | [1] V. Almeida, A. Bestavros, M. Crovella, and A. de Oliveira. Characterizing Reference Locality in the WWW. Parallel and Distributed Information Systems, 1996., Fourth International Conference on, pages 92–103, 1996.
[2] L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker. Web Caching and Zipf-like Distributions: Evidence and Implications. INFOCOM’99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, 1, 1999. [3] BRITE. http://www.cs.bu.edu./brite/, 2003. [4] Miguel Castro, Peter Druschel, Y. Charlie Hu, and Antony Rowstron. Exploiting Network Proximity in Distributed Hash Tables. In Proceeding of International Workshop on Future Directions in Distributed Computing, pages 52–55, 2002. [5] Miguel Castro, Peter Druschel, Y. Charlie Hu, and Antony Rowstron. Proximity neighbor selection in tree-based structured peer-to-peer overlays. Technical Report MSR/TR-2003-52, Microsoft Research, June 2003. [6] Yatin Chawathe, Sylvia Ratnasamy, Lee Breslau, Nick Lanham, and Scott Shenker. Making Gnutella-like P2P Systems Scalable. In Proceedings of the 2003 conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), pages 407–418. ACM Press New York, NY, USA, 2003. [7] Freenet. http://freenet.sourceforge.com. [8] Prasanna Ganesan, Qixiang Sun, and Hector Garcia-Molina. Apocrypha: Making p2p overlays network-aware. Technical report, Stanford University, November 2003. [9] K. Gummadi, R. Gummadi, S. Gribble, S. Ratnasamy, S. Shenker, and I. Stoica. The Impact of DHT Routing Geometry on Resilience and Proximity. In Proceedings of the 2003 conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), volume 3, 2003. [10] Bradley Huffaker, Marina Fomenkov, Daniel J. Plummer, David Moore, and k claffy. Distance Metrics in the Internet. In Proceeding of IEEE International Telecommunications Symposium, 2002. [11] Xiuqi Li and Jie Wu. Improve Searching by Reinforcement Learning in Unstructured P2Ps. In Proceedings of the the Twenty-Sixth IEEE International Conference Workshops on Distributed Computing Systems. IEEE Computer Society Washington, DC, USA, 2006. [12] Yunhao Liu, Li Xiao, Xiaomei Liu, Lionel M. Ni, and Xiaodong Zhang. Location Awareness in Unstructured Peer-to-Peer Systems. IEEE Transactions on Parallel and Distributed Systems, 16(2):163–174, 2005. [13] Gnutella.com Home Page. http://www.gnutella.com. [14] Napster.com Home Page. http://www.napster.com. [15] Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Schenker. A scalable content-addressable network. In Proceedings of the 2001 conference on applications, technologies, architectures, and protocols for computer communications (SIGCOMM), pages 161–172. ACM Pres, August 2001. [16] Matei Ripeanu, Ian Foster, and Adriana Iamnitchi. Mapping the Gnutella Network: Macroscopic Properties of Large-Scale Peer-to-Peer Systems. In Proceedings of the First International Workshop on Peer-to-Peer Systems, volume 68. Springer, 2002. [17] Antony Rowstron and Peter Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proceeding of IFIP/ACM International Conference on Distributed Systems Platforms, pages 329–350, November 2001. [18] Stefan Saroiu, Krishna P. Gummadi, Richard J. Dunn, Steven D. Gribble, and Henry M. Levy. An Analysis of Internet Content Delivery Systems. ACM SIGOPS Operating Systems Review, 36(si):315, 2002. [19] Stefan Saroiu, P. Krishna Gummadi, and Steven D. Gribble. AMeasurement Study of Peerto-Peer File Sharing Systems. In Proceedings of Multimedia Computing and Networking, 2002. [20] Subhabrata Sen and Jia Wang. Analyzing Peer-to-Peer Traffic Across Large Networks. IEEE/ACM Transactions on Networking (TON), 12(2):219–232, 2004. [21] Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, and Hari Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the 2001 conference on applications, technologies, architectures, and protocols for computer communications (SIGCOMM), pages 149–160. ACM Press, Auguest 2001. [22] Marcel Waldvogel and Roberto Rinaldi. Efficient Topology-Aware Overlay Network. In ACM SIGCOMM Computer Communication Review, volume 33, pages 101–106. ACM Press New York, NY, USA, 2003. [23] Hui Zhang, Ashish Goel, and Ramesh Govindan. Incrementally improving lookup latency in distributed hash table systems. In Proceedings of the 2003 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, pages 114–125. ACM Press, June 2003. [24] Ben Y. Zhao, John Kubiatowicz, and Anthony D. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, UC Berkeley, April 2001. | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/28736 | - |
| dc.description.abstract | 由於點在加入P2P網路時，往往都不會考慮到下層的實體網路拓墣，因此導致拓樸失調問題(topology mismatch problem)，許多學者致力於研究路由(routing)跟搜尋(search)的機制來提高P2P的整體效能，但也因為拓樸失調的問題，使得他們所提出的改善方法因此大打了折扣。拓樸失調不僅會帶來許多不必要的訊息量，也會讓訊息的回覆時間增加，在P2P的網路中，回應的時間是使用者比較關心的議題。
因此為了解決拓樸失調的問題，本研究以Gutella網路為底層，提出了一個階層式加入方法(Hierarchical Proximity Join, HPJ)，是在節點加入網路的時候考慮到鄰近性問題，讓節點可以加入在實體網路中確實離自己比較近的地方，每個網路中的節點都會記錄一個階層式的相鄰節點表(Hierarchical Neighbor Table)，新加入的點會利用這個表來找到最適合加入的節點，讓上層的P2P覆蓋網路能夠與下層實體網路更接近。我們的實驗也證明了HPJ確實可以讓覆蓋網路與實體網路之間的差異變小，且在可以接受的搜尋成功率下，也讓搜尋的回應時間縮短許多，因此解決的拓樸失調的問題。 | zh_TW |
| dc.description.abstract | P2P (Peer-to-Peer) file sharing, which is one of the most popular applications, has recently gained significant attention in both academic and industrial areas. However, in most P2P systems, the overlay network is built independent of the physical network. The topology mismatch problem greatly limits the system performance.
In this paper, we proposed a hierarchical proximity join(HPJ) mechanism based on Gnutella P2P system and aiming at alleviating the mismatch problem. The mechanism is adopted when peers joining and makes the overlay network be more close to the physical topology. A new peer gets proximity information from some active peers in the network. Our studies tells that HPJ alleviates the mismatch problem and shortens search response time. | en |
| dc.description.provenance | Made available in DSpace on 2021-06-13T00:20:08Z (GMT). No. of bitstreams: 1 ntu-96-R94725025-1.pdf: 730101 bytes, checksum: 3dbea9cbdd4cf99b3499fd9bf50bcb2c (MD5) Previous issue date: 2007 | en |
| dc.description.tableofcontents | 1 Introduction . . . . . . . . . . . . . . 1
2 Related Work . . . . . . . . . . . . . . 4 2.1 Gnutella . . . . . . . . . . . . . . . . 4 2.2 Proximity Approach . . . . . . . . . . . 5 2.2.1 Proximity Join . . . . . . . . . . . . . 6 2.2.2 Proximity Routing Table Construction . . 7 2.2.3 Proximity Routing . . . . . . . . . . . 8 2.2.4 Adaptive Proximity . . . . . . . . . . . 9 2.2.5 Brief Summary . . . . . . . . . . . . . 10 2.3 Some ProximityMechanisms . . . . . . . . 10 2.3.1 Mithos . . . . . . . . . . . . . . . . . 10 2.3.2 LTM . . . . . . . . . . . . . . . . . . 11 3 SystemDesign . . . . . . . . . . . . . . 14 3.1 Neighbor Table Construction . . . . . . 15 3.2 Node Join . . . . . . . . . . . . . . . 17 4 Simulation . . . . . . . . . . . . . . . 20 4.1 Simulation Setup . . . . . . . . . . . . 20 4.2 Simulation Results . . . . . . . . . . . 21 4.2.1 Routing Stretch . . . . . . . . . . . . 23 4.2.2 Search Scope . . . . . . . . . . . . . . 27 4.2.3 Search Results . . . . . . . . . . . . . 33 4.2.4 Search with High Links . . . . . . . . . 38 5 Conclusion . . . . . . . . . . . . . . . 40 Bibliography . . . . . . . . . . . . . . . . . 41 | |
| dc.language.iso | en | |
| dc.subject | 拓樸失調 | zh_TW |
| dc.subject | Gnutella | zh_TW |
| dc.subject | 地域鄰近性 | zh_TW |
| dc.subject | 點對點系統 | zh_TW |
| dc.subject | Gnutella | en |
| dc.subject | proximity | en |
| dc.subject | Peer-to-Peer | en |
| dc.subject | topology mismatch | en |
| dc.title | 考慮地域性之階層式加入方法:考慮鄰近性的點對點網路系統 | zh_TW |
| dc.title | Hierarchical Proximity Join:A Proximity-Aware Peer-to-Peer System | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 95-2 | |
| dc.description.degree | 碩士 | |
| dc.contributor.oralexamcommittee | 蔡益坤(Yih-Kuen Tsay),林宗男(Tsung-Nan Lin) | |
| dc.subject.keyword | 點對點系統,地域鄰近性,Gnutella,拓樸失調, | zh_TW |
| dc.subject.keyword | Peer-to-Peer,proximity,Gnutella,topology mismatch, | en |
| dc.relation.page | 43 | |
| 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 未授權公開取用 | 712.99 kB | Adobe PDF |
系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。