Modeling Peer-to-Peer Networks with Interest-Based Clusters

Authors: Bertalan Forstner, Dr. Hassan Charaf

Abstract:

In the world of Peer-to-Peer (P2P) networking different protocols have been developed to make the resource sharing or information retrieval more efficient. The SemPeer protocol is a new layer on Gnutella that transforms the connections of the nodes based on semantic information to make information retrieval more efficient. However, this transformation causes high clustering in the network that decreases the number of nodes reached, therefore the probability of finding a document is also decreased. In this paper we describe a mathematical model for the Gnutella and SemPeer protocols that captures clustering-related issues, followed by a proposition to modify the SemPeer protocol to achieve moderate clustering. This modification is a sort of link management for the individual nodes that allows the SemPeer protocol to be more efficient, because the probability of a successful query in the P2P network is reasonably increased. For the validation of the models, we evaluated a series of simulations that supported our results.

Keywords: Peer-to-Peer, model, performance, networkmanagement.

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

References:

[1] Oram, A. (edited by), Peer-to-Peer: Harnessing the benefits of a distruptive technology (O-Reilly & Associates, Inc., 2001).
[2] OLeary, D., "Using ai in knowledge management. Knowledge bases and ontologies", IEEE Intelligent Systems 13 (1998) pp. 34-39.
[3] The Dublin Core homepage, http://dublincore.org/. (Projects built on the Dublin Core, (http://dublincore.org/projects/).
[4] The Gnutella homepage, http://gnutella.wego.com
[5] Resnik, P., "Semantic similarity in taxonomy: An information-based measure and its application problems of ambiguity in natural language", Journal of Artificial Intelligence Research 11 (1999) pp. 95-130.
[6] Cs├║cs, G. et al., "Peer to Peer Evaluation in Topologies Resembling Wireless Networks. An Experiment with Gnutella Query Engine", ICON2003: The 11th IEEE International Conference on Networks (Sydney, 2003) pp. 673.
[7] H. Assadi, "Construction of a Regional Ontology from Text and Its Use within a Documentary System International Conference on Formal Ontology and Information Systems", FOIS-98, IOS Press, Amsterdam (WebDB-2000), Springer-Verlag, Berlin, 2000, pp. 60-71.
[8] J.-U. Kietz, A. Maedche and R. Volz, "Semi-Automatic Ontology Acquisition from a Corporate Intranet", Proc. Learning Language in Logic Workshop (LLL-2000), ACL, New Brunswick, N.J., 2000, pp. 31-43.
[9] The Napster homepage, http://www.napster.com
[10] K. Sripanidkulchai, B. Maggs, H.Zhang, "Efficient content location using interest-based locality in peer-to-peer systems", Infocom, 2003.
[11] Joseph S., "P2P MetaData Search Layers", Second International Workshop on Agents and Peer-to-Peer Computing (AP2PC 2003).
[12] Marcello W Barbosa, Mellssa M Costa, Jussara M Almeida, Virgilio A P Alameida, "Using Locality of reference to improve performance of peer-to-peer applications". WOSP'04 & ACM SIGSOFT Software Engineering Notes V29n1(Jan 2004), pp.216-227.
[13] The WordNet project homepage, http://www.cogsci.princeton.edu/~wn/
[14] Bertalan Forstner, Gergely Csúcs, Kálmán Marossy, "Evaluating performance of peer-to-peer protocols with an advanced simulator", Parallel and Distributed Computing and Networks, 2005, Innsbruck, Austria.
[15] Bertalan Forstner, Hassan Charaf, "Neighbor Selection in Peer-to-Peer Networks Using Semantic Relations", WSEAS Transactions on Information Science & Applications, 2(2), February 2005. ISSN 1790- 0832, pp. 239-244.
[16] Paul Erdős, Alfred Rényi, "On the Strength of Connectedness of a Random Graph", Acta Math. Acad. Sci. Hungary, 12, 1961, pp. 261-267.
[17] Mark S. Granovetter, "The Strength of Weak Ties", American Journal of Sociology, 78 (1973), pp. 1360-1380.
[18] D. J. Watts, S. H. Strogatz, "Collective Dynamics of -Small-World- Networks", Nature, 393 (1998), pp. 440-442.
[19] Wolfgang Nejdl et al, "Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks", 20th International Conference on World Wide Web, Budapest, Hungary, May 2003. ISBN: 1-58113-680-3, Pp. 536-543.
[20] Wolfgang Nejdl, Wolf Siberski, Michael Sintek, "Design issues and challenges for RDF- and schema-based peer-to-peer systems", ACM SIGMOD Record, 32(3), September 2003.
[21] D. A. Menasc'e, V. A. F. Almeida, and L. W. Dowdy, "Capacity Planning for Web Services: metrics, models, and methods". Prentice Hall, 2001.
[22] Z. Ge, D. R. Figueiredo, S. Jaiswal, J. Kurose, and D. Towsley, "Modeling Peer-Peer File Sharing System" In Proceedings of INFOCOM 2003, San Francisco, USA, Apr 2003.
[23] Mihajlo A. Jovanovic, "Modeling Large-scale Peer-to-Peer Networks and a Case Study of Gnutella" MsC Thesis.