Migration Cost-Sensitive Load Balancing for Social Networked Multiagent Systems with Communities

In the past, many approaches have been devised to address the load balancing problem for social networked multiagent systems (SN-MASs). However, few of these approaches consider the migration cost incurred when migrating tasks for load balancing, moreover, current SN-MASs often consist of communities, and the migration costs of intra-community and intercommunity transfers are heterogeneous. To minimize the load imbalance of agents and to incur the least migration cost, this paper introduces a net profit-based load balancing mechanism. In this mechanism, each load balance process (i.e., migrating a task from one agent to another agent) is associated with a net profit value which depends on the benefit it gains by making a contribution to alleviating the system load unfairness and the cost of migrating the task. The agents always perform the optimal load balance process that has the maximum net profit value, thereby improving system performance, as well as reducing the migration cost. Our simulations show that our approach not only guarantees that agents can undertake fair loads but also reduces the overhead migration costs compared with the previous load balancing approaches that ignore the cost of migrating the task.

[1]  Pattie Maes,et al.  Challenger: a multi-agent system for distributed resource allocation , 1997, AGENTS '97.

[2]  Wei Chen,et al.  Community Detection in Social Networks through Community Formation Games , 2011, IJCAI.

[3]  Yichuan Jiang,et al.  Locality-sensitive task allocation and load balancing in networked multiagent systems: Talent versus centrality , 2011, J. Parallel Distributed Comput..

[4]  R. K. McConnell,et al.  Load Balancing , 2021, Encyclopedia of Algorithms.

[5]  Yu-Kwong Kwok,et al.  On Load Balancing for Distributed Multiagent Computing , 2002, IEEE Trans. Parallel Distributed Syst..

[6]  Jie Hu,et al.  Decentralized Load Balancing on Unstructured Peer-2-Peer Computing Grids , 2006, Fifth IEEE International Symposium on Network Computing and Applications (NCA'06).

[7]  A. Vespignani,et al.  The architecture of complex weighted networks. , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[8]  Anthony T. Chronopoulos,et al.  Game-theoretic static load balancing for distributed systems , 2011, J. Parallel Distributed Comput..

[9]  Yiming Hu,et al.  Efficient, proximity-aware load balancing for DHT-based P2P systems , 2005, IEEE Transactions on Parallel and Distributed Systems.

[10]  M. Newman Analysis of weighted networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  Wanyuan Wang,et al.  Task Allocation for Undependable Multiagent Systems in Social Networks , 2013, IEEE Transactions on Parallel and Distributed Systems.

[12]  Samuel T. Chanson,et al.  Hydrodynamic Load Balancing , 1999, IEEE Trans. Parallel Distributed Syst..

[13]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[14]  Richard M. Karp,et al.  Load balancing in dynamic structured P2P systems , 2004, IEEE INFOCOM 2004.

[15]  Jiming Liu,et al.  Agent-based load balancing on homogeneous minigrids: macroscopic modeling and characterization , 2005, IEEE Transactions on Parallel and Distributed Systems.

[16]  Jiuchuan Jiang,et al.  Contextual Resource Negotiation-Based Task Allocation and Load Balancing in Complex Software Systems , 2009, IEEE Transactions on Parallel and Distributed Systems.

[17]  Sarit Kraus,et al.  Coalition formation with uncertain heterogeneous information , 2003, AAMAS '03.