Hierarchical routing algorithms of topic driven queries over P2P network

摘要

P2P file sharing systems are becoming one of the most popular Internet applications, and occupy a major traffic in Internet. Recently, various searching methods have been changing from filename-based queries to contents-oriented queries. However, P2P distributed systems spend much more response time and consume the wide bandwidth of communication networks. In this paper, we propose techniques to manage routing tables by utilizing the characteristic of queries, so that we try to deal with topic-oriented query mechanisms instead of query broadcasting algorithms. We also adopt hierarchical routing tables in order to reduce the storage and management costs. Based on simulation models, we compare the performances between original query routing algorithm and our proposed algorithm.