(18.204.227.34) 您好!臺灣時間:2021/05/19 08:42
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果

詳目顯示:::

我願授權國圖
: 
twitterline
研究生:李飛鴻
研究生(外文):Fei-Hung Li
論文名稱:階層式結構化點對點覆蓋網路之研究
論文名稱(外文):A Study on Hierarchical Structured Peer to Peer Overlay Networks
指導教授:周信宏周信宏引用關係
指導教授(外文):Hsin-Hung Chou
學位類別:碩士
校院名稱:長榮大學
系所名稱:資訊管理研究所
學門:電算機學門
學類:電算機一般學類
論文種類:學術論文
論文出版年:2008
畢業學年度:96
語文別:中文
論文頁數:45
中文關鍵詞:結構化點對點系統立方體互連圖折疊超立方體完整二元樹
外文關鍵詞:Structured P2P SystemCube-Connected-CycleFolded HypercubeComplete Binary Tree
相關次數:
  • 被引用被引用:0
  • 點閱點閱:107
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
近年來由於網路頻寬的提升,吸引學術界與企業對於點對點系統進行探討,因此如何建構一個具有高效率的點對點系統成為熱門的討論議題。根據點對點網路覆蓋結構的分類,早期是以非結構化為主,節點與節點之間互相連接但無特定的連線方式,搜尋檔案是採用洪流的方式,搜尋效率不佳並且浪費大量的網路頻寬。於是學界引進連結網路拓樸結構,提出具有特定連線方式的點對點系統,稱為結構化點對點系統,著名的結構化點對點系統有CAN、Chord、Pastry、Tapestry、Viceroy、Cycloid…等。結構化點對點系統大都利用DHT技術將資料散佈到節點中,獲得良好的網路擴展性和搜尋繞徑效率的提升。除了採用結構化拓樸,另外還有使用階層分群的方式縮短繞徑長度,稱之為階層式點對點系統。
本論文中,我們對於結構化點對點系統的拓樸結構進行整理與比較。另外,我們也提出一種以立方體互連圖、折疊超立方體和完整二元樹為主要架構的常數分支度階層式結構化點對點系統,CHS系統。與其它結構化系統比較,當節點數為n,CHS系統具有相同的平均繞徑長度O(log n),僅需維護常數個數鄰居節點,並且擁有較佳的容錯性。
Due to the upgrade of Internet bandwidth in recent years, P2P systems have attracted increasing attention from researchers and enterprises. How to construct efficient P2P systems has become an popular research issue. According to a classification on the structures of P2P overlay networks, the early network structures were unstructured in which peers were randomly connected and a flooding mechanism was used to send queries across the overlay network. They were inefficient and consumed a large part of Internet bandwidth. Therefore, the researchers renovated the interconnected network architecture with a kind of P2P overlay network, in which peers are connected in a specific graph topology, also known as structured P2P system, notably including CAN, Chord, Pastry, Tapestry, Viceroy, Cycloid, etc. Most structured P2P systems utilize DHT technology to map data items onto the nodes for enhancing the scalability and efficiency of routing. In addition to applying the structured topology, hierarchical clustering is another way to shorten the routing path length, named hierarchical P2P systems.
In this study, we surveyed and compared the structured and hierarchical P2P systems. Moreover, we proposed a constant-degree hierarchical structured P2P architecture, called CHS, which was built based on a Cube-Connected-Cycle graph, a folded hypercube and a complete binary tree. Comparing with other constant-degree P2P systems, in a CHS with n nodes, it requires the same O(log n) hops per lookup, only maintains O(1) neighbors per node, and offers a better fault tolerance.
中文摘要 i
Abstract ii
第一章 緒論 1
1.1 前言 1
1.2 P2P系統分類與發展 2
1.2.1 P2P系統分類 2
1.2.2 P2P系統的發展 4
1.3 動機 6
1.4 論文章節描述 6
第二章 文獻探討 7
2.1 分散式雜湊表與結構化系統 7
2.1.1分散式雜湊表 7
2.1.2 連結網路拓樸 8
2.1.3 結構化系統之可變動維度DHT 11
2.1.4 結構化系統之固定維度DHT 16
2.2 階層式之P2P系統 19
2.3 系統設計相關探討 23
第三章 CHS系統 26
3.1 節點編號 26
3.2 拓樸連線 27
3.3 繞徑演算法 30
3.4 節點動態 34
第四章 系統模擬 37
第五章 結論 41
參考文獻 42
[1]A. E. Amawy and S. Latifi, “Properties and performance of folded hypercubes”, IEEE Transactions on Parallel and Distributed Systems, Vol. 2, No. 1, 1991, pp. 31-42.
[2]I. Gupta, K. Birman, P. Linga, A. Demers, and R. V. Renesse, “Kelips: building an efficient and stable P2P DHT through increased memory and background overhead”, Proc. of the 2 ndInternational Workshop on Peer-to-Peer Systems (IPTPS’03), 2003.
[3]J. P. Gian, “PeerSim HOWTO: Build a new protocol for the PeerSim 1.0 simulator”, http://peersim.sourcetorge.net/, December 24, 2005.
[4]J. P. Gian, “PeerSim HOWTO: Build a topology generator for PeerSim 1.0." http://peersim.sourcetorge.net/, April 28, 2006.
[5]J. P. Gian , Simon Patarin, “PeerSim HOWTO: search framework and algorithms on peersim.” http://peersim.sourcetorge.net/, November,24.
[6]D. Karger, , E. Lehman, , F. Leighron, , 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 29th Annual ACM Symposium on Theory of Computing (E1 Paso, TX, May 1997), pp. 654-663.
[7]J. Kubiatowicz, D. Bindel, Y. Chen, P. Eaton, D. Geels, R. Gumadi, S. Rhea, H.Weatherspoon, W. Weimer, C. Wells and B. Y. Zhao., “OceanStore: An Architecture for Global-scale Persistent Storage,” Proceedings of ACM ASPLOS, November, 2000.
[8]M.F. Kaashoek, D.R. Karger, “Koorde: A simple degree-optimal distributed hash table,” Proceedings of the 2nd International Workshop on Peer-to-Peer Systems(IPIPS’03), Berkeley, CA, 98-107, 2003.
[9]X. Li and J. Wu. Searching techniques in peer-to-peer networks. In J. Wu, editor, Handbook of Theoretical and Algorithmic Aspects of Ad Hoc, Sensor, and Peer-to-Peer Networks. Auerbach, New York,USA, 2006.
[10]D. Malkhi, M. Naor, and D. Ratajczak, “Viceroy: A scalable and dynamic emulation of the butterfly”, in Proc. PODC Monterey, CA, pp. 183-192, 2002.
[11]M. Ripeanu, , “Peer-to-Peer Architecture Case Study : Gnutalla Network”, In Peer-to-Peer Computing Proceeding, Pages: 99-100, 2001.
[12]L. Qin, C. Pei, C. Edith, L. Kai and Scott Shenker Sponsor, “Search and replication in unstructured peer-to-peer,” In Series-Proceeding-Section-Article ACM Press, Pages:84-95, 2002.
[13]A. Rowstron and P. Druschel, “Pastry: Scalable, Distributed Object Location and Routing for Large-scale Peer-to-peer Systems,”Proc. Middleware, 2001.
[14]H. Shen, C.-Z. Xu, and G. Chen, “Cycloid: a constant-degree and lookup-efficient P2P overlay network”, Proc. of the 18thIEEE International Parallel & Distributed Processing Symposium (IPDPS’04), 2004.
[15]I.Stoica, R.Morris, D.Karger, F.Kaashoek, and H.Balakrishnan, "Chord: A scalable peer-topeer lookup service for Internet applications", in Proceedings of ACM SIGCOMM’2001, August 2001.
[16]K.N.Sivarajan and R.Ramaswami, “Lightwave Networks Based on de Bruijn Graphs,” IEEE/ACM Trans. on Net- working, vol.2, no. 1, 1994.
[17]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), pages 159-166, 2002.
[18]F. Preparata and J. Vuillemin. “The cube-connected cycles: A versatile network for parallel computation”. CACM, 24(5):300–309, 1981.
[19]S. Ratnasamy et al., “Scalable Content Addressable Network, ”Proc. ACM SIGCOMM, pp.161-172, 2001.
[20]Science, HKUST, Feb. 2003 FIPS 180-1. “Secure Hash Standard”. U.S. Department of Commerce/NIST, National Technical Information Service, Springfield, VA, Apr. 1995.
[21]F. Thomson Leighton, “Introduction to Parallel Algorithms and Architectures: Arrays Tree Hypercubes,” Morgan Kaufmann Publishers, 1992.
[22]C. Wang and B. Li, Peer-to-Peer Overlay networks: A Survey, Technical Report, Department of Computer.
[23]B. Y. Zhao et al., “Tapestry: A Resilient Global-Scale Overlay for Service Deployment,” IEEE JSAC, vol. 22, no. 1, Jan. 2004.
[24]BitTorrent. http://www.bittorrent.com
[25]Edonkey. http://www.edonkey.com
[26]Freenet. http://freenet.sourceforge.net/
[27]Gnucleus, the Gnutella Web caching system, available: http://www.gnucleus.net/gwebcache/
[28]KaZaA. http://www.kazaa.com/us/index.htm
[29]Napster. http://www.napster.com
[30]Network Simulation -2. http://www.isi.edu/nsnam/ns/
[31]Skype. http://www.skype.com
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top