跳到主要內容

臺灣博碩士論文加值系統

(3.229.142.104) 您好!臺灣時間:2021/07/30 14:18
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:柯昱泓
研究生(外文):Yu-Hong Ke
論文名稱:擁有拓樸結構學習能力的階層式P2P架構
論文名稱(外文):A Hierarchical P2P Architecture with Topology Awareness
指導教授:王丕中
指導教授(外文):Pi-Chung Wang
學位類別:碩士
校院名稱:國立中興大學
系所名稱:資訊科學與工程學系
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2008
畢業學年度:96
語文別:英文
論文頁數:49
中文關鍵詞:階層式點對點分群
外文關鍵詞:P2PTopology MismatchedhierarchicalGrouping
相關次數:
  • 被引用被引用:0
  • 點閱點閱:161
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
近年來,雖然P2P受到各方面使用者所重視, 不管是網路使用者或是研究網路的專家們。 但是Topology Mismatched的問題一直存在P2P網路中,且導致效能的低落。
在本篇論文中, 首先利用階層式架構去改善Topology Mismatched。 這個架構將較近的Peers分為同一個群組, 大大的降低了網路上流量的負擔。而我們的實驗也證明了在傳遞訊息時間和封包被轉遞的次數都有傑出的表現。 我們另外提出一個技巧去更加優化P2P系統的效能。讓傳遞訊息的時間更短, 封包被轉遞的次數也更少。 與前人所提出的方法比較, 我們提出的方法有著更傑出的效能, 且需要更少的網路流量。
In recent years, P2P network has generated tremendous interest worldwide among Internet surfers and computer networking professionals. However, the problem of "topology mismatch" would decrease the performance of the P2P network. In our paper, we adopt the hierarchical P2P architecture to improve the problem of "topology mismatch" by grouping closer peers into a group in our architecture. Our approach can reduce the overhead of network traffic. We also proposed a technique to optimize the performance of the P2P system. This technique can further reduce the latency of message delivery and packet forwarding. Our experimental results demonstrate that the proposed scheme could reduce the search latency and the forwarded packets. As comparing to the existing algorithms, our proposed method also has better performance with respect to all metrics of interest.
1. Introduction 1
1.1. Background..................................................................................................... 1
1.1.1. The History of P2P................................................................................... 1
1.1.2. The Routing Algorithms of P2P............................................................... 4
1.2. Motivation....................................................................................................... 8
1.3. Organization of the Thesis ............................................................................10
2. Related Works 11
2.1. Topology Mismatch...................................................................................... 11
2.2. Unstructured P2P Network........................................................................... 13
2.2.1. Gnutella................................................................................................. 13
2.3. Structured P2P Network............................................................................... 17
2.3.1. Chord..................................................................................................... 17
2.3.2. HIERAS................................................................................................. 21
3. Method 28
3.1. Preliminary.................................................................................................... 28
3.1.1. Grouping................................................................................................ 28
3.1.2. Landmark Nodes................................................................................... 28
3.1.3. Hierarchy Depth.................................................................................... 29
3.2. Data Structure............................................................................................... 29
3.3. Routing Algorithm........................................................................................ 33
3.4. Node Operation............................................................................................. 37
4. Performance Evaluation 41
4.1. Preliminary.................................................................................................... 41
4.2. In Overlay Network...................................................................................... 41
4.2.1. Average Hop Number.......................................................................... 41
4.2.2. Worst Hop Number.............................................................................. 42
4.2.3. Average Latency.................................................................................. 43
4.3. In Underlay Network.................................................................................... 44
4.3.1. Average Hop Number.......................................................................... 44
4.3.2. Worst Hop Number.............................................................................. 44
5. Summary 47
5.1. Conclusion.................................................................................................... 47
5.2. Future Work.................................................................................................. 47
Bibliography 48
[1] Napster, http://www.napster.com
[2] eDonkey, http://www.edonkey2000.net
[3] eMule, http://www.emule-project.net/
[4] Gnutella, http://www.gnutella.wego.com
[5] KaZaA, http://www.kazaa.com
[6] FreeNet, http://freenetproject.org/
[7] The Gnutella Protocol Specification v0.4, http://www9.limewire.com/developer/gnutella_protocol_0.4.pdf
[8] Ion Stoica, Robert Morris, David Liben-Nowell, David R. Karger, M. Frans Kaashoek, Frank Dabek, Hari Balakrishnan, ”Chord : A Scalable Peer-to-Peer Lookup Protocol for Internet Applications”, IEEE/ACM Transactions on Networking, VOL. 11, (2003), 17-32.
[9] Zhiyong Xu, Rui Min, Yiming Hu, ”HIERAS : A DHT Based Hierarchical P2P Routing Algorithm”, Proceeding of the 2003 International Conference on Parallel Processing.
[10] S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker, “A scalable content addressable network.”, Technical Report, TR-00-010, U.C.Berkeley, CA, 2000.
[11] P. Druschel and A. Rowstron, “Past: A large-scale, persistent peer-to-peer storage utility”, in the 8th IEEE Workshop on Hot Topics in Operating Systems (HotOS), Schoss Elmau, Germany, May 2001.
[12] A. I. T. Rowstron and P. Druschel, “Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems,” in Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany, pp. 329–350, Nov. 2001.
[13] B. Zhao, J. Kubiatowicz, and A. Joseph, “Tapestry: An infrastructure for fault-tolerant widearea location and routing.” Technical Report UCB/CSD-01-1141, U.C.Berkeley, CA, 2001.
[14] F. Dabek, E. Brunskill, M. F. Kaashoek, D. Karger, R. Morris, I. Stoica, and H. Balakrishnan, “Building peer-to-peer systems with chord, a distributed lookup service,” in the 8th IEEE Workshop on Hot Topics in Operating Systems (HotOS), Schoss Elmau, Germany, pp. 195–206, May 2001.
[15] S. Rhea and J. Kubiatowicz, “Probabilistic location and routing,” in Proceedings of INFOCOM., 2002.
[16] omnet++, http://www.omnetpp.org
[17] OverSim : The Overlay Simulation Framework, http://www.oversim.org

[18] INET Framework, http://www.omnetpp.org/staticpages/index.php?page=20041019113420757
[19] E.W. Zegura, K. L. Calvert, and S. Bhattacharjee, “How to model an internetwork,” in Proceedings of the IEEE Conference on Computer Communication, San Francisco, CA, pp. 594–602, Mar. 1996.
[20] F. Dabek, M. F. Kasshoek, D. Karger, R. Morris, I. Stoica. ”Wide-area cooperative storage with CFS.” In Proceedings of ACM SOSP, 2001.
[21] A. Rowstron, P. Druschel, “Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility,” In Proceedings of ACM SOSP, 2001.
[22] S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, “Topologically-aware overlay construction and server selection,” in Proceedings of IEEE INFOCOM’02, New York, NY, Jun. 2002.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top