A Message-Efficient Peer-to-Peer Search Protocol Based on Adaptive Index Dissemination

DOI IR Web Site 40 References
  • WU Yu
    Graduate School of Information Science and Technology, Osaka University
  • IZUMI Taisuke
    Graduate School of Engineering, Nagoya Institute of Technology
  • OOSHITA Fukuhito
    Graduate School of Information Science and Technology, Osaka University
  • KAKUGAWA Hirotsugu
    Graduate School of Information Science and Technology, Osaka University
  • MASUZAWA Toshimitsu
    Graduate School of Information Science and Technology, Osaka University

Search this article

Abstract

Resource search is a fundamental problem in large-scale and highly dynamic Peer-to-Peer (P2P) systems. Unstructured search approaches are widely used because of their flexibility and robustness. However, such approaches incur high communication cost. The index-dissemination-based search is a kind of efficient unstructured search approach. We investigate such approaches with respect to minimize the system communication cost. Based on a dynamic system model that peers continuously leave and join, we solve two problems. One problem is how to efficiently disseminate and maintain a given number of indices. Another is to determine the optimal number of indices for each resource object of a given popularity. Finally, we propose an optimized index dissemination scheme which is fully decentralized and self-adaptive. A remarkable advantage is that the scheme yields no additional communication cost to achieve the self-adaptive feature.

Journal

References(40)*help

See more

Related Projects

See more

Keywords

Details 詳細情報について

Report a problem

Back to top