The Community for Technology Leaders
2013 IEEE 33rd International Conference on Distributed Computing Systems Workshops (2005)
Columbus, Ohio, USA
June 6, 2005 to June 10, 2005
ISSN: 1545-0678
ISBN: 0-7695-2328-5
pp: 642-645
Jie Wu , Florida Atlantic University
Xiuqi Li , Florida Atlantic University
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 our scheme greatly improves the query efficiency without degrading the quality of the query results, compared to existing approaches.
Jie Wu, Xiuqi Li, "Cluster-Based Intelligent Searching in Unstructured Peer-to-Peer Networks", 2013 IEEE 33rd International Conference on Distributed Computing Systems Workshops, vol. 06, no. , pp. 642-645, 2005, doi:10.1109/ICDCSW.2005.49
100 ms
(Ver 3.3 (11022016))