Exploiting local popularity to prune routing indices in peer-to-peer systems

• Published in: 16th International Workshop on Database and Expert Systems Applications (DEXA'05) pp. 790 - 795
• Main Authors: Bressan, S., Hidayanto, A.N., Hasibuan, Z.A.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 2005
• Subjects: Broadcasting; Computer science; Conferences; Floods; Learning; Peer to peer computing; Performance analysis; Protocols; Routing; Storage automation
• ISBN: 9780769524245; 0769524249
• ISSN: 1529-4188; 2378-3915
• DOI: 10.1109/DEXA.2005.89

Routing in unstructured peer-to-peer systems relies either on broadcasting (also called flooding) or on routing indices. An approach using routing indices is only scalable if the routing indices are of manageable size. In this paper, we present a strategy to prune routing indices based on popularity of resources. Routing indices maintain routing information for queries to the most popular resources, leaving queries to other resources to be routed randomly. The popularity of resources at each node of a network is learnt by each routing index, by means of a replacement strategy. We compare the performance of the local popularity method against that of the global popularity method in pruning routing indices in both static and dynamic environments. We compare the effectiveness and the efficiency of two standard replacement strategies: least frequently used (LFU) and least recently used (LRU). Our results confirm the efficiency and effectiveness of pruning routing indices based on the local popularity of resources in unstructured peer-to-peer networks.