关键词: P2P系统 数据定位 查询Cache

Abstract:

Recently unstructured P2P systems have been deployed widely on the Internet. However, current search techniques used in the existing Gnutella-like pee r-to-peer systems are often very inefficient. In this paper we propose the CSTM mechanism to improve the performance and scalability of such systems. In  CSTM, each peer maintains a local state table containing the keyword information of data on all neighbors within T hops to guide query, and new peers j query locality and build shortcut connecti   ons to lately accessed peers. Simulations show that CSTM can reduce message cost one order of magnitude remarkably while maintaining short search path l  engths compared with flooding or random forwarding algorithms.

Key words: peer-to-peer system, search, query cache