TY - GEN
T1 - Approximation results for probabilistic survivability
AU - Zhang, Yingqian
AU - Manister, Efrat
AU - Kraus, Sarit
AU - Subrahmanian, V. S.
PY - 2005
Y1 - 2005
N2 - As multiagent systems (MASs) are increasingly used in industrial applications, the need to make them more robust and resilient against disruption increases dramatically. Kraus et al [1] 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.
AB - As multiagent systems (MASs) are increasingly used in industrial applications, the need to make them more robust and resilient against disruption increases dramatically. Kraus et al [1] 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.
UR - http://www.scopus.com/inward/record.url?scp=33745685245&partnerID=8YFLogxK
U2 - 10.1109/massur.2005.1507042
DO - 10.1109/massur.2005.1507042
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:33745685245
SN - 078039447X
SN - 9780780394476
T3 - 2005 IEEE 2nd Symposium on Multi-Agent Security and Survivability
SP - 1
EP - 10
BT - 2005 IEEE 2nd Symposium on Multi-Agent Security and Survivability
T2 - 2005 IEEE 2nd Symposium on Multi-Agent Security and Survivability
Y2 - 30 August 2005 through 31 August 2005
ER -