LRS: A Novel Learning Routing Scheme for Query Routing on Unstructured P2P Systems

  • Taoufik Yeferny
  • Khedija Arour
  • Amel Bouzeghoub
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8320)


Query routing is a fundamental problem in unstructured Peer-to-Peer systems. Recently, researches in this area have focused on methods based on query-oriented routing indices. These methods use the historical information of past queries and query hits to build a local knowledge base per peer, which represents the user’s interests or profile. Existing approaches represent the user’s profile only by some statistics about past queries and they have not addressed two difficult challenging problems: (i) the bootstraping (ii) the unsuccessful relevant peers search. Indeed, when a peer selects an insufficient number of relevant peers from its local knowledge base, it floods the query through the network, which badly affects the routing efficiency and effectiveness. To tackle these problems, we introduce a novel Learning Routing Scheme (LRS). We implemented the proposed scheme and compared its routing efficiency and retrieval effectiveness with a broadcasting scheme (without learning) and a learning scheme taken from the literature. Experimental results show that our scheme carries out better than other ones with respect to accuracy.


P2P Learning routing methods Clustering 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Callan, J.P., Lu, Z., Croft, W.B.: Searching distributed collections with inference networks. In: The 18th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 21–28 (1995)Google Scholar
  2. 2.
    Carchiolo, V., Malgeri, M., Mangioni, G., Nicosia, V.: Emerging structures of p2p networks induced by social relationships. Comput. Commun. 31(3), 620–628 (2008)CrossRefGoogle Scholar
  3. 3.
    Christoph, T., Steffen, S., Adrian, W.: Semantic query routing in peer-to-peer networks based on social metaphors. In: 13th International World Wide Web Conference (WWW 2004), New York City, USA, pp. 55–68 (2004)Google Scholar
  4. 4.
    Ciraci, S., Körpeoglu, I., Ulusoy, O.: Reducing query overhead through route learning in unstructured peer-to-peer network. J. Netw. Comput. Appl. 32(3), 550–567 (2009)CrossRefGoogle Scholar
  5. 5.
    Crespo, A., Garcia-Molina, H.: Routing indices for peer-to-peer systems. In: Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS 2002), Vienna, Austria, pp. 23–30 (2002)Google Scholar
  6. 6.
    Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, New York (1997)Google Scholar
  7. 7.
    Gnutella: Gnutella Web site (March 2009),
  8. 8.
    Godin, R., Missaoui, R., Alaoui, H.: Incremental concept formation algorithms based on galois (concept) lattices. Computational Intelligence 11(2), 246–267 (1995)CrossRefGoogle Scholar
  9. 9.
    Goh, S.-T., Kalnis, P., Bakiras, S., Tan, K.-L.: Real datasets for file-sharing peer-to-peer systems. In: Zhou, L.-Z., Ooi, B.-C., Meng, X. (eds.) DASFAA 2005. LNCS, vol. 3453, pp. 201–213. Springer, Heidelberg (2005)Google Scholar
  10. 10.
    Hsiao, H.C., Su, H.W.: On optimizing overlay topologies for search in unstructured peer-to-peer networks. IEEE Transactions on Parallel and Distributed Systems 23, 924–935 (2012)CrossRefGoogle Scholar
  11. 11.
    Huang, J., Li, X., Wu, J.: A class-based search system in unstructured p2p networks. In: Proceedings of the 21st International Conference on Advanced Networking and Applications (AINA 2007), pp. 76–83 (2007)Google Scholar
  12. 12.
    Jelasity, M., Montresor, A., Jesi, G.P., Voulgaris, S.: The peersim simulator (March 2010),
  13. 13.
    Jin, H., Ning, X., Chen, H., Yin, Z.: Efficient query routing for information retrieval in semantic overlays. In: Proceedings of the 21st Annual ACM Symposium on Applied Computing (SAC 2006), Dijon, France, pp. 23–27 (2006)Google Scholar
  14. 14.
    Kalogeraki Vana, G.D., Zeinalipour-Yazti, D.: A local search mechanism for peer-to-peer networks. In: Proceedings of the Eleventh International Conference on Information and Knowledge Management (CIKM 2002), McLean, Virginia, USA, pp. 300–307 (2002)Google Scholar
  15. 15.
    Kumar, A., Xu, J., Zegura, E.W.: Efficient and scalable query routing for unstructured peer-to-peer networks. In: (INFOCOM 2005), Miami, USA, pp. 1162–1173 (2005)Google Scholar
  16. 16.
    Luis, G., Hector, G., Anthony, T.: The effectiveness of gloss for the text database discovery problem. In: Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data (1994)Google Scholar
  17. 17.
    Makhoul, J., Kubala, F., Schwartz, R., Weischedel, R.: Performance measures for information extraction. In: Proceedings of DARPA Broadcast News Workshop (DARPA 1999), Herndon, VA, pp. 249–252 (1999)Google Scholar
  18. 18.
    Mandreoli, F., Martoglia, R., Penzo, W., Sassatelli, S.: Data-sharing p2p networks with semantic approximation capabilities. IEEE Internet Computing 13, 60–70 (2009)CrossRefGoogle Scholar
  19. 19.
    Raja, C., Bruno, D., Georges, H.: Définition et diffusion de signatures sémantiques dans les systèmes pair-à-pair. In: Extraction et gestion des connaissances (EGC 2006), Lille, France, pp. 463–468 (2006)Google Scholar
  20. 20.
    RARE: Rare project. (March 2010),
  21. 21.
    Sergio, A.P., Carlos, B., Nuno, P., David, H.: Scalable bloom filters. Inf. Process. Lett. 101Google Scholar
  22. 22.
    Shen, W.W., Su, S., Shuang, K., Yang, F.C.: Skip: an efficient search mechanism in unstructured p2p networks. The Journal of China Universities of Posts and Telecommunications 17(5), 64–71 (2011)CrossRefGoogle Scholar
  23. 23.
    Shi, C., Han, D., Liu, Y., Meng, S., Yu, Y.: A dynamic routing protocol for keyword search in unstructured peer-to-peer networks. Computer Communications 31(2), 318–331 (2008)CrossRefGoogle Scholar
  24. 24.
    TREC: Text REtrival Conference (March 2010),
  25. 25.
    Yang, B., Garcia-Molina, H.: Improving search in peer-to-peer networks. In: The 22nd International Conference on Distributed Computing Systems (ICDCS 2002), Vienna, Austria, pp. 5–14 (2002)Google Scholar
  26. 26.
    Yeferny, T., Arour, K.: Learningpeerselection: A query routing approach for information retrieval in p2p systems. In: International Conference on Internet and Web Applications and Services (ICIW 2010), Barcelona, Spain, pp. 235–241 (2010)Google Scholar
  27. 27.
    Yeferny, T., Arour, K.: Efficient routing method in p2p systems based upon training knowledge. In: The Eighth International Symposium on Frontiers of Information Systems and Network Applications, in Conjunction with AINA (WAINA 2012), Fukuoka, Japan, pp. 300–305 (2012)Google Scholar
  28. 28.
    Yeferny, T., Bouzeghoub, A., Arour, K.: A query learning routing approach based on semantic clusters. International Journal of Advanced Information Technology (IJAIT) 1(6) (2011)Google Scholar
  29. 29.
    Zammali, S., Arour, K.: P2PIRB: Benchmarking framework for P2PIR. In: Hameurlain, A., Morvan, F., Tjoa, A.M. (eds.) Globe 2010. LNCS, vol. 6265, pp. 100–111. Springer, Heidelberg (2010)Google Scholar
  30. 30.
    Zhu, Y., Yang, X., Hu, Y.: Making search efficient on gnutella-like p2p systems. In: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2005), Washington, DC, USA, pp. 1–56 (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Taoufik Yeferny
    • 1
    • 3
  • Khedija Arour
    • 2
  • Amel Bouzeghoub
    • 3
  1. 1.Dept. of Computer Science, Faculty of Sciences of TunisTunisia LISI Research GroupTunisia
  2. 2.Dept. of Computer Science, National Institute of Applied Sciences and Technology of TunisTunisia URPAH Research GroupTunisia
  3. 3.Dept. of Computer Science, TELECOM SudparisSAMOVAR Research GroupFrance

Personalised recommendations