Distributed algorithms for dynamic survivability of multiagent systems

V. S. Subrahmanian; Sarit Kraus; Yingqian Zhang

doi:10.1007/978-3-540-30200-1_1

Distributed algorithms for dynamic survivability of multiagent systems

V. S. Subrahmanian^*, Sarit Kraus, Yingqian Zhang

^*Corresponding author for this work

Research output: Contribution to journal › Conference article › peer-review

2 Scopus citations

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.

Original language	English (US)
Pages (from-to)	1-15
Number of pages	15
Journal	Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)
Volume	3259
DOIs	https://doi.org/10.1007/978-3-540-30200-1_1
State	Published - 2004
Externally published	Yes
Event	4th International Workshop CLIMA IV: Computational Logic in Multi-Agent Systems - Fort Lauderdale, FL, United States Duration: Jan 6 2004 → Jan 7 2004

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-540-30200-1_1

Cite this

@article{fa75efa61d674e6fb7e0401323bf963e,

title = "Distributed algorithms for dynamic survivability of multiagent systems",

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.",

author = "Subrahmanian, {V. S.} and Sarit Kraus and Yingqian Zhang",

year = "2004",

doi = "10.1007/978-3-540-30200-1_1",

language = "English (US)",

volume = "3259",

pages = "1--15",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Verlag",

note = "4th International Workshop CLIMA IV: Computational Logic in Multi-Agent Systems ; Conference date: 06-01-2004 Through 07-01-2004",

}

TY - JOUR

T1 - Distributed algorithms for dynamic survivability of multiagent systems

AU - Subrahmanian, V. S.

AU - Kraus, Sarit

AU - Zhang, Yingqian

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=23144441476&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=23144441476&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-30200-1_1

DO - 10.1007/978-3-540-30200-1_1

M3 - Conference article

AN - SCOPUS:23144441476

SN - 0302-9743

VL - 3259

SP - 1

EP - 15

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

T2 - 4th International Workshop CLIMA IV: Computational Logic in Multi-Agent Systems

Y2 - 6 January 2004 through 7 January 2004

ER -

Distributed algorithms for dynamic survivability of multiagent systems

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this