Distributed ranking over peer-to-peer networks

Query flooding is a problem existing in Peer-to-Peer networks like Gnutella. Firework Query Model solves this problem by Peer Clustering and routes the query message more intelligently. However, it still contains drawbacks like query flooding inside clusters. The condition can be improved if the query message can send directly to the query destination, as the message does not need to send hop by hop. This can be achieved by ranking. By ranking, the network can know the destination and the information quality shared by each peer. We introduce distributed ranking in this paper. We give background of FQM, outline of the proposed method, and conduct a series of experiments that demonstrate the significant reduction of query flooding in a P2P network. Categories & Subject Descriptors: H.3.3 [Information Storage and Retrieval]: Information Serarch and Retrieval ? Search Process; H.3.4 [Information Storage and Retrieval]: System and Software ? Distributed Systems; General Terms: Algorith...

• Type: Conference
• Year: 2004
• Where: WWW
• Authors: Dexter Chi Wai Siu, Tak Pang Lau
• Keywords: Firework Query Model, Internet Technology, Query Flooding, Query Message, WWW 2004