Abstract
This paper analyzes a class of dissemination algorithms for the discovery of distributed contents in Peer-to-Peer unstructured overlay networks. The algorithms are a mix of protocols employing local knowledge of peers’ neighborhood and gossip. By tuning the gossip probability and the depth k of the k-neighborhood of which nodes have information, we obtain different dissemination protocols employed in literature over unstructured P2P overlays. The provided analysis and simulation results confirm that, when properly configured, these schemes represent a viable approach to build effective P2P resource discovery in large-scale, dynamic distributed systems.
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
Preview
Unable to display preview. Download preview PDF.
References
Aiello, W., Chung, F., Lu, L.: A random graph model for power law graphs. Experimental Math. 10, 53–66 (2000)
Cholvi, V., Felber, P., Biersack, E.: Efficient search in unstructured peer-to-peer networks. In: Proc. of the 16th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2004, pp. 271–272. ACM, New York (2004)
D’Angelo, G., Ferretti, S.: Simulation of scale-free networks. In: Simutools 2009: Proc. of the 2nd International Conference on Simulation Tools and Techniques, ICST, pp. 1–10. ICST, Brussels (2009)
D’Angelo, G., Ferretti, S., Marzolla, M.: Adaptive event dissemination for peer-to-peer multiplayer online games. In: Proc. of the Int. Conf. on Simulation Tools and Techniques (SIMUTools 2011). ICST (2011)
Ferretti, S.: On the degree distribution of faulty peer-to-peer overlay networks. EAI Endorsed Transactions on Complex Systems 12(1), 11 (2012)
Ferretti, S.: Publish-subscribe systems via gossip: a study based on complex networks. In: Proc. of the 4th Annual Workshop on Simplifying Complex Networks for Practitioners, SIMPLEX 2012, pp. 7–12. ACM, New York (2012)
Hidalgo, N., Rosas, E., Arantes, L., Marin, O., Sens, P., Bonnaire, X.: Dring: A layered scheme for range queries over dhts. In: Proc. of the 2011 IEEE 11th International Conference on Computer and Information Technology, CIT 2011, pp. 29–34. IEEE (2011)
Keidar, I., Melamed, R.: Evaluating unstructured peer-to-peer lookup overlays. In: Proceedings of the 2006 ACM Symposium on Applied Computing, SAC 2006, pp. 675–679. ACM, New York (2006)
Montresor, A., Jelasity, M., Babaoglu, O.: Robust aggregation protocols for large-scale overlay networks. In: Proc. of the 2004 Int. Conference on Dependable Systems and Networks, DSN 2004, pp. 19–28. IEEE Computer Society, Florence (2004)
Newman, M.E.J.: Random graphs as models of networks, pp. 35–68. Wiley-VCH Verlag GmbH and Co. KGaA (2005)
Puttaswamy, K.P.N., Sala, A., Zhao, B.Y.: Searching for rare objects using index replication. In: 27th IEEE International Conference on Computer Communications, pp. 1723–1731. IEEE (2008)
Voulgaris, S., Gavidia, D., van Steen, M.: Cyclon: Inexpensive membership management for unstructured p2p overlays. Journal of Network and Systems Management 13(2), 197–217 (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Ferretti, S. (2014). Searching in Unstructured Overlays Using Local Knowledge and Gossip. In: Contucci, P., Menezes, R., Omicini, A., Poncela-Casasnovas, J. (eds) Complex Networks V. Studies in Computational Intelligence, vol 549. Springer, Cham. https://doi.org/10.1007/978-3-319-05401-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-05401-8_7
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-05400-1
Online ISBN: 978-3-319-05401-8
eBook Packages: EngineeringEngineering (R0)