臺灣博碩士論文加值系統

本研究主要探討關於對等式網路中，利用現行的架構以改進對等式網路傳輸的穩定性與速度。 此傳輸協定共分為資料搜尋與訊息交換、封包處理傳遞以及子網路區域配置與傳繞的三層級，其中使用Enhanced-Grape階層式系統作為網際網路中的對等式架構。於階層式的超節點中使用Chord網路系統來做資料搜尋、訊息交換與傳輸繞送。及使用前置處理將封包傳遞，並將資訊儲存於封包之中，以減少頻寬的負擔。並利用樹狀架構當作子網路層的基本骨幹，以彌補原本分散式雜湊表系統不具備的區域性特質。

This investigation primarily discusses about the improvement of speed and stability of Peer-to-Peer Network based on the conventional architecture. Three-level of transmission protocol is used to perform the searching and message exchanging, packet processing and transmitting, and sub-network constructing and routing. Enhanced-Grape hierarchical architecture is used as the main architecture around the internet P2P network. By using CHORD system, data search and message exchange is performed. Packet transmitting is achieved by sending the data information first, followed with the whole data file, to alleviate the bandwidth burden at the beginning of data transmission. Binary-tree is used as the backbone of sub-network to increase the throughout of local area network.

目錄
第一章 序論 01
第二章 文獻回顧及相關介紹 05
2.1運用分散式雜湊表來建構改良的對等式網路 05
2.1.1 Broadcade 05
2.1.2 SkipNet 06
2.1.3 Grape 06
2.2可用於Grape之網路層的分散式雜湊表系統 11
2.2.1分散式雜湊表 13
2.2.2 Chord的協定與系統模型 13
2.3改良式超節點網路系統之特性 17
第三章 對等式節點之區域網路搜尋方法 20
3.1第一層傳輸協定:資料搜尋與訊息交換 20
3.1.1封包碰撞與傳輸速度之評估 20
3.1.2超網路層內節點間的訊息傳遞 23
3.1.3超節點的表格配置 25
3.1.4超節點Routing運作之演算法 31
3.2第二層傳輸協定:訊息處理與封包傳遞 36
3.2.1訊息處理之方式 36
3.2.2資源之封包切割與分派 38
3.2.3封包內的格式與儲存 40
3.3第三層傳輸協定:節點的子網路區域配置與傳繞 42
3.3.1子網路內所形成的Enhanced-Grape鏈結模式 42
3.3.2以Binary Tree為基礎建立樹狀架構 46
3.3.3建構子網路訊息傳遞流程 47
3.4整體運作方法 49
第四章 enhanced-grape系統分析與實作範例 51
4.1系統運作架構 51
4.2新節點加入流程 54
4.3使用者搜尋流程 55
第五章 結論與未來展望 58
5.1結論 58
5.2未來展望 59
參考文獻Reference 61
附錄 Appendix 63

[1] The Naspter homepage. http://www.napster.com
[2] The Freenet homepage. http://sourceforge.net/projects/freenet/
[3] The Gnutella homepage. http://www.gnutella.com
[4] K. Shin, S. Lee, G.. Lim, H. Yoon, and J. S. Ma, “Grapes: Topology-based Hierarchical Virtual Network for Peer-to-peer Lookup Services,” In Proceedings of the International Conference on Parallel Processing Workshops (ICPPW’ 02), 2002.
[5] B.Y. Zhao, Y. Duan, and L. Huang,” Brocade: Landmark Routing on Overlay Networks,” In Proceedings of the 1st International Workshop on Peer-to Peer Systems, 2002.
[6] I. Stoica, R. Morris, D. Karger, M F. Kaashoek and H.Balakrkshnan, “Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications,” In Proceedings of SIGCOMM 2001, ACM.
[7] N. JA Harvey, M. B. Jones, S. Saroiu, M. Theimer, A.Wolman, “SkipNet: A Scalable Overlay Network with Pratical Locality Properties,” In Proceedings of 4th USITS, 2003.
[8] A. Rowstron and P. Druschel, “Pastry: Scalable, distributed object location and routing for large-scale Peer-to-Peer systems” Accepted for Middleware, Nov 2001
[9] Ben Y. Zhao; John D. Kubiatowicz; Anthony D. Joseph, “Tapestry: An Infrastructure for Fault-tolerant wide-area Location and Routing” U.C. Berkeley Technical Report UCB/CSD-01-1141, April 2001
[10] Sylvia Ratnasamy; Paul Francis; Mark Handley; Richard Karp; Scott Shenker, “A Scalable Content-Addressable Network” In Proceeding of the ACM SIGCOMM, 2001
[11] C.Plaxton, R. Rajaraman, and A. Richa, “Accessing nearby copies of replocated objects in a distributed environment,” IN Proc. ACM Symp. Parallelism in Algorithms and Architectures, Newport, RI, June 1997, pp, 311-320.
[12] Tein-Yaw Chung, Tsai,Chia-Huang, “An Algorithm for Search Topology Maintenance in P2P System,” in Yuan Ze University, 2003.
[13] 柯學嶺，王勝德, ”An Efficient Peer-to-Peer Network Exploiting Super Node and Distributed Hash Table Properties,” 國立臺灣大學 電機工程學研究所, 2003年。
[14] D. Koppelman and A. Y. Oruc, “A self-routing permutation network,” Journal of Parallel and Distributed Computing, no. 10, pp. 140-151, 1990.