A coordination mechanism to replicate large-scale multi-agent systems
Pages 130 - 136
Abstract
Distributed cooperative applications are now increasingly designed as Multi-Agent Systems (MAS). Such applications may be open, dynamic, large scale and exhibit heterogeneous and dynamic agents criticalities. These characteristics create new challenges to the traditional approaches of fault-tolerance. We focus on replication-based preventive approach. The aim is to dynamically and automatically adapt the agent replication strategy (number of replicas and their location), in order to maximize the MAS reliability (guarantee of continuity of computation w.r.t the agents criticalities). In this paper, we describe a decentralized coordination mechanism supporting adaptive replication. In order to provide a clear understanding of the specifics of our proposal, we provide a theoretical validation and report on experimental validations by confronting our proposal with an existing solution that is structurally similar.
References
[1]
K. J. Arrow, A. K. Sen, and K. Suzumura. 2002. Handbook of Social Choice and Welfare. Vol. Vol. 1. North-Holland.
[2]
Sebnem Bora and Oguz Dikenelli. 2006. Implementing a Multi-agent Organization that Changes Its Fault Tolerance Policy at Run-Time. Springer Berlin Heidelberg, Berlin, Heidelberg, 153--167.
[3]
Yann Chevaleyre, Paul E. Dunne, Ulle Endriss, Jérôme Lang, Michel Lemaître, Nicolas Maudet, Julian Padget, Steve Phelps, Juan A. Rodríguez-aguilar, and Paulo Sousa. 2006. Issues in multiagent resource allocation. Informatica 30 (2006), 2006.
[4]
Y. Chevaleyre, U. Endriss, S. Estivie, and N. Maudet. 2005. Welfare engineering in practice: On the variety of multiagent resource allocation problems. In Engineering Societies in the Agents World V. Vol. 3451. Springer, 335--347.
[5]
Yann Chevaleyre, Ulle Endriss, Jérôme Lang, and Nicolas Maudet. 2007. A short introduction to computational social choice. In Proc. 33rd Conference on Current Trends in Theory and Practice of Computer Science. Springer-Verlag.
[6]
F. Cristian. 1991. Understanding fault-tolerant distributed systems. Commun. ACM 34, 2 (1991), 56--78.
[7]
Bouyssou D., Perny P., and Marchant T. 2009. Social Choice Theory and Multicriteria Decision Aiding. Wiley, Chichester -, 868.
[8]
Alessandro De Luna Almeida. 2008. Replication heuristics for agents fault tolerance: a plan-based approach. Ph.D. Dissertation. Université Paris 6.
[9]
U. Endriss and N. Maudet. 2004. Welfare engineering in multiagent systems, In Lecture notes in computer science. Lecture Note In Computer Science, 93--106.
[10]
Alessandro Farinelli, Alex Rogers, and Nick Jennings. 2009. Bounded Approximate Decentralised Coordination using the Max-Sum Algorithm. In IJCAI-09 Workshop on Distributed Constraint Reasoning (DCR). 46--59. Event Dates: 13th July 2009.
[11]
Alan Fedoruk and Ralph Deters. 2002. Improving Fault-tolerance by Replicating Agents. In Proceedings of the First International Joint Conference on Autonomous Agents and Multiagent Systems: Part 2 (AAMAS '02). ACM, New York, NY, USA, 737--744.
[12]
R. Guerraoui and A. Schiper. 1997. Software-based replication for fault tolerance. Computer 30, 4(Apr 1997), 68--74.
[13]
Zahia Guessoum,Jean-Pierre Briot, Noura Faci, and Olivier Marin. 2010. Towards reliable multi-agent systems: An adaptive replication mechanism. Multiagent and Grid Systems 6, 1 (2010), 1--24.
[14]
Zahia Guessoum, Jean-Pierre Briot, Olivier Marin, Athmane Hamel, and Pierre Sens. 2003. Dynamic and Adaptive Replication for Large-Scale Reliable Multiagent Systems. In Software Engineering for Large-Scale Multi-Agent Systems, Alessandro Garcia, Carlos Lucena, Franco Zambonelli, Andrea Omicini, and Jaelson Castro (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 182--198.
[15]
Zahia Guessoum, Mikal Ziane, and Nora Faci. 2004. Monitoring and Organizational-Level Adaptation of Multi-Agent Systems. In AAMAS. 514--521.
[16]
H. Katagishi and J. P. Pearce. 2007. Distributed DCOP Algorithm for Arbitrary k- Optima with Monotonically Increasing Utility. In CP 2007 Workshop on Distributed Constraint Reasoning.
[17]
Christopher Kiekintveld, Zhengyu Yin, Atul Kumar, and Milind Tambe. 2010. Asynchronous algorithms for approximate distributed constraint optimization with quality bounds. In Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1 (AAMAS '10). International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC, 133--140.
[18]
S. Kraus, V.S. Subrahmanian, and N. Cihan Tacs. 2003. Probabilistically Survivable MASs. In IJCAI'03. 789--795.
[19]
Tamir Tassa, Roie Zivan, and Tal Grinshpoun. 2016. Preserving Privacy in Region Optimal DCOP Algorithms. In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI'16). AAAI Press, 496--502. http://dl.acm.org/citation.cfm?id=3060621.3060691
[20]
Robbert Van Renesse, Ken Birman, and Silvano Maffeis. 1996. Horus: A Flexible Group Communication System. 39 (04 1996), 76--.
[21]
Yingqian Zhang, Efrat Manisterski, Sarit Kraus, V.S. Subrahmanian, and David Peleg. 2009. Computing the fault tolerance of multi-agent deployment. Artificial Intelligence 173, 3 (2009), 437 -- 465.
Index Terms
- A coordination mechanism to replicate large-scale multi-agent systems
Recommendations
Rational Coordination in Multi-Agent Environments
We adopt the decision-theoretic principle of expected utility maximization as a paradigm for designing autonomous rational agents, and present a framework that uses this paradigm to determine the choice of coordinated action. We endow an agent with a ...
Coordination in Introspective Multi-Agent Systems
IAT '07: Proceedings of the 2007 IEEE/WIC/ACM International Conference on Intelligent Agent TechnologyThis paper proposes a multi-agent system architecture based on introspective agents provided with an expressive communication language and reasoning capabilities on their skills. The agents' introspective capabilities make it possible to agents to ...
Comments
Information & Contributors
Information
Published In
May 2018
244 pages
Copyright © 2018 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
- SIGSOFT: ACM Special Interest Group on Software Engineering
- IEEE-CS: Computer Society
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 28 May 2018
Check for updates
Qualifiers
- Short-paper
Funding Sources
Conference
ICSE '18
Sponsor:
- SIGSOFT
- IEEE-CS
Acceptance Rates
Overall Acceptance Rate 17 of 31 submissions, 55%
Upcoming Conference
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 104Total Downloads
- Downloads (Last 12 months)10
- Downloads (Last 6 weeks)0
Reflects downloads up to 08 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in