Semi-Distributed Load Balancing for Massively Parallel Multicomputer Systems
IEEE Transactions on Software Engineering
MACE3J: fast flexible distributed simulation of large, large-grain multi-agent systems
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
Organization Self-Design of Distributed Production Systems
IEEE Transactions on Knowledge and Data Engineering
On Load Balancing for Distributed Multiagent Computing
IEEE Transactions on Parallel and Distributed Systems
Quantitative Evaluation of Pairwise Interactions between Agents
ASA/MA 2000 Proceedings of the Second International Symposium on Agent Systems and Applications and Fourth International Symposium on Mobile Agents
MA '97 Proceedings of the First International Workshop on Mobile Agents
Towards Truly Agent-Based Traffic and Mobility Simulations
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
Towards autonomous mobile agents with emergent migration behaviour
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
A platform for massive agent-based simulation and its evaluation
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Agent server for a location-aware personalized notification service
MMAS'04 Proceedings of the First international conference on Massively Multi-Agent Systems
| Hi-index | 0.00 |
Recently, large-scale distributed multiagent systems consisting of one million of agents have been developed. When agents are distributed among multiple servers, both the computational and interaction cost of servers must be considered when optimizing the performance of the entire system. Multiagent systems reflect the structure of social communities and artificial networks such as the Internet. Since the networks possess characteristics common to the `small world' phenomenon, networks of agents on the systems can be considered as small worlds. In that case, communities, which are the sets of agents that frequently interact with each other, exist in the network. Most previous works evaluate agents one by one to select the most appropriate agent to be moved to a different server. If the networks of agents are highly clustered, previous works divide the communities when moving agents. Since agents in the same community often interact with each other, this division of communities increases the interaction cost among servers. We propose community-based load balancing (CLB), which evaluates the communities to select the most appropriate set of agents to be moved. We conducted simulations to evaluate our proposed method according to the network of agents. Our simulations show that when the clustering coefficient is close to 1.0, the interaction cost with CLB can be approximately 30% lower than that with previous works.