| Summary: | 碩士 === 長榮大學 === 資訊管理研究所 === 96 === 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.
|
|---|
