Distributed algorithms for dynamic survivability of multiagent systems

  • Authors:
  • V. S. Subrahmanian;Sarit Kraus;Yingqian Zhang

  • Affiliations:
  • Dept. of Computer Science, University of Maryland, College Park, MD;Dept. of Computer Science, Bar-Ilan University, Ramat Gan, Israel;Dept. of Computer Science, University of Manchester, UK

  • Venue:
  • CLIMA IV'04 Proceedings of the 4th international conference on Computational Logic in Multi-Agent Systems
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Though multiagent systems (MASs) are being increasingly used, few methods exist to ensure survivability of MASs. All existing methods suffer from two flaws. First, a centralized survivability algorithm (CSA) ensures survivability of the MAS – unfortunately, if the node on which the CSA exists goes down, the survivability of the MAS is questionable. Second, no mechanism exists to change how the MAS is deployed when external factors trigger a re-evaluation of the survivability of the MAS. In this paper, we present three algorithms to address these two important problems. Our algorithms can be built on top of any CSA. Our algorithms are completely distributed and can handle external triggers to compute a new deployment. We report on experiments assessing the efficiency of these algorithms.