This work presents the concept of code and data propagation in a multi-agent system. First, the concepts of agent and multi-agent system are defined and examples are presented. Also arguments for using agent approach are given and potential benefits are listed.Afterwards the idea of code and data propagation is defined and explained. Then some examples of real solutions are given along with propagation algorithms, which depict the way of introducing the concept into real system solutions. Afterwards the code and data propagation in a multi-agent system is described, which is in many cases based on the object migration…
Contents
1 INTRODUCTION
2 AGENT AND MULTI-AGENT SYSTEMS
2.1 AGENTS
2.1.1 Definitions
2.1.2 Agent communication
2.1.3 Agent interaction
2.1.4 Agent classifications
2.1.5 Agent examples
2.2 MULTI-AGENT SYSTEMS
2.2.1 A multi-agent system architecture
2.2.2 Agents in a multi-agent system
2.2.3 Multi-agent system software qualities
2.2.4 MAS classifications
2.2.5 Benefits, reasons and challenging issues in multi-agent systems
2.2.6 Multi-agent system examples
3 CODE AND DATA PROPAGATION
3.1 DEFINITIONS
3.1.1 Propagation
3.2 DATA PROPAGATION
3.3 CODE PROPAGATION
3.4 RELATED WORK
3.5 PROPAGATION ALGORITHMS
3.5.1 Forward propagation
3.5.2 Backward propagation
3.5.3 Forward-backward propagation
3.6 OBJECT MIGRATION
3.7 CODE AND DATA PROPAGATION IN A MULTI-AGENT SYSTEM
3.7.1 Strong migration
3.7.2 Weak migration
3.7.3 Mobile agents
3.7.4 Dynamic load balancing
3.7.5 System examples with agent migration
3.7.5.1 Agents in distributed sensing
3.7.5.2 Agents for spacecraft control
4 MULTI-AGENT ENVIRONMENTS
4.1 DIET
4.1.1 Agents
4.1.2 Messaging
4.1.3 Threading
4.1.4 Remote communication
4.1.5 Managing all together
4.2 JADE
4.2.1 FIPA standard
4.2.2 Architecture
4.2.3 Messaging
4.2.4 Agents
4.2.5 Agent mobility
4.3 D’AGENTS
4.3.1 Architecture
4.3.2 Agents
4.3.3 Agent mobility
24.3.4 Messaging
4.4 MULTI-AGENT PLATFORMS COMPARISON
4.4.1 Sophistication and functionality
4.4.2 Communication
4.4.3 Utility in development
4.4.4 Agent migration
4.4.5 Choosing the platform
5 SYSTEM PROJECT AND IMPLEMENTATION
5.1 PRINCIPAL OBJECTIVE
5.1.1 Assumptions
5.1.2 The multi-agent platform
5.1.3 Prime numbers problem solving
5.1.3.1 The primes searching algorithm
5.1.3.2 The network
5.2 AGENTS
5.2.1 A methodology to describe a multi-agent system
5.2.2 Agent Model Information
5.2.2.1 Broker
5.2.2.2 Saver
5.2.2.3 Primer
5.2.2.4 Coordinator
5.2.2.5 Migration Coordinator
5.3 TASKS
5.3.1 Main process
5.3.1.1 Sequence diagram
5.3.1.2 Message asynchronisms problem
5.3.2 Migration process
5.3.2.1 Estimation of time till the end of the experiment
5.3.2.2 Migration calculation
5.3.2.3 Local migration coordination
5.3.2.4 Local state saving
5.3.2.5 Sequence diagram
5.4 PARAMETERS IN THE SYSTEM
5.5 MIGRATION ALGORITHM TYPES AND MIGRATION TYPES
5.5.1 Migration algorithm types
5.5.1.1 Unlimited migration
5.5.1.2 Limited migration
5.5.1.3 Mixed migration
5.5.2 Migration types
5.5.2.1 Move
5.5.2.2 Clone
5.5.2.3 Birth
5.6 AGENT NETWORK
5.6.1 Network topology
5.6.2 Names of agents in the system
5.7 FORMAL SYSTEM MODEL
6 EXPERIMENTS
6.1 TESTBED
6.2 EXPERIMENTAL PART
6.2.1 Computer efficiency investigation
6.2.2 Networked computers efficiency testing
6.2.3 Maximum and minimum strategies
6.2.3.1 Maximum and minimum strategies without migration
6.2.3.2 Maximum and minimum strategies with migration
6.2.4 Parameters investigation
6.2.5 Migration types testing
6.2.6 Multi-agent migration
36.2.7 Massive multi-agent migration
6.2.8 Experiment reports
6.2.8.1 Test 1
6.2.8.2 Test 2
6.2.8.3 Test 3
6.3 OPTIMAL CONFIGURATIONS
7 CONCLUSIONS AND FUTURE WORK
8 BIBLIOGRAPHY
9 APPENDIXES
9.1 AGENT MODEL INFORMATION
9.1.1 Broker agent
9.1.2 Saver agent
9.1.3 Primer agent
9.1.4 Coordinator agent
9.1.5 Migration Coordinator agent
9.2 NETWORK EFFICIENCY TESTING
9.3 FULL EXPERIMENT REPORTS
9.4 FIGURE INDEX
9.5 TABLE INDEX
Author: Aleksander Lupa
Source: Blekinge Institute of Technology
Download URL 2: Visit Now