Las simulaciones, una alternativa para el estudio de los protocolos P2P - The simulations, an alternative to the study of P2P protocols
DOI:
https://doi.org/10.32870/recibe.v3i1.16Palabras clave:
Redes P2P, DoS, simulaciones, cómputo en la nubeResumen
La arquitectura y funcionalidad de las redes P2P hacen que sean atractivas para ser utilizadas en ambientes distribuidos locales y aplicaciones de amplia distribución, el análisis de sus protocolos de ruteo bajo diferentes ataques como son los de negación de existencia y de servicio, así como su análisis estadístico, hacen que las simulaciones cobren gran importancia, y sean una alternativa adecuada para su estudio, pues existen varios protocolos de esta categoría como Pastry o Chord, los cuales son de gran importancia dada su amplia utilización en diferentes aplicaciones para el envío y recuperación satisfactoria de información tanto en la nube como en aplicaciones distribuidas, razón por la cual su análisis es importante, este trabajo se centra en Pastry dado que es utilizado en la versión Azure de Microsoft Windows.Abstract: Abstract The architecture and functionality of P2P networks makes them attractive for use in a local distributed environments and widespread applications, the analysis of routing protocols under different attacks such as denial of existence and service, and their statistical analysis make the simulations very important charge, and are a suitable alternative for study, because there are several protocols of this category as Pastry or Chord, which are of great importance because of its wide use in different applications to sending and recovery information, both in the cloud and distributed applications, which is why his analysis is important, this work focuses on Pastry as it is used in the Microsoft Windows Azure version.Keywords: P2P networks,DoS attacks, cloud computing, simulations.Citas
Ankur Gupta, D. M. (1 de 08 de 2008). : A Trust-based Scheme for Countering Distributed Denial-of-Service
Attacks in P2P Networks NeighborTrust. ICON .
Antony Rowstron, P. D. (2001). Pastry: Scalable, distributed object location and routing for large-scale
peer-to-peer systems. IFIP/ACM Middleware 2001, . Heidelberg: ACM.
Antony Rowstron, P. D. (2001). Storage management and caching in PAST, a large scale, persistent peer to peer
storage utility. Proc ACM SOS’P. Banff: ACM.
M. Castro P. Druschel, A. G. (2002). Secure Routing for Structured Peer-to-Peer Overlay Networks.
Symposium on Operating Systems Design and Implementation. Boston: ACM.
M. Castro, B. L. (1999). Practical byzantine fault tolerance . Third Symposium on Operating Systems Design
and Implementation (OSDl’99). New Orleans,: ACM.
Marlin Engle, J. I. (2006). Vulnerabilities of P2P Systems and a Critical Look at their Solutions,. Technical Report,
Kent State University, Internet and Media Communications Research Laboratories, Kent.
Thomas H. Cormen, C. E. (1990). Introduction to Algorithms. (M. E. Series., Ed.) MIT Press.
Y. Charlie Hu, A. R. (2002). Exploiting network proximity in peer to peer overlay networks. Microsoft Research .
Yunhao Liu, X. L. (2007). Defending P2Ps from Overlay Flooding-based DDoS. International Conference
on Parallel Processing. Michigan: IEEE.
Zhang Rongmei, C. H. (2003). Borg: A Hybrid protocol for scalable application level multicast in peer to peer
networks Monterey California. En ACM (Ed.), Nossdaw 03. Monterrey
