## Abstract

A deployment of a multi-agent system on a network refers to the placement of one or more copies of each agent on network hosts, in such a manner that the memory constraints of each node are satisfied. Finding the deployment that is most likely to tolerate faults (i.e. have at least one copy of each agent functioning and in communication with other agents) is a challenge. In this paper, we address the problem of finding the probability of survival of a deployment (i.e. the probability that a deployment will tolerate faults), under the assumption that node failures are independent. We show that the problem of computing the survival probability of a deployment is at least NP-hard. Moreover, it is hard to approximate. We produce two algorithms to accurately compute the probability of survival of a deployment-these algorithms are expectedly exponential. We also produce five heuristic algorithms to estimate survival probabilities-these algorithms work in acceptable time frames. We report on a detailed set of experiments to determine the conditions under which some of these algorithms perform better than the others.

Original language | English |
---|---|

Pages (from-to) | 437-465 |

Number of pages | 29 |

Journal | Artificial Intelligence |

Volume | 173 |

Issue number | 3-4 |

DOIs | |

State | Published - Mar 2009 |

### Bibliographical note

Funding Information:✩ This article is the extended version of the paper which appeared in the Second IEEE Symposium on Multi-Agent Security and Survivability [Y. Zhang, E. Manister, S. Kraus, V.S. Subrahmanian, Approximation results for probabilistic survivability, in: Second IEEE Symposium on Multi-Agent Security and Survivability, Philadelphia, USA, 2005, pp. 1–10]. This research was supported in part by the Technology Foundation STW, applied science division of NWO, and the Ministry of Economic Affairs of the Netherlands, by grant N6133906C0149, in part by ARO grant DAAD190310202, AFOSR grants FA95500610405, FA95500510298, NSF grant 0540216, NSF grant 0705587, and ISF grant 1685/07. * Corresponding author. E-mail addresses: [email protected] (Y. Zhang), [email protected] (E. Manisterski), [email protected] (S. Kraus), [email protected] (V.S. Subrahmanian), [email protected] (D. Peleg).

### Funding

✩ This article is the extended version of the paper which appeared in the Second IEEE Symposium on Multi-Agent Security and Survivability [Y. Zhang, E. Manister, S. Kraus, V.S. Subrahmanian, Approximation results for probabilistic survivability, in: Second IEEE Symposium on Multi-Agent Security and Survivability, Philadelphia, USA, 2005, pp. 1–10]. This research was supported in part by the Technology Foundation STW, applied science division of NWO, and the Ministry of Economic Affairs of the Netherlands, by grant N6133906C0149, in part by ARO grant DAAD190310202, AFOSR grants FA95500610405, FA95500510298, NSF grant 0540216, NSF grant 0705587, and ISF grant 1685/07. * Corresponding author. E-mail addresses: [email protected] (Y. Zhang), [email protected] (E. Manisterski), [email protected] (S. Kraus), [email protected] (V.S. Subrahmanian), [email protected] (D. Peleg).

Funders | Funder number |
---|---|

National Science Foundation | |

Directorate for Computer and Information Science and Engineering | 0540216, 0705587 |

Air Force Office of Scientific Research | FA95500510298, FA95500610405 |

Army Research Office | DAAD190310202 |

Ministerie van Economische Zaken | N6133906C0149 |

Nederlandse Organisatie voor Wetenschappelijk Onderzoek | |

Stichting voor de Technische Wetenschappen | |

Israel Science Foundation | 1685/07 |

## Keywords

- Algorithms
- Fault tolerance
- Multi-agent deployment
- Replication