Abstract
Peer-to-peer systems such as Gnutella are resilient to failures at a single point in the network because of their decentralized nature. However an attack resulting in the removal of a small percentage of highly connected nodes could cripple such systems. We believe that distributed attack recovery is not simply a reactive process but requires proactive measures by the nodes in the system. We propose a distributed recovery method, where clients proactively detect attacks by monitoring the rate at which their first and second-degree neighbors leave the network and reconfigure themselves to form a topology that is more resilient to attacks when one has been detected. This topology is created and maintained through a new type of node discovery mechanism that is used during normal network operations. The recovery method is able to reconnect the network and deal with any ongoing attacks once one has started.
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
W. Aiello, F. Chung, and L Lu. “A Random Graph Model for Massive Graphs.” Symposium of Theory of Computing, 2000.
R. Albert, H. Jeong, and A. Barabási, “Error and attack tolerance in complex networks,” Nature 406
A. Barabási and R. Albert, “Emergence of scaling in random networks,” Science, 286
F. Buckley and F. Harary, Distance in Graphs. Addison-Wesley, New York, 1990.
http://www.clip2.com, Gnutella Measurement Project
C. Faloutsos, M. Faloutsos and P. Faloutsos, “On power-law relationships of the Internet Topology,” Proc. of ACM SIGCOMM, Aug. 1999.
http://www.gnutelliums.com/linux unix/gnut/doc/gnutella-prot.html
A. Medina, I. Matta and J. Byers, “On the Origin of Power Laws in Internet Topologies,” ACM Computer Communication Review, vol. 30, no. 2, Apr. 2000
D. Moore, G. Voelker, and S. Savage, “Inferring Internet Denial-of-Service Activity,” in Proceedings of the 2001 USENIX Security Symposium.
S. Saroiu, P. Krishna Gummadi, and S. Gribble, “A measurement study of peer-to-peer file sharing systems,” Technical Report UW-CSE-01-06-02, University of Washington, June 2001.
R. Cohen, K. Erez, D. ben-Avraham and S. Havlin, “Breakdown of the Internet under intentional attack,” Phys. Rev. Lett. 86,3682 (2001)
B. Yang and H. Garcia-Molina, “Comparing hybrid peer-to-peer systems,” In Proceedings of the 27th International Conference on Very Large Databases, September 2001.
M. Ripeanu, I. Foster and A. Iamnitchi, “Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System”, IEEE Internet Computing Journal special issue on peer-to-peer networking, vol. 6(1) 2002.
B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph, “Tapestry: An infrastructure for fault-resilient wide-area location and routing”, Technical Report U. C. Berkeley, April 2001.
A. Rowstone, P. Druschel, “Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems”, in Middleware, 2001
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Keyani, P., Larson, B., Senthil, M. (2002). Peer Pressure: Distributed Recovery from Attacks in Peer-to-Peer Systems. In: Gregori, E., Cherkasova, L., Cugola, G., Panzieri, F., Picco, G.P. (eds) Web Engineering and Peer-to-Peer Computing. NETWORKING 2002. Lecture Notes in Computer Science, vol 2376. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45745-3_29
Download citation
DOI: https://doi.org/10.1007/3-540-45745-3_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44177-9
Online ISBN: 978-3-540-45745-9
eBook Packages: Springer Book Archive