By Topic

A decision tree for queries routing in hierarchical peer-to-peer network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Ismail, A. ; LSIS, Univ. de St.-Jerome, Marseille, France ; Quafafou, M. ; Nachouki, G. ; Hajjar, M.

Since a large amount of information is added onto the internet on a daily basis, the efficiency of peer-to-peer (P2P) search has become increasingly important. However, how to quickly discover the right resource in a large-scale P2P network without generating too much network traffic and with minimum possible time remain highly challenging. In this paper, we propose a new P2P search method by applying the concept of data mining (decision tree) in order to improve search performance. We focus on routing queries to the right destination. Through a super-peer-based architecture, peers having similar interests are grouped together under a super-peer (SP) connected to a Meta-Super-Peer (MSP) operating with an index (decision tree) to predict the relevant domains (super-peers) to answer a given query. Compared with a super-peer based approach, our proposal architectures show the effect of the data mining with better performance with respect to response time and precision.

Published in:

Informatics and Systems (INFOS), 2010 The 7th International Conference on

Date of Conference:

28-30 March 2010