Peer Clustering and Firework Query Model

In this paper, we present a new strategy for information retrieval over the peer-to-peer (P2P) network. To avoid query messages flooding and saving resources in handling irrelevant queries in the P2P network, we propose a method for clustering peers that share similar properties together, thus, data inside the P2P network will be organized in a fashion similar to a Yellow Pages. In order to make use of our clustered P2P network efficiently, we also propose a new intelligent query routing strategy, the Firework Query Model. In contrast to broadcasting query message, our query message will first walk around the network from peer to peer randomly, once it reaches the target cluster, the query message explodes and is broadcasted by peers inside the cluster. We present our algorithm, give analysis and experimental results to demonstrate our method.