DHT-based peer-to-peer search system using pseudo-candidate key indexing

Abstract

In service in the ubiquitous networking environment, it is expected that flexible interaction between the user and the things (resource) in the real world will become important. In order to realize such an interaction, there must be a system in which the resource to be utilized can be searched for with its attribute information as keys. Consequently, this paper proposes a DHT (distributed hash table)-based P2P search system using a new indexing method called pseudo-candidate key indexing. A problem of the conventional DHT-based P2P search system is that a large amount of communication is needed in the search process. The proposed system attempts to deal with the problem by preparing an index for all search conditions which are useful to the user, thus reducing the amount of communication in the search. A simulation verifies that the proposed system is scalable. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 1, 90(11): 81–94, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecja.20317