%0 Conference Paper
%B Multi-Agent Security and Survivability, 2005 IEEE 2nd Symposium on
%D 2005
%T Approximation results for probabilistic survivability
%A Zhang,Y.
%A Manister,E.
%A Kraus,S.
%A V.S. Subrahmanian
%K application;
%K computing;
%K failure;
%K fault
%K heuristic
%K heuristics
%K industrial
%K model;
%K multi-agent
%K multiagent
%K node
%K probabilistic
%K probability;
%K programming;
%K survivability;
%K system;
%K systems;
%K testing;
%K tolerant
%X As multiagent systems (MASs) are increasingly used in industrial applications, the need to make them more robust and resilient against disruption increases dramatically. The author has developed a probabilistic model (assuming complete ignorance of dependencies between node failures) of survivability based on deploying each agent in a MAS on one or more nodes. Finding a deployment that maximizes survivability is highly intractable for two reasons: firstly, computing the survivability of any deployment is intractable, and secondly, going through an exponential number of deployments to find the best one adds another layer of intractability. In this paper, we study what happens when node failures are independent. We show that computing survivability in this environment is still intractable. We propose various heuristics to compute the survivability of a given deployment. We have implemented and tested all these heuristics. We report on the advantages and disadvantages of different heuristics in different environmental settings.
%B Multi-Agent Security and Survivability, 2005 IEEE 2nd Symposium on
%P 1 - 10
%8 2005/08//
%G eng
%R 10.1109/MASSUR.2005.1507042