Segmentação de Overlays P2P como Suporte para Memórias Tolerantes a Intrusões

• Davi da Silva Böger UFSC
• Joni Fraga UFSC
• Eduardo Alchieri UFSC
• Michelle Wangham UNIVALI

DOI: https://doi.org/10.5753/sbseg.2011.20570

Abstract

This paper describes our experience in developing an infrastructure which allows building intrusion-tolerant shared memory for large-scale systems. The infrastructure makes use of a P2P overlay and of the concept of State Machine Replication (SMR). Segmentation is introduced on the key space of the overlay to allow the use of algorithms for supporting SMR. In this paper we describe the proposed infrastructure in its stratification and corresponding algorithms. Also, analyses of the algorithms described and their respective costs are presented.

References

Aguilera, M. K., Keidar, I., Malkhi, D. e Shraer, A. (2009) “Dynamic Atomic Storage Without Consensus”, In: Proceedings of the PODC’09, pp. 17-25, ACM.

Baldoni, R., Jiménez-Peris, R., Patiño-Martinez, M. e Virgillito, A. (2005) “Dynamic Quorums for DHT-based P2P Networks”, In: Proceedings of the NCA’05, IEEE.

Bhattacharjee, B., Rodrigues, R. e Kouznetsov, P. (2007) “Secure Lookup without (Constrained) Flooding”, In: Proceedings of the WRAITS’07, pp. 13-17.

Castro, M., Liskov, B. (1999) “Practical Byzantine Fault Tolerance”, In: Proceedings of the OSDI’99, USENIX.

Castro, M., Druschel, P., Ganesh, A., Rowstron, A. e Wallach, D. S. (2002) “Secure Routing for Structured Peer-to-Peer Overlay Networks”, In: Proceedings of the OSDI’02, USENIX.

Dwork, C., Lynch, N. e Stockmeyer, L. (1988) “Consensus in the Presence of Partial Synchrony”, In: Journal of the ACM, v. 35, n. 2, pp. 288-323, ACM.

Gelernter, D. (1985) “Generative Communication in Linda”, In: ACM Transactions on Programming Languages and Systems, v.7, n. 1, pp. 80-112, ACM.

Lamport, L., Shostak, R., Pease, M. (1982) “The Byzantine generals problem”. ACM TOPLAS, v. 4, n. 3, pp. 382-401, ACM.

Rodrigues, R. e Liskov, B. (2003) “Rosebud: A Scalable Byzantine-Fault-Tolerant Storage Architecture”, Relatório Técnico, MIT.

Rowstron, A. I. T., Druschel, P. (2001) “Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems”, In: Proceedings of the Middleware’01, Springer.

Schneider, F. B. (1990) “Implementing fault-tolerant service using the state machine aproach: A tutorial”. ACM Computing Surveys, v. 22, n. 4, ACM.

Steinmetz, R. e Wehrle, K. (Eds.) (2005) Peer-to-Peer Systems and Applications, LNCS, v. 3485, Springer.

Stoica, I., Morris, R., Liben-Nowell, D., Karger, D. R., Kaashoek, M. F., Dabek, F. e Blakrishnan, H. (2003) “Chord: Scalable Peer-to-peer Lookup Protocol for Internet Applications”, In: ACM/IEEE Transactions on Networking (TON), v. 11, n. 1, IEEE Press.