Analysis of Queries Routing in Super-Super-Peer Based P2P Architecture Using NBTree: The Hybrid Algorithm

Abstract

The Internet is converging to a more dynamic, huge, fully distributed peer-to-peer (P2P) overlay networks containing millions of nodes typically for the purpose of information distribution and file sharing as the increase in the number of computers connected to the Internet are increasing rapidly. Because of which a challenging problem in unstructured P2P system is how to locate peers that are relevant with respect to a given query with minimum query processing and minimum answering time. Connected peers can leave the overlay network any time and new peers can join it any time. To achieve our goal we suggest an unstructured P2P system which is based on an organization of peers around super-peers that is connected to super-superpeer

according to their semantic domains and also uses NBTree: The Hybrid Algorithm to extract Super-Peer that contains peers with relevant data respect to a given query.

Keywords: Decision Tree, Machine Learning, NBTree, P2P, P2P Queries Answering, P2P Queries Routing, Super-Super-Peer, Weka