Cluster-Based Intelligent Searching in Unstructured Peer-to-Peer Networks

Existing cluster-based searching schemes in unstructured peer-to-peer (P2P) networks employ flooding/random forwarding on connected dominating sets (CDS) of networks. There exists no upper bound on the size of CDS of a network. Both flooding and CDS hinder query efficiency. Random forwarding worsens the recall ratio. In this paper, we propose a cluster-based searching scheme that intelligently forward queries on the maximum independent sets (MIS) of networks. Our approach partitions the entire network into disjoint clusters with one clusterhead (CH) per cluster. CHs form a MIS and are connected through gateway nodes. Each node takes one role, a CH, a gateway, or an ordinary node. A CH looks up the data for the entire cluster using data summaries of cluster members, which are represented by bloom filters. Between clusters, CHs intelligently forward queries via gateways to the best neighbor CHs that are most likely to return query results. The experimental results demonstrate that o...

• Type: Conference
• Year: 2005
• Where: ICDCSW
• Authors: Xiuqi Li, Jie Wu
• Keywords: CDS Hinder Query, Cluster-based Searching Scheme, Distributed And Parallel Computing, ICDCSW 2005, Query Efficiency