By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Fukuda, K. ; NTT Network Innovation Labs., Tokyo, Japan ; Sato, S.-y. ; Akashi, O. ; Hirotsu, T.
more authors

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.

Published in:

Intelligent Agent Technology, IEEE/WIC/ACM International Conference on

Date of Conference:

19-22 Sept. 2005