Queries Routing In Super-Peer-Based System: Simulation and Evaluation

Peer-to-Peer (P2P) computing is currently attracting enormous attention. P2P systems have emerged as a popular way to share huge volumes of data. In such systems each peer is a database management system in itself, ex-posing its own schema. A fundamental problem that confronts peer-to-peer applications is the efficient location of the node that stores a desired data item. In such settings, the main objective is the efficient search across peer databases by processing each incoming query without overly consuming bandwidth. In this paper, the authors propose an architecture based on (super-)peers, and they focus on query routing.