Abstract
The growing interest in Peer-to-Peer systems (such as Gnutella) has inspired numerous research activities. The problem in a schema-based Peer-to-Peer (P2P) system is how to locate Peers relevant to a given query. Different methods proposed routing strategies of queries taking into account the P2P network at hand. In this paper, we propose an architecture, based on (Super-) Peers, and we focus on query routing. Our approach considers that (Super-) Peers having similar interests are grouped together for an efficient query routing method. In such groups, called Super-Super-Peers (SSP), Super-Peers submit queries that are often processed by members of this group. A SSP is a specific Super-Peer that contains knowledge about: 1. its Super-Peers and 2. The other SSP. Knowledge is extracted by using data mining techniques (e.g. decision tree algorithms) starting from queries of Peers that transit on the network. The advantage of this distributed knowledge is that, it avoids making semantic mapping, between heterogeneous data sources owned by (Super-)Peers, each time the system decides to route query to other (Super-)Peers. The set of SSP improves the robustness in queries routing mechanism and scalability in P2P Network. Compared with a baseline approach, our proposed architecture shows that data mining technique increase performance with respect to response time and precision.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ioannidis, S., Marbach, P.: On the Design of Hybrid Peer-to-Peer Systems. In: SIGMETRICS 2008, Annapolis, Maryland, USA, June 2-6, pp. 157–168 (2008)
Annapureddy, S., Guha, S., Gkantsidis, C., Gunawardena, D., Rodriguez, P.R.: Is high-quality VoD feasible using P2P swarming? In: Proceedings of the 16th International Conference on World Wide Web, WWW 2007, pp. 903–912 (2007)
Liu, K., Bhaduri, K., Das, K., Nguyen, P., Kargupta, H.: Client-side Web Mining for domain Formation in Peer-to-Peer Environments. SIGKDD Explorations 8(2), 11–20 (2006)
Bhaduri, K., Kargupta, H.: Distributed Identification of Top-l Inner Product Elements and its Application in a Peer-to-Peer Network. IEEE Transactions on Knowledge and Data Engineering (TKDE) 20(4), 475–488 (2008)
Raahemi, B., Hayajneh, A., Rabinovitch, P.: Peer-to-Peer IP Traffic Classification Using Decision and IP Layer Attributes. International Journal of Business Data Communications and Networking 3(4), 60–74 (2007)
Bhaduri, K., Wolff, R., Giannella, C., Kargupta, H.: Distributed Decision Tree Induction in Peer-to-Peer Systems. Statistical Analysis and Data Mining Journal 1, 1864–1932 (2008)
Emekci, F., Sahin, O.D., Agrawal, D., Abbadi, A.E.: Privacy preserving decision tree learning over multiple parties. Data & Knowledge Engineering 63(2), 348–361 (2007)
Ahad Shahbaz, K., Rao Muhammad, A., Olof, T., Göran, F.: Data Mining in Oral Medicine Using Decision Trees. Proceedings of World Academy of Science, Engineering and Technology 27, 225–230 (2008)
Dang, T.H.: Mesures de discrimination et leurs applications en apprentissage inductif, Thesis, Paris 6 (2007)
Gay, D.: calcul de motifs sous contraintes pour la classification Supervisée, Thesis, Université de la Nouvelle Calédonie (2009)
Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and Regression Trees. Wadsworth and Brooks, Belmont (1984)
Ross Quinlan, J.: Induction of decision trees. Machine Learning 1, 81–106 (1986)
Quinlan, J.R.: C4.5: programs for machine learning. Morgan Kaufmann, San Francisco (1993)
Li, J., Stribling, J., Morris, R., Kaashoek, M., Gil, T.: A performance vs. cost framework for evaluating DHT design tradeoffs under churn. In: INFOCOM 2005, 24th Annual Joint Conference of the IEEE Computer and Communications Societies (2005); Proceedings IEEE 1, 225–236 (2005)
Garca, P., Pairot, C., Mondjar, R., Pujol, J., Tejedor, H., Rallo, R.: Planetsim: A new overlay network simulation framework. In: Gschwind, T., Mascolo, C. (eds.) SEM 2004. LNCS, vol. 3437, pp. 123–136. Springer, Heidelberg (2005)
Dabek, F., Zhao, B., Druschel, P., Kubiatowicz, J., Stoica, I.: Towards a common api for structured Peer-to-Peer overlays. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, pp. 33–44. Springer, Heidelberg (2003)
Stoica, Morris, R., Liben-Nowell, D., Karger, D., Kaashoek, M., Dabek, F., Balakrishnan, H.: Chord: a scalable Peer-to-Peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking 11(1), 17–32 (2003)
Manku, G., Bawa, M., Raghavan, P.: Symphony: Distributed hashing in a small world. In: 4th USENIX Symposium on Internet Technologies and Systems, pp. 127–140 (2003)
Naicken, S., Basu, A., Livingston, B., Rodhetbhai, S.: A Survey of Peer-to-Peer Network Simulators. In: Proceedings of the Seventh Annual Postgraduate Symposium, Liverpool, UK, pp. 70–76 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ismail, A., Barbar, A., Ismail, Z. (2011). P2P Queries Routing Using Distributed Knowledge. In: Ariwa, E., El-Qawasmeh, E. (eds) Digital Enterprise and Information Systems. DEIS 2011. Communications in Computer and Information Science, vol 194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22603-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-22603-8_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22602-1
Online ISBN: 978-3-642-22603-8
eBook Packages: Computer ScienceComputer Science (R0)