臺灣博碩士論文加值系統

本研究目標則是以節點具有相對需求資料進行連結。提出透過節點分析群組間具有潛在關聯性進行相似節點搜尋P2P Overlay改善，透過關聯性分析演算後，經由使用有效地連結到相似的節點進行訊息交換，令原先P2P Overlay達到擁有更佳良好的資料交換方式。

Existing P2P search methods in unstructured networks usually calculate its own node capacity before develop all possible design issues, thus making lookup more efficient. This study proposes a novel search scheme based on clustering analysis. The target Peer first chooses some neighbors and computes the similarity between itself and them. Searching is started based on similarity accordingly. Finally, we experiment and validate the performance of system parameters.

目次
1. 前言
1 . 1 研究背景
1 . 2 研究動機
1 . 3 研究目的
1 . 4 研究步驟
1 . 5 論文架構
2. 文獻探討
2 . 1 P2P加疊（Peer-to-Peer Overlay）
2 . 1 . 1 結構化網路(Structured Network)
2 . 1 . 2 非結構化網路(Unstructured Network)
2 . 1 . 2. 1 泛洪搜尋(Flooding Search)
2 . 1 . 2. 2 隨機遊動搜尋（Random Walk Search）
2 . 1 . 2. 3 超級節點搜尋（Super Node Search）
2 . 2 P2P節點問題與解決方法
2 . 2 . 1 P2P弱度節點定義
2 . 2 . 2 P2P關聯式節點
3. 關聯性節點相似性演算法設計
3 . 1 節點群組維護(Node Group Maintainance)
3 . 1 . 1 節點加入(Node Joining)
3 . 1 . 2 節點遺棄(Node Departure)
3 . 2 關聯性相似度演算法(Associate Similarity Algorithm)
3 . 2 . 1 分群與相似度(Cluster and Similarity)
3 . 2 . 2 集群分析的概念(The Concept of Cluster Analysis)
3 . 3 相似度距離測量法(Distance Similarity Measurement)
3 . 4 替補節點
3 . 5 搜尋路由
3 . 5 . 1 探測式封包設計(Probing packet design)
3 . 5 . 2 推薦封包設計(Recommend packet design)
3 . 5 . 3 隨機遊走封包設計(Random walk-based packet design)
4. 系統網路架構及開發環境
4 . 1 開發環境
4 . 2 系統網路架構
4 . 3 JXTA協定及網路協定結構
4 . 4 JXTA傳輸處理流程架構
5. 系統設計實作與效能分析
5 . 1 實驗方法與步驟
5 . 2 實驗環境
5 . 3 實驗1 - P2P網路負載與搜尋
5 . 4 實驗2 - P2P網路關聯性相似度搜尋的效率及準確性
6. 結論與未來研究方向
參考文獻

參考文獻

[1]Y. Tang, Z. Zhang, S. Chen, G. Fan, “A Distributed Hybrid Scheme for Unstructured Peer-to-Peer Networks”, ICC 2006 - IEEE International Conference on Communications, Vol. 29, No. 1, pp. 30-35, June. 2006
[2]C. Cheng, S. Tsao, and J. Chou, “Unstructured Peer-to-Peer Session Initiation Protocol For Mobile Environment”, PIMRC 2007 - IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, No. 1, September. 2007
[3]T. Hamada, K. Chujo, T. Chujo , X. Yang “Peer-to-Peer Traffic in Metro Networks: Analysis, Modeling, and Policies”, IEEE/IFIP Network Operations and Management Symposium, No. 1, pp. 425-438 ,April. 2004
[4]Y. Joung, L. Yang, and C. Fang ,”Keyword Search in DHT-based Peer-to-Peer Networks”, IEEE Journal On Selected Areas In Communciation, Vol. 25, No. 1, January. 2007
[5] X. Jin, Q. Xia, S.-H. Gary Chan, “Building A Monitoring Overlay for Peer-to-Peer Streaming”, GLOBECOM 2006 - IEEE Global Telecommunications Conference, Vol.25, No.1, pp. 1132-1136,November. 2006
[6]C. Lin, Y. Chang, S. Tsai, C. Chou, “Distributed Social-based Overlay Adaptation for Unstructured P2P Networks”, IEEE INFOCOM 2008 - 27th IEEE International Conference on Computer Communications, Vol. 27, No. 1, pp. 2494-2499,April 2008
[7]M. Yang, Z. Fei, “Assigning Identifications to Nodes in Unstructured Peer-to-Peer Networks:A Novel Approach to Improving Search Efficiency”, GLOBECOM 2007 - IEEE Global Telecommunications Conference, No. 1, pp. 411 - 415, November 2007
[8]R. Hanneman , M. Riddle, “Introduction to social network methods:Table of contents”, http://www.faculty.ucr.edu/ hanneman/nettext/, 2005
[9]M. Sripanidkulchai, K. Maggs, B. Zhang, H. Carnegie Mellon Univ., Pittsburgh, PA, USA,”Efficient content location using interest-based locality in peer-to-peer systems” INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. Vol.3,pp. 2166- 2176, April 2003
[10]A. Abada, L. Cui, C. Huang , H. Chen, “A Novel Path Selection and Recovery Mechanism for MANETs P2P File Sharing Applications”, WCNC 2007 - IEEE Wireless Communications and Networking Conference, Vol. 8, pp. 3303 - 3308, no. 1, March 2007
[11] JXSE_ProgGuide_v2.5, see https://jxta-jxse.dev.java.net/
[12] A. Peiravi, H. T. Kheibari , “ Connectivity Group Approximation Using Modified Manhattan Distance in Mobile Ad Hoc Networks”, Asian Network for Scientific Information Journal of Applied Sciences Journal of Applied Sciences, Vol. 8, pp. 1462 – 1470, August 2008
[13] J. Beusekom, D. Keysers, F. Shafait, T. M. Breuel, “Distance Measures for Layout-Based Document Image Retrieval”, DIAL apos;06. Second International Conference pp.232-242, April 2006
[14] Bitorrent, see http://www.bittorrent.com/
[15] Gnutella, see http://www.gnutellaforums.com/
[16] eDonkey, see http://www.zeropaid.com/edonkey/
[17] JXTA v2.0 Protocols Specification, see https://jxta-spec.dev.java.net/JXTAProtocols.pdf
[18] Java™ P2P Programming, see http://java.sun.com/developer/Books/networking/jxta/index.html
[19] Mastering JXTA: Building Java Peer-to-Peer Applications, see
http://www.win.tue.nl/~ymazuryk/books/m_jxta.pdf
[20] The Gnutella Protocol Specification v0.4, see
http://www9.limewire.com/developer/gnutella_protocol_0.4.pdf