Avaliação de Replicação de Dados Estruturados Mutáveis em Sistemas Peer-to-Peer
Resumo
É proposta uma metodologia para avaliação de protocolos de replicação otimista de dados mutáveis em sistemas peer-to-peer e é mostrada a sua aplicação através de experimentos de simulação com quatro protocolos de replicação que diferem entre si na maneira como fazem atualização das réplicas e a reconciliação em caso de retorno de uma réplica ao sistema. Os resultados da simulação permitem observar a influência do número de réplicas, da chance de cada nó responder às mensagens recebidas e da taxa de operações de escrita no desempenho de cada protocolo. O experimento realizado permite concluir que o emprego de replicação otimista de dados é viável em sistemas peer-to-peer se algumas condições forem observadas.
Referências
Androutsellis-Theotokis, S. and Spinellis, D. (2004). A survey of peer-to-peer content distribution technologies. ACM Comput. Surv., 36(4):335–371.
Antoniu, G., Deverge, J.-F., and Monnet, S. (2004). Building fault-tolerant consistency protocols for an adaptive grid data-sharing service. Technical Report 5309, IRISA, Rennes, França.
Bolosky, W. J., Douceur, J. R., Ely, D., and Theimer, M. (2000). Feasibility of a serverless distributed file system deployed on an existing set of desktop pcs. In SIGMETRICS ’00: Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, pages 34–43, New York, NY, USA. ACM.
Cuenca-Acuna, F. M., Martin, R. P., and Nguyen, T. D. (2003). Autonomous replication for high availability in unstructured p2p systems. In SRDS, pages 99–108. IEEE Computer Society.
Granville, L.Z.and da Rosa, D., Panisson, A., Melchiors, C., Almeida, M., and Tarouco, L. (2005). Managing computer networks using peer-to-peer technologies. Communications Magazine, IEEE, 43(10):62–68.
JXTA (2008). JXTA Project. URL: http://www.jxta.org.
Kubiatowicz, J., Bindel, D., Chen, Y., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., and Zhao, B. (2000). Oceanstore: An architecture for global-scale persistent storage. In Proceedings of ACM ASPLOS. ACM.
Lin, W. K., Chiu, D. M., and Lee, Y. B. (2004). Erasure code replication revisited. In P2P ’04: Proceedings of the Fourth International Conference on Peer-to-Peer Computing, pages 90–97, Washington, DC, USA. IEEE Computer Society.
Lung, L., Bessani, A., and Fraga, J. (2004). Programação de sistemas distribuı́dos confiáveis. In ERI-SC’04 – XII Escola Regional de Informática, pages 1–40. SBC.
Martins, V., Akbarinia, R., Pacitti, E., and Valduriez, P. (2006). Reconciliation in the appa p2p system. In ICPADS ’06: Proceedings of the 12th International Conference on Parallel and Distributed Systems, pages 401–410, Washington, DC, USA. IEEE Computer Society.
Picconi, F., Busca, J.-M., and Sens, P. (2007). An experimental evaluation of the Pastis peer-to-peer file system under churn. Technical Report 6114, INRIA, França.
Rowstron, A. and Druschel, P. (2001). Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), pages 329–350.
Schuler, C., Weber, R., Schuldt, H., and Schek, H. (2003). Peer-to-peer process execution with osiris. In Proc. of First International Conference on Service-Oriented Computing ICSOC.
Antoniu, G., Deverge, J.-F., and Monnet, S. (2004). Building fault-tolerant consistency protocols for an adaptive grid data-sharing service. Technical Report 5309, IRISA, Rennes, França.
Bolosky, W. J., Douceur, J. R., Ely, D., and Theimer, M. (2000). Feasibility of a serverless distributed file system deployed on an existing set of desktop pcs. In SIGMETRICS ’00: Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, pages 34–43, New York, NY, USA. ACM.
Cuenca-Acuna, F. M., Martin, R. P., and Nguyen, T. D. (2003). Autonomous replication for high availability in unstructured p2p systems. In SRDS, pages 99–108. IEEE Computer Society.
Granville, L.Z.and da Rosa, D., Panisson, A., Melchiors, C., Almeida, M., and Tarouco, L. (2005). Managing computer networks using peer-to-peer technologies. Communications Magazine, IEEE, 43(10):62–68.
JXTA (2008). JXTA Project. URL: http://www.jxta.org.
Kubiatowicz, J., Bindel, D., Chen, Y., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., and Zhao, B. (2000). Oceanstore: An architecture for global-scale persistent storage. In Proceedings of ACM ASPLOS. ACM.
Lin, W. K., Chiu, D. M., and Lee, Y. B. (2004). Erasure code replication revisited. In P2P ’04: Proceedings of the Fourth International Conference on Peer-to-Peer Computing, pages 90–97, Washington, DC, USA. IEEE Computer Society.
Lung, L., Bessani, A., and Fraga, J. (2004). Programação de sistemas distribuı́dos confiáveis. In ERI-SC’04 – XII Escola Regional de Informática, pages 1–40. SBC.
Martins, V., Akbarinia, R., Pacitti, E., and Valduriez, P. (2006). Reconciliation in the appa p2p system. In ICPADS ’06: Proceedings of the 12th International Conference on Parallel and Distributed Systems, pages 401–410, Washington, DC, USA. IEEE Computer Society.
Picconi, F., Busca, J.-M., and Sens, P. (2007). An experimental evaluation of the Pastis peer-to-peer file system under churn. Technical Report 6114, INRIA, França.
Rowstron, A. and Druschel, P. (2001). Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), pages 329–350.
Schuler, C., Weber, R., Schuldt, H., and Schek, H. (2003). Peer-to-peer process execution with osiris. In Proc. of First International Conference on Service-Oriented Computing ICSOC.
Publicado
27/05/2008
Como Citar
NODARI, Alexandre; CALSAVARA, Alcides; LIMA, Luiz.
Avaliação de Replicação de Dados Estruturados Mutáveis em Sistemas Peer-to-Peer. In: WORKSHOP DE TESTES E TOLERÂNCIA A FALHAS (WTF), 9. , 2008, Rio de Janeiro/RJ.
Anais [...].
Porto Alegre: Sociedade Brasileira de Computação,
2008
.
p. 170-183.
ISSN 2595-2684.
DOI: https://doi.org/10.5753/wtf.2008.23154.
