Abstract
Newscast is a model for information dissemination and membership management in large-scale, agent-based distributed systems. It deploys a simple, peer-to-peer data exchange protocol. The Newscast protocol forms an overlay network and keeps it connected by means of an epidemic algorithm, thus featuring a complex, spatially structured, and dynamically changing environment. It has recently become very popular due to its inherent resilience to node volatility as it exhibits strong self-healing properties. In this paper, we analyze the robustness of the data flow within the Newscast model against a set of vulnerabilities that have not been taken into account in previous analysis. In particular, we perform an attack based on a cache content corruption which is able to defeat the protocol by breaking the network connectivity. Concrete experiments are performed using a framework that implements both the protocol and the corruption model considered in this work.
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
Avizienis, A., Laprie, J.C., Randell, B., Landwehr, C.E.: Basic Concepts and Taxonomy of Dependable and Secure Computing. IEEE Transactions on Dependable and Secure Computing 1, 11–33 (2004)
Dutot, A., Guinand, F., Olivier, D., Pigné, Y.: GraphStream: A Tool for bridging the gap between Complex Systems and Dynamic Graphs. In: Emergent Properties in Natural and Artificial Complex Systems. Satellite Conference within the 4th European Conference on Complex Systems (ECCS 2007), Dresden, Allemagne (2007-2010), http://hal.archives-ouvertes.fr/hal-00264043 , ANR SARAH
GDF, The Gnutella Developer Forum: The annotated gnutella protocol specification v0.4 (2001), http://rfc-gnutella.sourceforge.net/developer/stable/index.html
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), http://dl.acm.org/citation.cfm?id=1045658.1045666
Jelasity, M., Montresor, A., Babaoglu, O.: Gossip-based aggregation in large dynamic networks. ACM Trans. Comput. Syst. 23(3), 219–252 (2005), http://doi.acm.org/10.1145/1082469.1082470
Jelasity, M., van Steen, M.: Large-scale newscast computing on the Internet. Tech. Rep. IR-503, Vrije Universiteit Amsterdam, Department of Computer Science, Amsterdam, The Netherlands (October 2002), http://www.cs.vu.nl/pub/papers/globe/IR-503.02.pdf
Laredo, J., Eiben, A., Steen, M., Merelo, J.: Evag: a scalable peer-to-peer evolutionary algorithm. Genetic Programming and Evolvable Machines 11(2), 227–246 (2010), http://dx.doi.org/10.1007/s10710-009-9096-z
Muszyński, J., Varrette, S., Bouvry, P., Seredyński, F., Khan, S.U.: Convergence Analysis of Evolutionary Algorithms in the Presence of Crash-Faults and Cheaters. Intl. Journal of Computers and Mathematics with Applications (CAMWA) 64(12), 3805–3819 (2012), http://www.sciencedirect.com/science/article/pii/S089812211200209X
Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)
Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A scalable Peer-To-Peer lookup service for internet applications. In: Proceedings of the 2001 ACM SIGCOMM Conference, pp. 149–160 (2001), citeseer.ist.psu.edu/stoica01chord.html
Varrette, S., Tantar, E., Bouvry, P.: On the Resilience of [distributed] Evolutionary Algorithms against Cheaters in Global Computing Platforms. In: Proc. of the 14th Intl. Workshop on Nature Inspired Distributed Computing (NIDISC 2011), Part of the 25th IEEE/ACM Intl. Parallel and Distributed Processing Symposium (IPDPS 2011), May 16-20, IEEE Computer Society, Anchorage (2011), http://www.ipdps.org/
Voulgaris, S., Jelasity, M., van Steen, M.: A Robust and Scalable Peer-to-Peer Gossiping Protocol. In: Moro, G., Sartori, C., Singh, M.P. (eds.) AP2PC 2003. LNCS (LNAI), vol. 2872, pp. 47–58. Springer, Heidelberg (2004)
Watts, D., Strogatz, S.: Collective dynamics of “small-world” networks. Nature 393, 440–442 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Muszyński, J., Varrette, S., Laredo, J.L.J., Bouvry, P. (2014). Analysis of the Data Flow in the Newscast Protocol for Possible Vulnerabilities. In: Kotulski, Z., Księżopolski, B., Mazur, K. (eds) Cryptography and Security Systems. CSS 2014. Communications in Computer and Information Science, vol 448. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44893-9_8
Download citation
DOI: https://doi.org/10.1007/978-3-662-44893-9_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44892-2
Online ISBN: 978-3-662-44893-9
eBook Packages: Computer ScienceComputer Science (R0)