Abstract
Social networking sites allow individuals to communicate and share information. Most of P2P systems assume that all peers cooperate for the benefit of the entire network. However, in practice, there is a significant portion of peers that extract resources from the system without contributing in return. Peer-to-peer applications can benefit from human friendship networks (such as e-mail contacts or instant messaging friend lists). However, these networks are not always available. To this end, we study a protocol, called SLACER (Selfish Link-based Adaptation for Cooperation Excluding Rewiring), that allows peer nodes to create their own friendship networks, through random interactions, producing an artificial social network (ASN) where nodes share high trust with their neighbors. To do so, this paper specifically study P2P networks, which constitute the context for the application of the SLACER protocol; an implementation based on the peersim simulator of the rewiring factor W which represents the possibility of rewiring nodes in a peer network; then our main contribution which is the analysis of simulation results obtained on a larger network size with several values of W; finally we do a performance study by comparative study with SLAC (previous version of SLACER).
Supported by organization x.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Anceaume, E., Gradinariu, M., Ravoaja, A.: Théorie des jeux et systemes de pairs. Publication interne- IRISA (2004)
Hales, D., Arteconi, S.: SLACER: a self-organizing protocol for coordination in peer-to-peer networks. J. IEEE Intell. Syst. 21, 29–35 (2006)
Siebert, J., Ciarletta, L., Chevrier, V.: Impact du comportement des utilisateurs dans les réseaux pair-à-pair (P2P): modélisation et simulation multi-agents. In: 16es Journées Francophones des Systèmes Multi-Agents-JFSMA’08, pp. 129–138 (2008)
Hales, D., Arteconi, S.: Friends for free: self-organizing artificial social networks for trust and cooperation. arXiv preprint cs/0509037 (2005)
Marzolla, M.: Simulating overlay network with Peersim. http://www.moreno.marzolla.name
Sueur, C.: Analyse des réseaux sociaux appliquée à l’éthologie et l’écologie. publisher=Éditions Matériologiques (2015)
Hales, D.: From selfish nodes to cooperative networks-emergent link-based incentives in peer-to-peer networks. In: Proceedings of the Fourth International Conference on Peer-to-Peer Computing, 2004. Proceedings, pp. 151–158. IEEE (2004)
Jelasity, M., Guerraoui, R., Kermarrec, A.-M., van Steen, M.: The peer sampling service: experimental evaluation of unstructured gossip-based implementations. In: Jacobsen, H.-A. (ed.) Middleware 2004. LNCS, vol. 3231, pp. 79–98. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-30229-2_5
Montresor, A., Jelasity, M.. PeerSim: a scalable P2P simulator. In: 2009 IEEE Ninth International Conference on Peer-to-Peer Computing, pp. 99–100. IEEE (2009)
Hales, D., Arteconi, S., Babaoglu, O.: SLACER: randomness to cooperation in peer-to-peer networks. In: 2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing, p. 5. IEEE (2005)
Hales, D., Arteconi, S., Babaoglu, O.: SLAC and SLACER: simple copy and rewire algorithms for trust and cooperation in P2P
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Bagre, A., Bikienga, M., Tiendrebeogo, T. (2024). Study of the Rewiring Factor in an Unstructured P2P. In: Seeam, A., Ramsurrun, V., Juddoo, S., Phokeer, A. (eds) Innovations and Interdisciplinary Solutions for Underserved Areas. InterSol 2023. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 541. Springer, Cham. https://doi.org/10.1007/978-3-031-51849-2_22
Download citation
DOI: https://doi.org/10.1007/978-3-031-51849-2_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-51848-5
Online ISBN: 978-3-031-51849-2
eBook Packages: Computer ScienceComputer Science (R0)