Exploiting Query Feedback for Efficient Query Routing in Unstructured Peer-to-peer Networks

Authors: Iskandar Ishak, Naomie Salim

Abstract:

Unstructured peer-to-peer networks are popular due to its robustness and scalability. Query schemes that are being used in unstructured peer-to-peer such as the flooding and interest-based shortcuts suffer various problems such as using large communication overhead long delay response. The use of routing indices has been a popular approach for peer-to-peer query routing. It helps the query routing processes to learn the routing based on the feedbacks collected. In an unstructured network where there is no global information available, efficient and low cost routing approach is needed for routing efficiency. In this paper, we propose a novel mechanism for query-feedback oriented routing indices to achieve routing efficiency in unstructured network at a minimal cost. The approach also applied information retrieval technique to make sure the content of the query is understandable and will make the routing process not just based to the query hits but also related to the query content. Experiments have shown that the proposed mechanism performs more efficient than flood-based routing.

Keywords: Unstructured peer-to-peer, Searching, Retrieval, Internet.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1329689

References:

[1] "Napster," http://www.napster.com.
[2] "Gnutella," http://www.gnutella.com.
[3] J. Mishchke and B. Stiller, "A Methodology for the Design of Distributed Search in P2P middleware," IEEE Network, vol. 18, pp. 30- 37, 2004.
[4] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A Scalable Content-Addressable Network," presented at SIGCOMM'01, San Diego, California, 2001.
[5] I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, "Chord: A Scalable Peer-to-peer Lokup Service for Internet Applications," ACM, pp. 149-160, 2001.
[6] E.Cohen, A. Fiat, and H. Kaplan, "Associative search in peer-to-peer networks: Harnessing latent semantics," presented at Infocom, San Francisco, 2003.
[7] V. Kalogeraki, D. Gunopulos, and D. Zeinalipour-Yazti, "A local search mechanism for peer-to-peer networks," presented at International Conference on Information and Knowledge Management (CIKM '2002), McLean, Virginia, USA, 2002.
[8] B. Yang and H. Garcia-Molina, "Efficient Search in Peer-to-peer Networks," presented at Proceeding of the International Conference on Distributed Computing System, Vienna, Austria, 2002.
[9] K. Sripanidkulchai, B. Maggs, and H. Zhang, "Efficient content location using interest-based locality in peer-to-peer systems," presented at 22nd Annual Joint Conference on the IEEE Computer and Communications Societies (INFOCOM '03), San Francisco, Californa, USA, 2003.
[10] G. Koloniari and E. Pitoura, "Content-Based Routing of Path Queries in Peer-to-peer Systems," Advances in Database Technology, vol. 2992, pp. 29-47, 2004.
[11] D. Zeinalipour-Yazti, V. Kalogeraki, and D. Gunopolus, "Exploiting locality for scalable information retrieval in peer-to-peer networks," Information System, vol. 30, pp. 277-298, 2004.
[12] D. Zeinalipour, "Peerware," http://www.cs.ucr.edu/~csyiazti/peerware.html.