Um Espaço de Tuplas Tolerante a Intrusões sobre P2P
Resumo
O uso de espaços de tuplas tem se mostrado uma solução atrativa para coordenação entre processos em sistemas distribuídos abertos e dinâmicos, como redes P2P, principalmente pelas suas características de desacoplamento espacial e temporal. Nestes ambientes, caracterizados como sistemas heterogêneos e abertos, aumenta significativamente a possibilidade de processos maliciosos estarem presentes em determinada computação. Neste sentido, este trabalho apresenta nossos esforços na concretização de um Espaço de Tuplas (ET) sobre um overlay P2P, que tolera a presença de processos maliciosos. O ET é construído sobre uma infraestrutura para construção de memórias compartilhadas dinâmicas e tolerantes a intrusões, descrita em outro trabalho.
Referências
Bakken, D. and Schlichting, R. (1995). Supporting fault-tolerant parallel programming in linda. Par. and Dist. Syst., IEEE Trans. on, 6(3):287–302.
Baldoni, R., Querzoni, L., Virgillito, A., Jimenez-Peris, R., and Virgillito, A. (2005). Dynamic quorums for dht-based p2p networks. In Net. Comp. and App., 4th IEEE Int. Symp. on, pages 91–100.
Bessani, A. N., Alchieri, E. P., Correia, M., and Fraga, J. S. (2008). Depspace: a byzantine fault-tolerant coordination service. SIGOPS Oper. Syst. Rev., 42(4):163–176.
Böger, D. S., Fraga, J., Alchieri, E., and Wangham, M. (2012). Intrusion-tolerant shared memory through a p2p overlay segmentation. In Adv. Inf. Net. and App. (AINA), 2012 IEEE 26th Int. Conf. on, pages 779–786, Fukuoka, JP. IEEE.
Castro, M., Druschel, P., Ganesh, A., Rowstron, A., and Wallach, D. (2002). Secure routing for structured peer-to-peer overlay networks. SIGOPS Oper. Syst. Rev., 36(SI):299–314.
Dwork, C., Lynch, N., and Stockmeyer, L. (1988). Consensus in the presence of partial synchrony. J. ACM, 35(2):288–323.
Gelernter, D. (1985). Generative communication in linda. ACM Trans. Prog. Lang. Syst., 7(1):80–112.
Hansen, R. and Cannon, S. (1994). An efficient fault-tolerant tuple space. In Fault-Tol. Par. and Dist. Syst., 1994., Proc. of IEEE Work. on, pages 220–225.
Lamport, L., Malkhi, D., and Zhou, L. (2010). Reconfiguring a state machine. SIGACT News, 41(1):63–73.
Lamport, L., Shostak, R., and Pease, M. (1982). The byzantine generals problem. ACM Trans. Program. Lang. Syst., 4(3):382–401.
Lawder, J. and King, P. (2000). Using space-filling curves for multi-dimensional indexing. In Lings, B. and Jeffery, K., editors, Adv. in Dat., volume 1832 of LNCS, pages 20–35. Springer Berlin / Heidelberg.
Lee, J., Lee, H., Kang, S., Choe, S., and Song, J. (2005). Ciss: An efficient object clustering framework for dht-based peer-to-peer applications. In Ng, W., Ooi, B.-C., Ouksel, A., and Sartori, C., editors, Dat., Inf. Syst., and Peer-to-Peer Comp., volume 3367 of LNCS, pages 215–229. Springer Berlin Heidelberg.
Li, Z. and Parashar, M. (2005). Comet: a scalable coordination space for decentralized distributed environments. In Hot Topics in Peer-to-Peer Systems, 2005. HOT-P2P 2005. 2nd Int. Work. on, pages 104–111.
Picco, G., Murphy, A., and Roman, G.-C. (1999). Lime: Linda meets mobility. In Soft. Eng., 1999. Proc. of the 1999 Int. Conf. on, pages 368–377.
Rowstron, A. and Druschel, P. (2001). Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Guerraoui, R., editor, Middleware 2001, volume 2218 of LNCS, pages 329–350. Springer, Berlin.
Shen, D., Shao, Y., Nie, T., Kou, Y., Wang, Z., and Yu, G. (2008). Hilbertchord: A p2p framework for service resources management. In Wu, S., Yang, L., and Xu, T., editors, Adv. in Grid and Perv. Comp., volume 5036 of LNCS, pages 331–342. Springer Berlin Heidelberg.
Wallach, D. (2003). A survey of peer-to-peer security issues. In Okada, M., Pierce, B., Scedrov, A., Tokuda, H., and Yonezawa, A., editors, Soft. Sec. - Theo. and Syst., volume 2609 of LNCS, pages 253–258. Springer Berlin / Heidelberg.
Xu, A. and Liskov, B. (1989). A design for a fault-tolerant, distributed implementation of linda. In Fault-Tol. Comp., 19th Int. Symp. on, pages 199–206.
Baldoni, R., Querzoni, L., Virgillito, A., Jimenez-Peris, R., and Virgillito, A. (2005). Dynamic quorums for dht-based p2p networks. In Net. Comp. and App., 4th IEEE Int. Symp. on, pages 91–100.
Bessani, A. N., Alchieri, E. P., Correia, M., and Fraga, J. S. (2008). Depspace: a byzantine fault-tolerant coordination service. SIGOPS Oper. Syst. Rev., 42(4):163–176.
Böger, D. S., Fraga, J., Alchieri, E., and Wangham, M. (2012). Intrusion-tolerant shared memory through a p2p overlay segmentation. In Adv. Inf. Net. and App. (AINA), 2012 IEEE 26th Int. Conf. on, pages 779–786, Fukuoka, JP. IEEE.
Castro, M., Druschel, P., Ganesh, A., Rowstron, A., and Wallach, D. (2002). Secure routing for structured peer-to-peer overlay networks. SIGOPS Oper. Syst. Rev., 36(SI):299–314.
Dwork, C., Lynch, N., and Stockmeyer, L. (1988). Consensus in the presence of partial synchrony. J. ACM, 35(2):288–323.
Gelernter, D. (1985). Generative communication in linda. ACM Trans. Prog. Lang. Syst., 7(1):80–112.
Hansen, R. and Cannon, S. (1994). An efficient fault-tolerant tuple space. In Fault-Tol. Par. and Dist. Syst., 1994., Proc. of IEEE Work. on, pages 220–225.
Lamport, L., Malkhi, D., and Zhou, L. (2010). Reconfiguring a state machine. SIGACT News, 41(1):63–73.
Lamport, L., Shostak, R., and Pease, M. (1982). The byzantine generals problem. ACM Trans. Program. Lang. Syst., 4(3):382–401.
Lawder, J. and King, P. (2000). Using space-filling curves for multi-dimensional indexing. In Lings, B. and Jeffery, K., editors, Adv. in Dat., volume 1832 of LNCS, pages 20–35. Springer Berlin / Heidelberg.
Lee, J., Lee, H., Kang, S., Choe, S., and Song, J. (2005). Ciss: An efficient object clustering framework for dht-based peer-to-peer applications. In Ng, W., Ooi, B.-C., Ouksel, A., and Sartori, C., editors, Dat., Inf. Syst., and Peer-to-Peer Comp., volume 3367 of LNCS, pages 215–229. Springer Berlin Heidelberg.
Li, Z. and Parashar, M. (2005). Comet: a scalable coordination space for decentralized distributed environments. In Hot Topics in Peer-to-Peer Systems, 2005. HOT-P2P 2005. 2nd Int. Work. on, pages 104–111.
Picco, G., Murphy, A., and Roman, G.-C. (1999). Lime: Linda meets mobility. In Soft. Eng., 1999. Proc. of the 1999 Int. Conf. on, pages 368–377.
Rowstron, A. and Druschel, P. (2001). Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Guerraoui, R., editor, Middleware 2001, volume 2218 of LNCS, pages 329–350. Springer, Berlin.
Shen, D., Shao, Y., Nie, T., Kou, Y., Wang, Z., and Yu, G. (2008). Hilbertchord: A p2p framework for service resources management. In Wu, S., Yang, L., and Xu, T., editors, Adv. in Grid and Perv. Comp., volume 5036 of LNCS, pages 331–342. Springer Berlin Heidelberg.
Wallach, D. (2003). A survey of peer-to-peer security issues. In Okada, M., Pierce, B., Scedrov, A., Tokuda, H., and Yonezawa, A., editors, Soft. Sec. - Theo. and Syst., volume 2609 of LNCS, pages 253–258. Springer Berlin / Heidelberg.
Xu, A. and Liskov, B. (1989). A design for a fault-tolerant, distributed implementation of linda. In Fault-Tol. Comp., 19th Int. Symp. on, pages 199–206.
Publicado
06/05/2013
Como Citar
BÖGER, Davi da Silva; ALCHIERI, Eduardo; FRAGA, Joni da Silva.
Um Espaço de Tuplas Tolerante a Intrusões sobre P2P. In: WORKSHOP DE TESTES E TOLERÂNCIA A FALHAS (WTF), 14. , 2013, Brasília/DF.
Anais [...].
Porto Alegre: Sociedade Brasileira de Computação,
2013
.
p. 61-74.
ISSN 2595-2684.
DOI: https://doi.org/10.5753/wtf.2013.23016.
