An advertisement-based peer-to-peer search algorithm

    Authors

    J. Wang; P. Gu;H. L. Cai

    Comments

    Authors: contact us about adding a copy of your work at STARS@ucf.edu

    Abbreviated Journal Title

    J. Parallel Distrib. Comput.

    Keywords

    Peer-to-peer; Unstructured; Advertisement; Search algorithm; Computer Science, Theory & Methods

    Abstract

    Most of the existing search algorithms for unstructured peer-to-peer (P2P) systems share one common approach: the requesting node sends out a keyword search query and the query message is repeatedly routed and forwarded to other peers in the overlay network. Due to multiple hops involved in query forwarding, the search may result in a long delay before it is answered. Furthermore, some incapable nodes may be overloaded when the query traffic becomes intensive or bursty. In this paper, we present a novel content-pushing. Advertisement-based Search Algorithm for unstructured Peer-to-peer systems (ASAP). An advertisement (ad) is a synopsis of contents a peer tends to share, and appropriately distributed and selectively cached by other peers in the system. In ASAP, nodes proactively advertise their contents by delivering ads, and selectively storing interesting ads received from other peers. Upon a request. a node can locate the destination nodes by looking up its local ads repository, and thus obtain a one-hop search latency with modest search cost. Comprehensive experimental results show that, compared with traditional query-based search algorithms, ASAP achieves much better search efficiency, and maintains system load at a low level with small variations. In addition, ASAP works well under node churn. (C) 2009 Elsevier Inc. All rights reserved.

    Journal Title

    Journal of Parallel and Distributed Computing

    Volume

    69

    Issue/Number

    7

    Publication Date

    1-1-2009

    Document Type

    Article

    Language

    English

    First Page

    638

    Last Page

    651

    WOS Identifier

    WOS:000266945000005

    ISSN

    0743-7315

    Share

    COinS