| Summary: | 碩士 === 國立臺灣大學 === 電機工程學研究所 === 95 === P2P overlay architectures are gaining more and more attention. Structured P2P network systems that use Distributed Hashing Tables (DHTs) can be more efficient than flooding based unstructured P2P network systems. But DHTs did not suit for key word search, so we choose using unstructured P2P networks as our architecture. In order to solve the topology mismatch problem, many people take account of locality information when designing peer-to-peer overlay networks. Here, we not only exploit locality but also take resource features into account. Taking advantage of concepts of data replication, selective search, clustering, and interest group can improve the search performance of unstructured P2P networks. Our analysis shows that the overhead of locating procedure is O (log N), and N is the number of peers in the overlay network. Simulation proves that our algorithm is better than the mOverlay network in the number of messages per search and the hit ratio.
|
|---|
