Pub Date : 2005-09-12DOI: 10.1109/MASSUR.2005.1507047
V. Cicirello, A. Mroczkowski, W. Regli
Designing decentralized software applications for a wireless network environment offers harsh challenges to the software engineer. All of the usual difficulties associated with a distributed system are present, but are amplified by the inherent dynamics and uncertainty of the wireless network. This paper takes an agent-oriented software engineering perspective in considering how to design decentralized software systems for a mobile ad hoc network (MANET) of resource-constrained devices. Specifically, the authors codify within the context of a software design pattern the concept of an agent swarm. Swarms of mobile agents have been used in the development of applications to support coordination and collaboration in a live MANET test bed. Work is underway to transition some of this technology into use by public protectors as part of the Philadelphia area urban wireless network testbed. The objectives of this paper include motivating the need for a swarm-based approach to distributed software for wireless environments and discussing the critical issues involved with mobile agents swarming on a MANET. For example, one such design issue is the selection of migration patterns for use by the swarming agents. Several different types of itinerary patterns are evaluated within the context of a mobile agent swarm.
{"title":"Designing decentralized software for a wireless network environment: evaluating patterns of mobility for a mobile agent swarm","authors":"V. Cicirello, A. Mroczkowski, W. Regli","doi":"10.1109/MASSUR.2005.1507047","DOIUrl":"https://doi.org/10.1109/MASSUR.2005.1507047","url":null,"abstract":"Designing decentralized software applications for a wireless network environment offers harsh challenges to the software engineer. All of the usual difficulties associated with a distributed system are present, but are amplified by the inherent dynamics and uncertainty of the wireless network. This paper takes an agent-oriented software engineering perspective in considering how to design decentralized software systems for a mobile ad hoc network (MANET) of resource-constrained devices. Specifically, the authors codify within the context of a software design pattern the concept of an agent swarm. Swarms of mobile agents have been used in the development of applications to support coordination and collaboration in a live MANET test bed. Work is underway to transition some of this technology into use by public protectors as part of the Philadelphia area urban wireless network testbed. The objectives of this paper include motivating the need for a swarm-based approach to distributed software for wireless environments and discussing the critical issues involved with mobile agents swarming on a MANET. For example, one such design issue is the selection of migration patterns for use by the swarming agents. Several different types of itinerary patterns are evaluated within the context of a mobile agent swarm.","PeriodicalId":391808,"journal":{"name":"IEEE 2nd Symposium on Multi-Agent Security and Survivability, 2005.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128822223","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2005-09-12DOI: 10.1109/MASSUR.2005.1507049
J. Debenham, S. Simoff
Negotiation is an information exchange process as well as an offer exchange process. Theories of competitive negotiation are typically founded on game theory where the agent's utility function is the focus. If an agent is uncertain of the integrity of its information then it may not know its utility with certainty. Here what an agent knows and how certain it is of what it knows are modelled using tools from information theory that are applied to value information. An agent attempts to instil a sense trust in its opponent by revealing information of comparable 'value' in its responses to that which it has received. Each proposal and claim exchanged reveals valuable information about the sender's position. A negotiation may break down if an agent believes that its opponent is not playing fairly. The agent aims to give the impression of fair play by responding with comparable information revelation whilst playing strategically to influence its opponent's preferences with claims. The agent makes no assumptions about the internals of its opponent, including her motivations, logic, and whether she is conscious of a utility function.
{"title":"An agents establishes trust with equitable information revelation","authors":"J. Debenham, S. Simoff","doi":"10.1109/MASSUR.2005.1507049","DOIUrl":"https://doi.org/10.1109/MASSUR.2005.1507049","url":null,"abstract":"Negotiation is an information exchange process as well as an offer exchange process. Theories of competitive negotiation are typically founded on game theory where the agent's utility function is the focus. If an agent is uncertain of the integrity of its information then it may not know its utility with certainty. Here what an agent knows and how certain it is of what it knows are modelled using tools from information theory that are applied to value information. An agent attempts to instil a sense trust in its opponent by revealing information of comparable 'value' in its responses to that which it has received. Each proposal and claim exchanged reveals valuable information about the sender's position. A negotiation may break down if an agent believes that its opponent is not playing fairly. The agent aims to give the impression of fair play by responding with comparable information revelation whilst playing strategically to influence its opponent's preferences with claims. The agent makes no assumptions about the internals of its opponent, including her motivations, logic, and whether she is conscious of a utility function.","PeriodicalId":391808,"journal":{"name":"IEEE 2nd Symposium on Multi-Agent Security and Survivability, 2005.","volume":"180 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134349185","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2005-09-12DOI: 10.1109/MASSUR.2005.1507044
N. Gnanasambandam, Seokcheon Lee, S. Kumara, N. Gautam, W. Peng, V. Manikonda, M. Brinn, M. Greaves
Distributed multi-agent systems (DMAS) such as supply chains functioning in highly dynamic environments need to achieve maximum overall utility during operation. The utility from maintaining performance is an important component of their survivability. This utility is often met by identifying trade-offs between quality of service and performance. To adaptively choose the operational settings for better utility, we propose an autonomous and scalable queueing theory based methodology to control the performance of a hierarchical network of distributed agents. By formulating the MAS as an open queueing network with multiple classes of traffic we evaluate the performance and subsequently the utility, from which we identify the control alternative for a localized, multi-tier zone. When the problem scales, another larger queueing network could be composed using zones as building blocks. This method advocates the systematic specification of the DMAS's attributes to aid realtime translation of the DMAS into a queueing network. We prototype our framework in Cougaar and verify our results.
{"title":"Survivability of a distributed multi-agent application - a performance control perspective","authors":"N. Gnanasambandam, Seokcheon Lee, S. Kumara, N. Gautam, W. Peng, V. Manikonda, M. Brinn, M. Greaves","doi":"10.1109/MASSUR.2005.1507044","DOIUrl":"https://doi.org/10.1109/MASSUR.2005.1507044","url":null,"abstract":"Distributed multi-agent systems (DMAS) such as supply chains functioning in highly dynamic environments need to achieve maximum overall utility during operation. The utility from maintaining performance is an important component of their survivability. This utility is often met by identifying trade-offs between quality of service and performance. To adaptively choose the operational settings for better utility, we propose an autonomous and scalable queueing theory based methodology to control the performance of a hierarchical network of distributed agents. By formulating the MAS as an open queueing network with multiple classes of traffic we evaluate the performance and subsequently the utility, from which we identify the control alternative for a localized, multi-tier zone. When the problem scales, another larger queueing network could be composed using zones as building blocks. This method advocates the systematic specification of the DMAS's attributes to aid realtime translation of the DMAS into a queueing network. We prototype our framework in Cougaar and verify our results.","PeriodicalId":391808,"journal":{"name":"IEEE 2nd Symposium on Multi-Agent Security and Survivability, 2005.","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126519805","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2005-09-12DOI: 10.1109/MASSUR.2005.1507050
R. Montanari, A. Toninelli, J. Bradshaw
Policies are being increasingly used for controlling the behavior of complex multi-agent systems. The use of policies allows administrators to specify both agent permissions and duties without changing source code or requiring the consent or cooperation of the agents being governed. However, policy-based control can encounter difficulties when applied to agents that act in pervasive environments characterized by frequent and unpredictable changes. In this case, policies cannot be all specified a priori to face any operative run time situation, but require continuous adjustments to allow agents to behave in a contextually appropriate manner. Current approaches to policy representation have been restrictive in many ways, as they typically follow a subject-centric model, which assigns agent permissions and obligations on the basis of agent role/identity information. However, in the new pervasive scenario the roles/identities of interacting agents may not be known a-priori and most important, may not be informative or sufficiently trustworthy. We claim that the design of policy-based agent systems for pervasive environments requires a paradigm shift from subject-centric to context-centric policy models. This paper discusses some issues concerning the specification and enforcement of context-driven policies and presents a novel context-based policy approach that considers context as a first-class principle to guide both policy specification and enforcement. In this perspective, "context" explicitly appears in the specification of security policies and context changes trigger the evaluation process of applicable agent permissions and obligations.
{"title":"Context-based security management for multi-agent systems","authors":"R. Montanari, A. Toninelli, J. Bradshaw","doi":"10.1109/MASSUR.2005.1507050","DOIUrl":"https://doi.org/10.1109/MASSUR.2005.1507050","url":null,"abstract":"Policies are being increasingly used for controlling the behavior of complex multi-agent systems. The use of policies allows administrators to specify both agent permissions and duties without changing source code or requiring the consent or cooperation of the agents being governed. However, policy-based control can encounter difficulties when applied to agents that act in pervasive environments characterized by frequent and unpredictable changes. In this case, policies cannot be all specified a priori to face any operative run time situation, but require continuous adjustments to allow agents to behave in a contextually appropriate manner. Current approaches to policy representation have been restrictive in many ways, as they typically follow a subject-centric model, which assigns agent permissions and obligations on the basis of agent role/identity information. However, in the new pervasive scenario the roles/identities of interacting agents may not be known a-priori and most important, may not be informative or sufficiently trustworthy. We claim that the design of policy-based agent systems for pervasive environments requires a paradigm shift from subject-centric to context-centric policy models. This paper discusses some issues concerning the specification and enforcement of context-driven policies and presents a novel context-based policy approach that considers context as a first-class principle to guide both policy specification and enforcement. In this perspective, \"context\" explicitly appears in the specification of security policies and context changes trigger the evaluation process of applicable agent permissions and obligations.","PeriodicalId":391808,"journal":{"name":"IEEE 2nd Symposium on Multi-Agent Security and Survivability, 2005.","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116820636","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2005-09-12DOI: 10.1109/MASSUR.2005.1507045
Maxim Peysakhov, A. Mroczkowski, Leonardo F. Urbano, Jacob Warren, V. Cicirello, W. Regli, Moshe Kam Drexel
Wireless mobile ad-hoc networks (MANETS) of personal digital assistants (PDAs) are a growing field of study due to potential applications in environments that lack a functioning communications infrastructure. Mobile computing platforms such as PDAs and tablet PCs offer software designers great challenges to the design of survivable software applications. One of these challenges pertains to limited power resources. Processor loads, large amounts of wireless network activity, and input/output (I/O operations can strain the limited battery life inherent with such mobile platforms. In this paper we demonstrate how power awareness of software agents can increase system robustness and survivability. This paper presents first steps in a direction that can derive large payoffs for decentralized coordination and collaboration on power-constrained computing platforms.
{"title":"Agent survivability through power awareness","authors":"Maxim Peysakhov, A. Mroczkowski, Leonardo F. Urbano, Jacob Warren, V. Cicirello, W. Regli, Moshe Kam Drexel","doi":"10.1109/MASSUR.2005.1507045","DOIUrl":"https://doi.org/10.1109/MASSUR.2005.1507045","url":null,"abstract":"Wireless mobile ad-hoc networks (MANETS) of personal digital assistants (PDAs) are a growing field of study due to potential applications in environments that lack a functioning communications infrastructure. Mobile computing platforms such as PDAs and tablet PCs offer software designers great challenges to the design of survivable software applications. One of these challenges pertains to limited power resources. Processor loads, large amounts of wireless network activity, and input/output (I/O operations can strain the limited battery life inherent with such mobile platforms. In this paper we demonstrate how power awareness of software agents can increase system robustness and survivability. This paper presents first steps in a direction that can derive large payoffs for decentralized coordination and collaboration on power-constrained computing platforms.","PeriodicalId":391808,"journal":{"name":"IEEE 2nd Symposium on Multi-Agent Security and Survivability, 2005.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131456302","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2005-09-12DOI: 10.1109/MASSUR.2005.1507051
A. Unruh, H. Harjadi, J. Bailey, K. Ramamohanarao
In agent systems, an agent's recovery from, execution problems is often complicated by constraints that are not present in a more traditional distributed, database systems environment. An analysis of agent-related crash recovery issues is presented, and requirements for achieving 'acceptable' agent crash recovery are discussed. Motivated by this analysis, a novel approach to managing agent recovery is presented. It utilises an event-and task-driven model for employing semantic compensation; task retries, and checkpointing. The compensation/retry model requires a situated model of action and failure, and provides the agent with an emergent unified, treatment of both crash recovery and run-time failure-handling. This approach helps the agent to recover acceptably from crashes and execution problems; improve system predictability; manage inter-task dependencies; and address the way in which exogenous events or crashes can trigger the need for a re-decomposition of a task. Agent architecture is then presented, which uses pair processing to leverage these recovery techniques and increase the agent's availability on crash restart.
{"title":"Semantic-compensation-based recovery in multi-agent systems","authors":"A. Unruh, H. Harjadi, J. Bailey, K. Ramamohanarao","doi":"10.1109/MASSUR.2005.1507051","DOIUrl":"https://doi.org/10.1109/MASSUR.2005.1507051","url":null,"abstract":"In agent systems, an agent's recovery from, execution problems is often complicated by constraints that are not present in a more traditional distributed, database systems environment. An analysis of agent-related crash recovery issues is presented, and requirements for achieving 'acceptable' agent crash recovery are discussed. Motivated by this analysis, a novel approach to managing agent recovery is presented. It utilises an event-and task-driven model for employing semantic compensation; task retries, and checkpointing. The compensation/retry model requires a situated model of action and failure, and provides the agent with an emergent unified, treatment of both crash recovery and run-time failure-handling. This approach helps the agent to recover acceptably from crashes and execution problems; improve system predictability; manage inter-task dependencies; and address the way in which exogenous events or crashes can trigger the need for a re-decomposition of a task. Agent architecture is then presented, which uses pair processing to leverage these recovery techniques and increase the agent's availability on crash restart.","PeriodicalId":391808,"journal":{"name":"IEEE 2nd Symposium on Multi-Agent Security and Survivability, 2005.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127546533","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2005-09-12DOI: 10.1109/MASSUR.2005.1507046
J. Zinky, R. Shapiro, S. Siracuse, T. Wright
Coordination artifacts are first-class software entities that encapsulate an abstract communication pattern either among agents or between an agent and its environment. By separating these coordination artifacts from agent implementations, both are simplified and acquire a nearly parallel structure. Coordination artifacts provide an ideal means for dealing with systemic issues, including survivability, allowing the remaining agent code to focus solely on its domain/business logic. Coordination artifacts can be implemented as a small set of extensions to the existing Cougaar agent middleware. In this paper, we present a design for coordination artifacts and their implementation in Cougaar.
{"title":"Implementing QoS-adaptation in coordination artifacts by enhancing Cougaar multi-agent middleware","authors":"J. Zinky, R. Shapiro, S. Siracuse, T. Wright","doi":"10.1109/MASSUR.2005.1507046","DOIUrl":"https://doi.org/10.1109/MASSUR.2005.1507046","url":null,"abstract":"Coordination artifacts are first-class software entities that encapsulate an abstract communication pattern either among agents or between an agent and its environment. By separating these coordination artifacts from agent implementations, both are simplified and acquire a nearly parallel structure. Coordination artifacts provide an ideal means for dealing with systemic issues, including survivability, allowing the remaining agent code to focus solely on its domain/business logic. Coordination artifacts can be implemented as a small set of extensions to the existing Cougaar agent middleware. In this paper, we present a design for coordination artifacts and their implementation in Cougaar.","PeriodicalId":391808,"journal":{"name":"IEEE 2nd Symposium on Multi-Agent Security and Survivability, 2005.","volume":"32 18","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114110854","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2005-09-12DOI: 10.1109/MASSUR.2005.1507042
Y. Zhang, E. Manister, Sarit Kraus, V. S. Subrahmanian
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.
{"title":"Approximation results for probabilistic survivability","authors":"Y. Zhang, E. Manister, Sarit Kraus, V. S. Subrahmanian","doi":"10.1109/MASSUR.2005.1507042","DOIUrl":"https://doi.org/10.1109/MASSUR.2005.1507042","url":null,"abstract":"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.","PeriodicalId":391808,"journal":{"name":"IEEE 2nd Symposium on Multi-Agent Security and Survivability, 2005.","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124365819","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2005-09-12DOI: 10.1109/MASSUR.2005.1507043
A. Cassandra, M. Nodine, S. Bondale, S. Ford, D. Wells
A survivable agent system depends on the incorporation of many recovery features. However, the optimal use of these recovery features requires the ability to assess the actual state of the agent system accurately at a given time. This paper describes an approach for the estimation of the state of an agent system using partially-observable Markov decision processes (POMDPs). POMDPs are dependent on a model of the agent system - components, environment, sensors, and the actuators that can correct problems. Based on this model, we define a state estimation for each component (asset) in the agent system. We model a survivable agent system as a POMDP that takes into account both environmental threats and observations from sensors. We describe the process of updating the state estimation as time passes, as sensor inputs are received, and as actuators affect changes. This state estimation process has been deployed within the Ultralog application and successfully tested using Ultralog's survivability tests on a full-scale (1000+) agent system.
{"title":"Using POMDP-based state estimation to enhance agent system survivability","authors":"A. Cassandra, M. Nodine, S. Bondale, S. Ford, D. Wells","doi":"10.1109/MASSUR.2005.1507043","DOIUrl":"https://doi.org/10.1109/MASSUR.2005.1507043","url":null,"abstract":"A survivable agent system depends on the incorporation of many recovery features. However, the optimal use of these recovery features requires the ability to assess the actual state of the agent system accurately at a given time. This paper describes an approach for the estimation of the state of an agent system using partially-observable Markov decision processes (POMDPs). POMDPs are dependent on a model of the agent system - components, environment, sensors, and the actuators that can correct problems. Based on this model, we define a state estimation for each component (asset) in the agent system. We model a survivable agent system as a POMDP that takes into account both environmental threats and observations from sensors. We describe the process of updating the state estimation as time passes, as sensor inputs are received, and as actuators affect changes. This state estimation process has been deployed within the Ultralog application and successfully tested using Ultralog's survivability tests on a full-scale (1000+) agent system.","PeriodicalId":391808,"journal":{"name":"IEEE 2nd Symposium on Multi-Agent Security and Survivability, 2005.","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124507856","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2005-09-12DOI: 10.1109/MASSUR.2005.1507048
S. Rho, S. Rosset, T. Redmond
This paper describes Proteus, a tool set that allows users to build distributed multi-agent systems by selecting system properties, ranging from availability of critical components, performance characteristics, desired level of communication protection (encrypt, signature, specific algorithms), policies for society objects (e.g., messages, black-board objects, files, databases) and certificate authorities. Proteus then analyzes selected properties for consistency and tries to resolve them autonomously using previously provided resolution rules. The user is notified of any conflicts Proteus could not resolve for guidance. Once properties are deemed to be resolved, Proteus can generate system policies as well as the configuration files (e.g. XML files) that can be used to deploy the system.
{"title":"Configuring requirements-compliant multi-agent systems","authors":"S. Rho, S. Rosset, T. Redmond","doi":"10.1109/MASSUR.2005.1507048","DOIUrl":"https://doi.org/10.1109/MASSUR.2005.1507048","url":null,"abstract":"This paper describes Proteus, a tool set that allows users to build distributed multi-agent systems by selecting system properties, ranging from availability of critical components, performance characteristics, desired level of communication protection (encrypt, signature, specific algorithms), policies for society objects (e.g., messages, black-board objects, files, databases) and certificate authorities. Proteus then analyzes selected properties for consistency and tries to resolve them autonomously using previously provided resolution rules. The user is notified of any conflicts Proteus could not resolve for guidance. Once properties are deemed to be resolved, Proteus can generate system policies as well as the configuration files (e.g. XML files) that can be used to deploy the system.","PeriodicalId":391808,"journal":{"name":"IEEE 2nd Symposium on Multi-Agent Security and Survivability, 2005.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116732142","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：