Difusão Atômica com Suporte à Perda de Mensagens
Resumo
Apresentamos um protocolo de difusão atômica que suporta a perda de mensagens provenientes dos clientes e implementa diretamente a entrega atômica das mesmas sem recorrer ao uso de uma primitiva de difusão confiável. Ao nosso conhecimento, nenhum outro protocolo similar até então proposto apresenta tais mecanismos para lidar diretamente com as perdas. Este protocolo foi obtido a partir da especialização de um serviço genérico de consenso. Além disso, ele foi utilizado na implementação do componente de replicação ativa da biblioteca de componentes de acordo ADAM [1].
Referências
F. G. P. Greve, Réponses efficaces au besoin d’accord dans un groupe. PhD thesis, Université de Rennes I, France, Nov. 2002.
F. Schneider, Distributed Systems, ch. Replication Management using the State Machine Approach, pp. 169–198. Addison-Wesley, 1993.
V. Hadzilacos and S. Toueg, Distributed Systems, ch. Fault Tolerant Broadcasts and Related Problems, pp. 97–145. Addison-Wesley, 1993.
M. Hurfin, R. Macêdo, M. Raynal, and F. Tronel, “A generic framework to solve agreement problems,” in Proc. of the IEEE Symposium on Reliable Distributed Systems (SRDS’99), (Lausanne, Switzerland), pp. 56–65, Oct. 1999.
T. Chandra and S. Toueg, “Unreliable failure detectors for reliable distributed systems,” Journal of ACM, vol. 43, pp. 225–267, Mar. 1996.
E. Anceaume, “A lightweight solution to uniform atomic broadcast for asynchronous systems,” in Proceedings of The Twenty-Seventh Annual International Symposium on Fault-Tolerant Computing (FTCS’97), (Washington - Brussels - Tokyo), pp. 292–303, IEEE, June 1997.
F. Pedone and A. Schiper, “Optimistic atomic broadcast,” in Proceedings of the 12th International Symposium on Distributed Computing (DISC’98, formerly WDAG), Sept. 1998.
A. Mostefaoui and M. Raynal, “Low-cost consensus based atomic brodcast,” in Proceedings of IEEE Pacifi Rim Intern. Symposium on Dependable Computing (PRDC-00), (Los Angeles, CA), IEEE, Dec. 2000.
R. Guerraoui and A. Schiper, “Consensus service: A modular approach for building fault-tolerant agreement protocols in distributed systems,” in Proceedings of the 26th International Symposium on Fault-Tolerant Computing (FTCS-26), (Sendai, Japan), pp. 168–177, June 1996.
R. Guerraoui and A. Schiper, “The generic consensus service,” IEEE Transactions on Software Engineering, vol. 27, pp. 29–41, Jan. 2001.
L. Rodrigues and P. Veríssimo, “Topology-aware algorithms for large scale communication,” LNCS: Advances in Distributed Systems, no. 1752, pp. 1217–1256, 2000.
M. Fischer, N. Lynch, and M. Paterson, “Impossibility of distributed consensus with one faulty process,” Journal of ACM, vol. 32, pp. 374–382, Apr. 1985.
A. Basu, B. Charron-Bost, and S. Toueg, “Simulating reliable links with unreliable links in the presence of process crashes,” in Proceedings of the 10th International Workshop on Distributed Algorithms (WDAG96), pp. 105–122, 1996.
T. Chandra, V. Hadzilacos, and S. Toueg, “The weakest failure detector for solving consensus,” Journal of ACM, vol. 43, pp. 685–722, July 1996.
F. Schneider, Distributed Systems, ch. Replication Management using the State Machine Approach, pp. 169–198. Addison-Wesley, 1993.
V. Hadzilacos and S. Toueg, Distributed Systems, ch. Fault Tolerant Broadcasts and Related Problems, pp. 97–145. Addison-Wesley, 1993.
M. Hurfin, R. Macêdo, M. Raynal, and F. Tronel, “A generic framework to solve agreement problems,” in Proc. of the IEEE Symposium on Reliable Distributed Systems (SRDS’99), (Lausanne, Switzerland), pp. 56–65, Oct. 1999.
T. Chandra and S. Toueg, “Unreliable failure detectors for reliable distributed systems,” Journal of ACM, vol. 43, pp. 225–267, Mar. 1996.
E. Anceaume, “A lightweight solution to uniform atomic broadcast for asynchronous systems,” in Proceedings of The Twenty-Seventh Annual International Symposium on Fault-Tolerant Computing (FTCS’97), (Washington - Brussels - Tokyo), pp. 292–303, IEEE, June 1997.
F. Pedone and A. Schiper, “Optimistic atomic broadcast,” in Proceedings of the 12th International Symposium on Distributed Computing (DISC’98, formerly WDAG), Sept. 1998.
A. Mostefaoui and M. Raynal, “Low-cost consensus based atomic brodcast,” in Proceedings of IEEE Pacifi Rim Intern. Symposium on Dependable Computing (PRDC-00), (Los Angeles, CA), IEEE, Dec. 2000.
R. Guerraoui and A. Schiper, “Consensus service: A modular approach for building fault-tolerant agreement protocols in distributed systems,” in Proceedings of the 26th International Symposium on Fault-Tolerant Computing (FTCS-26), (Sendai, Japan), pp. 168–177, June 1996.
R. Guerraoui and A. Schiper, “The generic consensus service,” IEEE Transactions on Software Engineering, vol. 27, pp. 29–41, Jan. 2001.
L. Rodrigues and P. Veríssimo, “Topology-aware algorithms for large scale communication,” LNCS: Advances in Distributed Systems, no. 1752, pp. 1217–1256, 2000.
M. Fischer, N. Lynch, and M. Paterson, “Impossibility of distributed consensus with one faulty process,” Journal of ACM, vol. 32, pp. 374–382, Apr. 1985.
A. Basu, B. Charron-Bost, and S. Toueg, “Simulating reliable links with unreliable links in the presence of process crashes,” in Proceedings of the 10th International Workshop on Distributed Algorithms (WDAG96), pp. 105–122, 1996.
T. Chandra, V. Hadzilacos, and S. Toueg, “The weakest failure detector for solving consensus,” Journal of ACM, vol. 43, pp. 685–722, July 1996.
Publicado
19/05/2003
Como Citar
GREVE, Fabíola Gonçalves Pereira.
Difusão Atômica com Suporte à Perda de Mensagens. In: WORKSHOP DE TESTES E TOLERÂNCIA A FALHAS (WTF), 4. , 2003, Natal/RN.
Anais [...].
Porto Alegre: Sociedade Brasileira de Computação,
2003
.
p. 33-41.
ISSN 2595-2684.
DOI: https://doi.org/10.5753/wtf.2003.23388.
