Dependency of Network Structures in Agent Selection and Deployment

Authors:
Kensuke Fukuda;Toshio Hirotsu;Satoshi Kurihara;Shin-ya Sato;Osamu Akashi;Toshiharu Sugawara
Affiliations:
National Institute of Informatics, Japan;Toyohashi University of Technology, Japan;Osaka University, Japan;NTT Laboratories;NTT Laboratories;NTT Laboratories
Venue:
IAT '06 Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology
Year:
2006

Citing 7
Cited 0

On power-law relationships of the Internet topology

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence

Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence
Percolation Search in Power Law Networks: Making Unstructured Peer-to-Peer Networks Scalable

P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Agent-organized networks for dynamic team formation

Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
On the Use of Hierarchical Power-law Network Topology for Server Selection and Allocation in Multi-Agent Systems

IAT '05 Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology
Distributed Systems: Principles and Paradigms (2nd Edition)

Distributed Systems: Principles and Paradigms (2nd Edition)
Evolution of Networks: From Biological Nets to the Internet and WWW (Physics)

Evolution of Networks: From Biological Nets to the Internet and WWW (Physics)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper shows that the statistical properties of the network topology are indispensable information for improving performance of multi-agent systems (MASs), though they have not received much attention in previous MAS research. In particular we focus on the applicability of the degree of an agent--the number of links among neighboring agents-- to load-balancing for the agent selection and deployment problem. The proposed selection algorithm does not need global information about the network structure and only requires the degree of a server agent and the degrees of the nodes neighboring the server agent. Through simulation of several topologies reproduced by the theoretical network models, we show that the use of the local topological information significantly improves the fairness of the servers even for a large-scale network. We also find that the key mechanisms for load-balancing in a given network topology are highly asymmetric degree characteristics (scalefree) and the negative degree correlation.