On the use of hierarchical power-law network topology for server selection and allocation in multi-agent systems

In this paper, we focus on the effectiveness of using the power-law relationship that appears in actual network topology for solving server selection and allocation problems in multi-agent systems (MAS). We introduce the reverse weighted degree (RWD) server selection algorithm, which selects the nearest server with a lower load average, and the concept of the scope, which spreads the range of the topological information about neighbors. Furthermore, we evaluate the efficiency and fairness of the algorithm when server deployment is performed by using the degree-oriented server allocation, which places the server agent on more convenient nodes from the viewpoint of network topology, and by random server allocation. From simulation results using the real Internet topology, we find that awareness of the network structure can improve the total performance of agents significantly, though previous approaches in MAS did not consider the topology of the network.

[1]  Julie A. Adams,et al.  Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence , 2001, AI Mag..

[2]  Paul V. Mockapetris,et al.  Domain names: Concepts and facilities , 1983, RFC.

[3]  Albert-László Barabási,et al.  Evolution of Networks: From Biological Nets to the Internet and WWW , 2004 .

[4]  Edmund H. Durfee,et al.  Cooperation through communication in a distributed problem-solving network , 1990 .

[5]  Barbara Dunin-Keplicz,et al.  Proceedings of the 2005 IEEE/WIC/ACM International Conference on Intelligent Agent Technology , 2005 .

[6]  Vwani P. Roychowdhury,et al.  Percolation search in power law networks: making unstructured peer-to-peer networks scalable , 2004 .

[7]  R Pastor-Satorras,et al.  Dynamical and correlation properties of the internet. , 2001, Physical review letters.

[8]  Yakov Rekhter,et al.  A Border Gateway Protocol 4 (BGP-4) , 1994, RFC.

[9]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[10]  Albert-László Barabási,et al.  Hierarchical organization in complex networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  S. N. Dorogovtsev,et al.  Pseudofractal scale-free web. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  P. Oscar Boykin,et al.  Percolation search in power law networks: making unstructured peer-to-peer networks scalable , 2004, Proceedings. Fourth International Conference on Peer-to-Peer Computing, 2004. Proceedings..

[13]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[14]  Lada A. Adamic,et al.  Search in Power-Law Networks , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  Kensuke Fukuda,et al.  ARTISTE: Agent Organization Management System for Multi-Agent Systems , 2009, PRIMA.