On Using Histograms as Routing Indexes in Peer-to-Peer Systems

Peer-to-peer systems offer an efficient means for sharing data among autonomous nodes. A central issue is locating the nodes with data matching a user query. A decentralized solution to this problem is based on using routing indexes which are data structures that describe the content of neighboring nodes. Each node uses its routing index to route a query towards those of its neighbors that provide the largest number of results. We consider using histograms as routing indexes. We describe a decentralized procedure for clustering similar nodes based on histograms. Similarity between nodes is defined based on the set of queries they match and related with the distance between their histograms. Our experimental results show that using histograms to cluster similar nodes and to route queries increases the number of results returned for a given number of nodes visited.

• Type: Conference
• Year: 2004
• Where: DBISP2P
• Authors: Yannis Petrakis, Georgia Koloniari, Evaggelia Pitoura
• Keywords: Autonomous Nodes, DBISP2P 2004, Routing, Similar Nodes