臺灣博碩士論文加值系統

在P2P檔案分享系統裡，由參與節點彼此分享著其他節點願意分享之檔案。以分散式雜湊表(Distributed Hash Table)為基礎的路由演算法能提供一個較有效率路由機制並且在最近幾年變成很重要的研究議題，不過在分散式雜湊表演算法中存在著兩個問題：(1)檔案透過雜湊函數得到唯一的識別代碼，經由識別代碼將檔案儲存在特定節點上可能會浪費儲存空間及網路頻寬(2)相同檔案有多個節點能提供服務時，DHT演算法並沒有辦法知道那個節點是離使用者端最近，因此使用者可能會從一個遠端節點下載檔案並且要忍受較長取回檔案之延遲時間，在這篇論文中，使用目錄來降低空間負擔並且應用機率性伺服器挑選策略(probabilistic server selection policy)來找出適當的節點擁有者，並且利用兩階段處理方式來達到目錄一致性。在評估分析與模擬結果中證明所提出方法有顯著的改善空間及系統取回效能(retrieval performance)。

In Peer-to-Peer (P2P) file sharing systems, the participating peers share the files with others. Distributed Hash Table (DHT) based routing algorithms provide an efficient routing mechanism for P2P and become important issues in recent years. However, there are two problems in DHT algorithms. First, it may waste storage and bandwidth for storing shared files at the node indicated by the DHT. Second, in case of multiple file retrievals, DHT based routing algorithms can not give information which peer owners are topologically close to the query client. Thus, the client may have to download the file from a remote peer and suffer from long retrieve latency. In this thesis, the proposed approach uses directory to reduce storage space overhead and applies probabilistic server selection policy to find out preferable peer owners. Furthermore, the proposed approach also considers directory consistency by employing a two-phase protocol. The evaluation and simulation results show our strategy can significantly the improve space overhead and the system retrieval performance.

第一章 緒論 1
第二章 文獻探討 6
2.1 集中式P2P系統 6
2.2 分散式且非結構性P2P系統 7
2.3 分散式且結構化P2P系統 7
2.3.1 鬆散結構化P2P架構 8
2.3.2 嚴謹結構化P2P架構 10
I. Pastry 10
II. Tapestry 14
III. CAN 15
IV. Chord 18
V. HIERAS 24
第三章 所提方法 27
3.1 基本想法 27
3.1.1 如何將子目錄均勻分佈到所有參與節點上 28
3.1.2 如何提供給使用者鄰近內容提供者節點資訊 30
3.1.3 如何解決目錄一致性的問題 30
3.2 問題解決 31
3.2.1 分散式目錄架構 31

3.2.2 機率性伺服器挑選策略 32
3.2.3 目錄一致性 33
第四章 比較分析 36
第五章 評估與模擬 39
5.1 評估 39
5.2 模擬 40
第六章 總結 43
參考文獻 44

[1]A. Rowstron and P. Druschel, “Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems,” Proc. IFIP/ACM International Conference on Distributed Systems Platforms (Middleware2001), November 2001.
[2] A. Rowstron and P. Druschel, “Storage Management and Caching in PAST, A Large-Scale, Persistent Peer-to-Peer Storage Utility,” Proc. ACM Symposium on Operating Systems Principles (SOSP 2001), October 2001.
[3] B.Y. Zhao, L. Huang, J. Stribling, S.C. Rhea, A.D. Joseph, and J.D. Kubiatowicz, “Tapestry: A Resilient Global-scale Overlay for Service Deployment,” IEEE Journal on Selected Areas in Communications, Special Issue on Service Overlay Networks, 2004.
[4]D. Karger, E. Lehman, F. Leighton, M. Levine, D. Lewin, and R. panigrahy, “Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web,” In Proceedings of the twenty-ninth annual ACM symposium on Theory of computing , May 1997.
[5]D. lewin, “Consistent hashing and random trees: Algorithms for caching in distributed networks,” Master’s thesis, Department of EECS, MIT, 1998. Available at the MIT Library, http://thesis,mit.edu/.
[6]D. Moore, G. Voelker, and S. Savage, “Inferring internet denial-of-service activity,” in Proc. 10th USENIX Security Symp., pp. 9–22, Aug. 2001.
[7]E. W. Zegura, K. L. Calvert, and S. Bhattacharjee, “How to model an internetwork,” In Proceedings of the IEEE Conference on Computer Communication, Son Francisco, CA, pp. 594-602, Mar.1996.
[8]FIPS 180-1. Secure hash standard. U.S. Dept. of Commerce/NIST, National Technical Information Service, April 1995.
[9]H. Miura, M. Yamamoto, K. Nishimura, H. Ikeda, “Server Load Balancing with Network Support: Active Anycast,” The Second International Working Conference on Active Networks (IWAN2000), pp.371-384, 2000.
[10]I. Clarke et al “Freenet: A Distributed Anonymous Information Storage and Retrieval System,” Workshop on Design Issues in Anonymity and Unobservability, pp. 46-66, July 2000.
[11]I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, “Chord: A scalable peer-to-peer lookup protocol for internet applications,” IEEE/ACM Transactions on Networking, pp. 17-32, February 2003.
[12]Janakiraman. R., Waldvogel. M., Qi Zhang; “Indra: a peer-to-peer approach to network intrusion detection and prevention”, Enabling Technologies: Infrastructure for Collaborative Enterprises, 2003. WET ICE 2003. Proceedings. Twelfth IEEE International Workshops on, pp. 226-231, June 2003.
[13]Keromytis, A.D. , Misra, V. ,Rubenstein, D, “SOS: an architecture for mitigating DDoS”, Selected Areas in Communications, IEEE Journal, pp.176-188, Jan. 2004.
[14]S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A Scalable Content-Addressable Network”, Proc. ACM SIGCOMM, pp.161-172, August 2001.
[15]S. Saroiu, P. K. Gummadi, and S. D. Gribble, “A measurement study of peer-to-peer file sharing systems”, In Proceedings of Multimedia Computing and Networking (MMCN) 2002, January 2002.
[16]Stefan Saroiu, P. Krishna Gummadi and Steven D. Gribble “Measuring and Analyzing the Characteristics of Napster and Gnutella Hosts” Multimedia Systems Journal, November 2002.
[17]Stephanos Androutsellis-Theotokis, Diomidis Spinellis, “A Survey of Peer-to-Peer Content Distribution Technologies”, ACM Computing Surveys (CSUR), pp.335-371, December 2004.
[18]The Freenet homepage, http://sourceforge.net/projects/freenet/.
[19]The genome@home project web site. http://genomeathome.stanford.edu/.
[20]The Gnutella website. http://gnutella.wego.com.
[21]The Napster website. http://www.napster.com
[22]The SETI@home homepage, http://setiathome.ssl.berkeley.edu/
[23] The United Device homepage, http://www.ud.com/home.htm
[24] Vanrenesse, R., Bireman, K., Bozdog, A., Dimitriu,D., Singh, M.,And vogels, W., “Heterogeneity-aware peer-to-peer multicast,” In Proceedings of the 17th International Symposium on Distributed Computing (DISC2003),2003.
[25]Vlachos, V.,Androutsellis-Theotokis, S., And Spinellis,D., “Security applications of peer-to-peer networks,” Comput. Netw, pp.195-205, 2004,.
[26]Y.H. Chu, S.G. Rao, S. Seshan and H. Zhang, “A Case for End System Multicast,” IEEE Journal on Selected Areas in Communication, Special Issue on Networking Support for Multicast, October 2002.
[27]Zhiyong Xu, Rui Min, and Yiming Hu. “HIERAS: A DHT-Based Hierarchical Peer-to-Peer Routing Algorithm,” Proc. Int'l Conf. on Parallel Processing (ICPP'03), October 2003.