常數分支度點對點覆蓋網路之研究

A Study on Constant-Degree Peer-to-Peer Overlay Network

陳晉弘(Jin-Hung Chen)

指導教授 ： 周信宏

長榮大學/資訊暨工程學院/資訊管理研究所/碩士(2008年)

https://doi.org/10.6833/CJCU.2008.00038

摘要

點對點網路系統跳脫傳統主從式系統的模式，系統中每一個節點既是客戶端也是伺服器。點對點技術是Gnutella、Freenet、KaZaA、Edonkey和BitTorrent等檔案分享應用系統的核心技術。為了使點對點系統更有效率，點對點系統的拓樸結構受到學術界的熱烈探討與研究。
本論文中，我們對於結構化點對點系統的網路結構進行整理與比較。另外，我們也提出以常數分支度為基礎的結構化系統CODS，其拓樸結構主要是採用立方體互連圖架構。在節點數為n的CODS系統中，平均繞徑長度為O(log n)個節點跳躍，鄰居數為O(1)。與其他常數分支度的系統比較，CODS擁有較好的容錯性和較少的鄰居更新動作。

關鍵字

結構化點對點系統 ； 立方體互連圖 ； 分散式雜湊表 ； CODS

並列摘要

Different from the client-server model, a P2P network have equal peer nodes that simultaneously function as both "clients" and "servers" to the other nodes on the network. P2P is a popular technology for file sharing software applications like Gnutella, Freenet, KaZaA, Edonkey and BitTorrent. To increase the efficiency of P2P networks, the study on the topology of P2P systems have become popular.
In this thesis, we study and compare the structured P2P systems, and further we propose a constant-degree P2P system (CODS) whose overlay topology is based on the cube-connected cycle (CCC) graph. In a CODS with n nodes, it requires at most O(log n) hops per lookup and maintains O(1) neighbors per node. Comparing with the other constant-degree P2P system, CODS has advantages on the fault tolerance and the neighborhood maintenance.

並列關鍵字

Structured P2P systems ； cube-connected cycles ； Distributed Hash Table ； CODS

參考文獻

[2] A. Rowstron and P. Druschel, “Pastry: Scalable, distributed object Location and routing for large-scale peer-to-peer systems,” IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany, pages 329-350, November, 2001.

[3] Andy Oram, “Peer to Peer: Harnessing the Power of Disruptive Technologies,” Oreilly & Associates Inc, 2001

[4] B. Y. Zhao et al., “Tapestry: A Resilient Global-Scale Overlay for Service Deployment,” IEEE JSAC, Vol. 22, No. 1, pp. 41-53, Jan. 2004.

[6] Evangelos P. Markatos, “Tracing a large-scale Peer to Peer System: an hour in the life of Gnutella”. Proceedings of CCGrid 2002

[7] F. Preparata and J. Vuillemin. “The cube-connected cycles: A versatile network for parallel computation,” CACM, 24(5):300–309, 1981.