An advertisement-based peer-to-peer search algorithm

• Published in: Journal of parallel and distributed computing 2009-07, Vol.69 (7), p.638-651
• Main Authors: Wang, Jun, Gu, Peng, Cai, Hailong
• Format: Article
• Language: English
• Subjects: Advertisement; Applied sciences; Computer science; control theory; systems; Computer systems and distributed systems. User interface; Exact sciences and technology; Information systems. Data bases; Memory organisation. Data processing; Peer-to-peer; Search algorithm; Software; Unstructured
• ISSN: 0743-7315; 1096-0848
• DOI: 10.1016/j.jpdc.2009.03.010

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.