Searching Techniques in P2P Instant Messaging System

摘要

Recently Peer-to-Peer networks (P2P) have gained great attention and popularity. One key challenging aspect in P2P resource sharing environments is how to achieve efficient searching mechanism. As system scale increasing, scalability has become urgent problem need to solve and hot research area, especially for completely decentralized p2p network. With different P2P overlay network architecture, different searching mechanism and routing algorithm can achieve better performance. Generally, a fine searching algorithm should respond to the query message promptly and without generating excessive query messages. We take searching efficiency and message redundant-degree as the most important design criteria for evaluating a searching mechanism. In this paper, a hybrid search model is given out in building our P2P Instant Messaging (PIM) system. The overlay network is built based on completely distributed architecture, a self-organizing coordination method is adapted for quickly searching peer neighbors. As an optional measurement, some known ILS servers are used to help the searching of peer neighbors.