Home > Research > Publications & Outputs > An Antecedence Graph Approach for Fault Toleran...

Research

Text available via DOI:

View graph of relations

An Antecedence Graph Approach for Fault Tolerance in a Multi-Agent

Research output: Contribution to conference - Without ISBN/ISSN › Other › peer-review

Published

Standard

An Antecedence Graph Approach for Fault Tolerance in a Multi-Agent. / Khokhar, Masud; Nadeem, A.; Paracha, O.
2006. 137.

Research output: Contribution to conference - Without ISBN/ISSN › Other › peer-review

Harvard

Khokhar, M, Nadeem, A & Paracha, O 2006, 'An Antecedence Graph Approach for Fault Tolerance in a Multi-Agent', pp. 137. https://doi.org/http://doi.ieeecomputersociety.org/10.1109/MDM.2006.32

APA

Khokhar, M., Nadeem, A., & Paracha, O. (2006). An Antecedence Graph Approach for Fault Tolerance in a Multi-Agent. 137. https://doi.org/http://doi.ieeecomputersociety.org/10.1109/MDM.2006.32

Vancouver

Khokhar M, Nadeem A, Paracha O. An Antecedence Graph Approach for Fault Tolerance in a Multi-Agent. 2006. doi: http://doi.ieeecomputersociety.org/10.1109/MDM.2006.32

Author

Khokhar, Masud ; Nadeem, A. ; Paracha, O. / An Antecedence Graph Approach for Fault Tolerance in a Multi-Agent.

Bibtex

@conference{d732c40e259e421f916c016614066a40,
title = "An Antecedence Graph Approach for Fault Tolerance in a Multi-Agent",
abstract = "In this paper, we propose a strategy to implement fault-tolerance in a multi-agent system. We have based our strategy on the concept of antecedence graphs, used in causal logging and as used by the manetho protocol for distributed systems. Each agent in the multi-agent system keeps an antecedence graph of all the collaborating agents in the system. If one or more agents fail due to any reason, the other agents can reconstruct the same agent state in a partial or comprehensive manner by using their own antecedence graphs. The recovering agents then regenerate their antecedence graphs and message logs and replay the messages to achieve a global consistent state, after which normal operation continues. We believe that introducing fault tolerance in a multi-agent system through antecedence graphs is novel and provides a low overhead and effective solution for fault-tolerance in a multi-agent system.",
author = "Masud Khokhar and A. Nadeem and O Paracha",
year = "2006",
doi = "http://doi.ieeecomputersociety.org/10.1109/MDM.2006.32",
language = "English",
pages = "137",

}

RIS

TY - CONF

T1 - An Antecedence Graph Approach for Fault Tolerance in a Multi-Agent

AU - Khokhar, Masud

AU - Nadeem, A.

AU - Paracha, O

PY - 2006

Y1 - 2006

N2 - In this paper, we propose a strategy to implement fault-tolerance in a multi-agent system. We have based our strategy on the concept of antecedence graphs, used in causal logging and as used by the manetho protocol for distributed systems. Each agent in the multi-agent system keeps an antecedence graph of all the collaborating agents in the system. If one or more agents fail due to any reason, the other agents can reconstruct the same agent state in a partial or comprehensive manner by using their own antecedence graphs. The recovering agents then regenerate their antecedence graphs and message logs and replay the messages to achieve a global consistent state, after which normal operation continues. We believe that introducing fault tolerance in a multi-agent system through antecedence graphs is novel and provides a low overhead and effective solution for fault-tolerance in a multi-agent system.

AB - In this paper, we propose a strategy to implement fault-tolerance in a multi-agent system. We have based our strategy on the concept of antecedence graphs, used in causal logging and as used by the manetho protocol for distributed systems. Each agent in the multi-agent system keeps an antecedence graph of all the collaborating agents in the system. If one or more agents fail due to any reason, the other agents can reconstruct the same agent state in a partial or comprehensive manner by using their own antecedence graphs. The recovering agents then regenerate their antecedence graphs and message logs and replay the messages to achieve a global consistent state, after which normal operation continues. We believe that introducing fault tolerance in a multi-agent system through antecedence graphs is novel and provides a low overhead and effective solution for fault-tolerance in a multi-agent system.

U2 - http://doi.ieeecomputersociety.org/10.1109/MDM.2006.32

DO - http://doi.ieeecomputersociety.org/10.1109/MDM.2006.32

M3 - Other

SP - 137

ER -