Abstract
Newscast is a Peer-to-Peer, nature-inspired gossip-based data exchange protocol used for information dissemination and membership management in large-scale, agent-based distributed systems. The model follows a probabilistic scheme able to keep a self-organised, small-world equilibrium featuring a complex, spatially structured and dynamically changing environment. Newscast gained popularity since the early 2000 s thanks to its inherent resilience to node volatility as the protocol exhibits strong self-healing properties. However, the original design proved to be surprisingly fragile in a byzantine environment subjected to cheating faults. Indeed, a set of recent studies emphasized the hard-wired vulnerabilities of the protocol, leading to an efficient implementation of a malicious client, where a few naive cheaters are able to break the network connectivity in a very short time. Extending these previous works, we propose in this paper a modification of the seminal protocol with embedded counter-measures, improving the resilience of the scheme against malicious acts without significantly affecting the original Newscast’s properties nor its inherent performance. Concrete experiments were performed to support these claims, using a framework implementing all the solutions discussed 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
Similar content being viewed by others
References
Avizienis, A., Laprie, J.C., Randell, B., Landwehr, C.E.: Basic concepts and taxonomy of dependable and secure computing. IEEE Trans. Dependable Secure Comput. 1, 11–33 (2004)
Bortnikov, E., Gurevich, M., Keidar, I., Kliot, G., Shraer, A.: Brahms: Byzantine resilient random membership sampling. Comput. Netw. 53, 2340–2359 (2009)
Canon, L., Jeannot, E., Weissman, J.: A scheduling and certification algorithm for defeating collusion in desktop grids. In: 2011 31st International Conference on Distributed Computing Systems (ICDCS), pp. 343–352, June 2011
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://graphstream-project.org/
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)
Jelasity, M., Montresor, A., Babaoglu, O.: Gossip-based aggregation in large dynamic networks. ACM Trans. Comput. Syst. 23(3), 219–252 (2005)
Jelasity, M., van Steen, M.: Large-Scale newscast computing on the internet. Technical Report IR-503, Vrije Universiteit Amsterdam, Department of Computer Science, Amsterdam, The Netherlands, October 2002
Jesi, G.P., Montresor, A., Van Steen, M.: Secure peer sampling. Comput. Netw. 54, 2086–2098 (2010)
Johansen, H., Allavena, A., van Renesse, R.: Fireflies: Scalable support for intrusion-tolerant network overlays. SIGOPS Oper. Syst. Rev. 40(4), 3–13 (2006)
Laredo, J., Eiben, A., Steen, M., Merelo, J.: Evag: a scalable peer-to-peer evolutionary algorithm. Genet. Program Evolvable Mach. 11(2), 227–246 (2010)
Minsky, Y.M., Schneider, F.B.: Tolerating malicious gossip. Distrib. Comput. 16(1), 49–68 (2003)
Moore, R.: Cybercrime: Investigating high-technology computer crime. LexisNexis/Matthew Bender (2005)
Muszyński, J., Varrette, S., Laredo, J.L.J., Bouvry, P.: Analysis of the data flow in the newscast protocol for possible vulnerabilities. In: Kotulski, Z., Ksiżopolski, B., Mazur, K. (eds.) CSS 2014. CCIS, vol. 448, pp. 89–99. Springer, Heidelberg (2014)
Muszyński, J., Varrette, S., Laredo, J.L.J., Bouvry, P.: Exploiting the hard-wired vulnerabilities of newscast via connectivity-splitting attack. In: Au, M.H., Carminati, B., Kuo, C.-C.J. (eds.) NSS 2014. LNCS, vol. 8792, pp. 152–165. Springer, Heidelberg (2014)
Patel, J., Gupta, I., Contractor, N.: Jetstream: Achieving predictable gossip dissemination by leveraging social network principles. In: Fifth IEEE International Symposium on Network Computing and Applications, 2006, NCA 2006 pp. 32–39, July 2006
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)
Sherr, M., Loo, B.T., Blaze, M.: Veracity: A fully decentralized service for securing network coordinate systems. In: Proceedings of the 7th International Conference on Peer-to-peer Systems, IPTPS 2008, p. 15. USENIX Association, Berkeley (2008)
Stoica, I., 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 Trans. Netw. 11(1), 17–32 (2003)
Varrette, S., Tantar, E., Bouvry, P.: On the resilience of [distributed] evolutionary algorithms against cheaters in global computing platforms. In: Proceedings of the 14th International Workshop on Nature Inspired Distributed Computing (NIDISC 2011), part of the 25th IEEE/ACM International Parallel and Distributed Processing Symposium (IPDpPS 2011). IEEE Computer Society, Anchorage (Alaska), USA, 16–20 May 2011
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)
Zhao, B., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.D.: Tapestry: A resilient global-scale overlay for service deployment. IEEE J. Sel. Areas Commun. 22(1), 41–53 (2004)
Acknowledgments
The experiments presented in this paper were carried out using the HPC facility of the University of Luxembourg.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Muszyński, J., Varrette, S., Bouvry, P. (2016). Reducing Efficiency of Connectivity-Splitting Attack on Newscast via Limited Gossip. In: Squillero, G., Burelli, P. (eds) Applications of Evolutionary Computation. EvoApplications 2016. Lecture Notes in Computer Science(), vol 9597. Springer, Cham. https://doi.org/10.1007/978-3-319-31204-0_20
Download citation
DOI: https://doi.org/10.1007/978-3-319-31204-0_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-31203-3
Online ISBN: 978-3-319-31204-0
eBook Packages: Computer ScienceComputer Science (R0)