More Web Proxy on the site http://driver.im/

Article

Peer Pressure: Distributed Recovery from Attacks in Peer-to-Peer Systems

Authors:

Muthukumar SenthilAuthors Info & Claims

Revised Papers from the NETWORKING 2002 Workshops on Web Engineering and Peer-to-Peer Computing

Pages 306 - 320

Published: 19 May 2002 Publication History

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.

References

[1]

W. Aiello, F. Chung, and L Lu. "A Random Graph Model for Massive Graphs." Symposium of Theory of Computing, 2000.

[2]

R. Albert, H. Jeong, and A. Barabási, "Error and attack tolerance in complex networks," Nature 406.

[3]

A. Barabási and R. Albert, "Emergence of scaling in random networks," Science, 286.

[4]

http://www.bearshare.com/

[5]

F. Buckley and F. Harary, Distance in Graphs. Addison-Wesley, New York, 1990.

[6]

www.clip2.com, Gnutella Measurement Project.

[7]

http://www.clip2.com/GnutellaProtocol04.pdf

[8]

C. Faloutsos, M. Faloutsos and P. Faloutsos, "On power-law relationships of the Internet Topology," Proc. of ACM SIGCOMM, Aug. 1999.

[9]

http://www.gnutelliums.com/linux_unix/gnut/doc/gnutella-prot.html

[10]

A. Medina, I. Matta and J. Byers, "On power-law relationships of the Internet ACM Computer Communication Review, vol. 30, no. 2, Apr. 2000.

[11]

D. Moore, G. Voelker, and S. Savage, "Inferring Internet Denial-of-Service Activity," in Proceedings of the 2001 USENIX Security Symposium.

[12]

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.

[13]

http://www.denialinfo.com/

[14]

R. Cohen, K. Erez, D. ben-Avraham and S. Havlin, "Breakdown of the Internet under intentional attack," Phys. Rev. Lett. 86, 3682 (2001).

[15]

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.

[16]

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.

[17]

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.

[18]

A. Rowstone, P. Druschel, "Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems", in Middleware, 2001.

Cited By

Chen GSarrafzadeh ALow CZhang L(2010)A self-organization mechanism based on cross-entropy method for P2P-like applicationsACM Transactions on Autonomous and Adaptive Systems10.1145/1867713.18677165:4(1-31)Online publication date: 19-Nov-2010
https://dl.acm.org/doi/10.1145/1867713.1867716
He YRen HLiu YYang B(2009)On the reliability of large-scale distributed systems - A topological viewComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2009.03.01253:12(2140-2152)Online publication date: 1-Aug-2009
https://dl.acm.org/doi/10.1016/j.comnet.2009.03.012
Bachrach YParnes AProcaccia ARosenschein J(2009)Gossip-based aggregation of trust in decentralized reputation systemsAutonomous Agents and Multi-Agent Systems10.1007/s10458-008-9073-619:2(153-172)Online publication date: 1-Oct-2009
https://dl.acm.org/doi/10.1007/s10458-008-9073-6
Show More Cited By

Peer Pressure: Distributed Recovery from Attacks in Peer-to-Peer Systems
1. Software and its engineering
  1. Software organization and properties
    1. Software system structures

Recommendations

Building resilient low-diameter peer-to-peer topologies

As more applications rely on underlying peer-to-peer topologies, the need for efficient and resilient infrastructure has become more pressing. A number of important classes of topologies have emerged over the last several years, all with various ...
An efficient and secure overlay network for general peer-to-peer systems
Locality in structured peer-to-peer networks

Distributed hash tables (DHTs), used in a number of structured peer-to-peer (P2P) systems, provide efficient mechanisms for resource placement and location. A key distinguishing feature of current DHT systems, such as Chord, Pastry, CAN and Tapestry, is ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Guide Proceedings

Revised Papers from the NETWORKING 2002 Workshops on Web Engineering and Peer-to-Peer Computing

May 2002

350 pages

ISBN:3540441778

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 19 May 2002

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Chen GSarrafzadeh ALow CZhang L(2010)A self-organization mechanism based on cross-entropy method for P2P-like applicationsACM Transactions on Autonomous and Adaptive Systems10.1145/1867713.18677165:4(1-31)Online publication date: 19-Nov-2010
https://dl.acm.org/doi/10.1145/1867713.1867716
He YRen HLiu YYang B(2009)On the reliability of large-scale distributed systems - A topological viewComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2009.03.01253:12(2140-2152)Online publication date: 1-Aug-2009
https://dl.acm.org/doi/10.1016/j.comnet.2009.03.012
Bachrach YParnes AProcaccia ARosenschein J(2009)Gossip-based aggregation of trust in decentralized reputation systemsAutonomous Agents and Multi-Agent Systems10.1007/s10458-008-9073-619:2(153-172)Online publication date: 1-Oct-2009
https://dl.acm.org/doi/10.1007/s10458-008-9073-6
Liu XXiao LKreling ALiu YLevine BClaypool M(2006)Optimizing overlay topology by reducing cut verticesProceedings of the 2006 international workshop on Network and operating systems support for digital audio and video10.1145/1378191.1378213(1-6)Online publication date: 26-May-2006
https://dl.acm.org/doi/10.1145/1378191.1378213
Liu XLiu YXiao L(2006)Improving Query Response Delivery Quality in Peer-to-Peer SystemsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2006.15717:11(1335-1347)Online publication date: 1-Nov-2006
https://dl.acm.org/doi/10.1109/TPDS.2006.157
Bawa MGionis AGarcia-Molina HMotwani RKönig ADessloch SValduriez PWeikum G(2004)The price of validity in dynamic networksProceedings of the 2004 ACM SIGMOD international conference on Management of data10.1145/1007568.1007627(515-526)Online publication date: 13-Jun-2004
https://dl.acm.org/doi/10.1145/1007568.1007627

View Options

View options

Media

Figures

Other

Tables

View Table of Contents