La revista Investigación e Innovación en Ingenierías respeta los derechos morales de cada autor, sin embargo los autores ceden los derechos patrimoniales de sus artículos, y al mismo tiempo certifican a través de una carta que su trabajo es inédito y no ha sido publicado anteriormente.
Manejo de Identidades en Sistemas P2P Basado en DHT
Corresponding Author(s) : Ricardo Villanueva
revingenieria@unisimonbolivar.edu.co
Investigación e Innovación en Ingenierías,
Vol. 4 Núm. 1 (2016): Enero - Junio
Resumen
Este artículo presenta las redes P2P, donde se analizara la manera en la cual los nodos se relacionan entre sí y de que forma en la cual se distribuyen al entrar a la red. Cada nodo al crear una red o unirse a una ya existente posee un identificador el cual da origen a la manera en la que se distribuyen los siguientes nodos que se unirán a la red, la falla radica en que uno de los nodos ya enlazados a la red existente pueden ser maliciosos y originar puntos de ataque a la red afectando la confidencialidad de la información distribuida entre los demás nodos de la red o modificar el enrutamiento de la información suministrada a través de la capa de aplicación, ya que estos nodos solo con el hecho de estar en la red son responsables de la comunicación que se realiza entre ciertos nodos localizados en el anillo. Se indicaran detalladamente los procesos de conexión, comunicación y estabilización de los nodos por medio de la simulación de las redes P2P en ovelay weaver, mostrando consigo las características y resultados de la simulación.
Palabras clave
P2P, networks, information, connections, communications
[1]
R. Villanueva, «Manejo de Identidades en Sistemas P2P Basado en DHT», Investigación e Innovación en Ingenierías, vol. 4, n.º 1, ene. 2016.
Descargar cita
Endnote/Zotero/Mendeley (RIS)BibTeX
Referencias
-
1. D. Stinson, Cryptography Theory and Practice (Discrete Mathematics and its Applications). Chapman & Hall/CRC. 2006.
2. S. Ratnasamy, P. Francis, M. Handley, R. M. Karp, S. Shenker: A scalable content–addressable network. In: SIGCOMM. 2001.
3. S. Androutsellis-Theotokis, D. Spinellis, A survey of peer-to-peer content distribution technologies. ACM Comput. Surv. 36(4), 335–371. 2004.
4. I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M.F. Kaashoek, F. Dabek, H. Balakrishnan, Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Trans. Netw. 11(1), 17–32. 2003.
5. http://www.freepastry.org/PAST/pastry.pdf
6. P. Druschel and A. Rowstron. PAST: A large-scale, persistent peer-to-peer storage utility. In Proc. HotOS VIII, Schloss Elmau, Germany, May 2001.
7. A. Rowstron and P. Druschel. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Proc. ACM SOSP’01, Banff, Canada, Oct. 2001.
8. A. Rowstron, A.-M. Kermarrec, P. Druschel, and M. Castro. Scribe: The design of a large-scale event notification infrastructure. Submitted for publication. June 2001. http://www.research.microsoft.com/antr/SCRIBE/.
9. P. Maymounkov, Mazieres D. Kademlia: A peer-to-peer information system based on the XOR metric. In Proc of IPTPS02, Cambridge, USA, March 2002.
10. T. Holz, M. Steiner, F. Dahl, E. W. Biersack, and F. Freilin Measurements and mitigation of peer-to-peer-based botnets: A case study on storm worm. In LEET, 2008.
11. K. Needels, M. Kwon: Secure routing in peer-to-peer distributed hash tables. In:SAC'09,ACM, pp.54-58.
12. P. Wang, I. Osipkov, N. Hopper, Y. Kim: Myrmic: secure and robust DHT routing, Submission, 2007.
13. X. Xiang, T. Jin: E_cient secure message routing for structured peer-to-peer systems.In:NSWCTC'09, IEEE, pp.354-357.
14. Seguridad en Sistemas P2P dht, Ricardo Luis Villanueva Polanco, Universidad de los Andes, Facultad de Ingenieria; Tesis de grado 2010.
15. J. Douceur: The sybil attack. In:IPTPS'02, Springer, pp.251-260.
16. M. Castro, P. Druschel, A. Ganesh, A. Rowstron, D. Wallach: Secure routing for structured peer-to-peer overlay networks. In:SIGOPS'02, ACM, pp.299-314.
17. H. Rowaihy, W. Enck, P. Mcdaniel , y T. La Porta,. Limiting sybil attacks in structured P2P networks. In Proc. of 26th IEEE Int'l Conference on Computer Communications. IEEE. 2007
18. I. Baumgart, S. Mies, S. Kademlia: A practicable approach towards secure key-based routing. Proceedings of the 13th Int'l Conf. on Parallel and Distributed Systems, IEEE, pp.1-8. 2007
Referencias
1. D. Stinson, Cryptography Theory and Practice (Discrete Mathematics and its Applications). Chapman & Hall/CRC. 2006.
2. S. Ratnasamy, P. Francis, M. Handley, R. M. Karp, S. Shenker: A scalable content–addressable network. In: SIGCOMM. 2001.
3. S. Androutsellis-Theotokis, D. Spinellis, A survey of peer-to-peer content distribution technologies. ACM Comput. Surv. 36(4), 335–371. 2004.
4. I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M.F. Kaashoek, F. Dabek, H. Balakrishnan, Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Trans. Netw. 11(1), 17–32. 2003.
5. http://www.freepastry.org/PAST/pastry.pdf
6. P. Druschel and A. Rowstron. PAST: A large-scale, persistent peer-to-peer storage utility. In Proc. HotOS VIII, Schloss Elmau, Germany, May 2001.
7. A. Rowstron and P. Druschel. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Proc. ACM SOSP’01, Banff, Canada, Oct. 2001.
8. A. Rowstron, A.-M. Kermarrec, P. Druschel, and M. Castro. Scribe: The design of a large-scale event notification infrastructure. Submitted for publication. June 2001. http://www.research.microsoft.com/antr/SCRIBE/.
9. P. Maymounkov, Mazieres D. Kademlia: A peer-to-peer information system based on the XOR metric. In Proc of IPTPS02, Cambridge, USA, March 2002.
10. T. Holz, M. Steiner, F. Dahl, E. W. Biersack, and F. Freilin Measurements and mitigation of peer-to-peer-based botnets: A case study on storm worm. In LEET, 2008.
11. K. Needels, M. Kwon: Secure routing in peer-to-peer distributed hash tables. In:SAC'09,ACM, pp.54-58.
12. P. Wang, I. Osipkov, N. Hopper, Y. Kim: Myrmic: secure and robust DHT routing, Submission, 2007.
13. X. Xiang, T. Jin: E_cient secure message routing for structured peer-to-peer systems.In:NSWCTC'09, IEEE, pp.354-357.
14. Seguridad en Sistemas P2P dht, Ricardo Luis Villanueva Polanco, Universidad de los Andes, Facultad de Ingenieria; Tesis de grado 2010.
15. J. Douceur: The sybil attack. In:IPTPS'02, Springer, pp.251-260.
16. M. Castro, P. Druschel, A. Ganesh, A. Rowstron, D. Wallach: Secure routing for structured peer-to-peer overlay networks. In:SIGOPS'02, ACM, pp.299-314.
17. H. Rowaihy, W. Enck, P. Mcdaniel , y T. La Porta,. Limiting sybil attacks in structured P2P networks. In Proc. of 26th IEEE Int'l Conference on Computer Communications. IEEE. 2007
18. I. Baumgart, S. Mies, S. Kademlia: A practicable approach towards secure key-based routing. Proceedings of the 13th Int'l Conf. on Parallel and Distributed Systems, IEEE, pp.1-8. 2007
2. S. Ratnasamy, P. Francis, M. Handley, R. M. Karp, S. Shenker: A scalable content–addressable network. In: SIGCOMM. 2001.
3. S. Androutsellis-Theotokis, D. Spinellis, A survey of peer-to-peer content distribution technologies. ACM Comput. Surv. 36(4), 335–371. 2004.
4. I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M.F. Kaashoek, F. Dabek, H. Balakrishnan, Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Trans. Netw. 11(1), 17–32. 2003.
5. http://www.freepastry.org/PAST/pastry.pdf
6. P. Druschel and A. Rowstron. PAST: A large-scale, persistent peer-to-peer storage utility. In Proc. HotOS VIII, Schloss Elmau, Germany, May 2001.
7. A. Rowstron and P. Druschel. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Proc. ACM SOSP’01, Banff, Canada, Oct. 2001.
8. A. Rowstron, A.-M. Kermarrec, P. Druschel, and M. Castro. Scribe: The design of a large-scale event notification infrastructure. Submitted for publication. June 2001. http://www.research.microsoft.com/antr/SCRIBE/.
9. P. Maymounkov, Mazieres D. Kademlia: A peer-to-peer information system based on the XOR metric. In Proc of IPTPS02, Cambridge, USA, March 2002.
10. T. Holz, M. Steiner, F. Dahl, E. W. Biersack, and F. Freilin Measurements and mitigation of peer-to-peer-based botnets: A case study on storm worm. In LEET, 2008.
11. K. Needels, M. Kwon: Secure routing in peer-to-peer distributed hash tables. In:SAC'09,ACM, pp.54-58.
12. P. Wang, I. Osipkov, N. Hopper, Y. Kim: Myrmic: secure and robust DHT routing, Submission, 2007.
13. X. Xiang, T. Jin: E_cient secure message routing for structured peer-to-peer systems.In:NSWCTC'09, IEEE, pp.354-357.
14. Seguridad en Sistemas P2P dht, Ricardo Luis Villanueva Polanco, Universidad de los Andes, Facultad de Ingenieria; Tesis de grado 2010.
15. J. Douceur: The sybil attack. In:IPTPS'02, Springer, pp.251-260.
16. M. Castro, P. Druschel, A. Ganesh, A. Rowstron, D. Wallach: Secure routing for structured peer-to-peer overlay networks. In:SIGOPS'02, ACM, pp.299-314.
17. H. Rowaihy, W. Enck, P. Mcdaniel , y T. La Porta,. Limiting sybil attacks in structured P2P networks. In Proc. of 26th IEEE Int'l Conference on Computer Communications. IEEE. 2007
18. I. Baumgart, S. Mies, S. Kademlia: A practicable approach towards secure key-based routing. Proceedings of the 13th Int'l Conf. on Parallel and Distributed Systems, IEEE, pp.1-8. 2007