TECHNOLOGICAL BASIS OF “INDUSTRY 4.0”
Distributed Task Allocation Based on Hierarchical Interactions in Wasp Colonies
Distributed systems are the fundamental building blocks of today’s internet and cloud data centers. Applications running on these systems are divided into multiple tasks, which are executed in parallel across different nodes. A key aspect of these systems is task allocation, or load balancing, which involves distributing tasks among the compute nodes. The performance of the application and the utilization of system resources heavily depend on the task allocation algorithm. In this paper, we address the task allocation problem in distributed systems where each node is connected to several neighbouring nodes, forming a graph-like structure. We propose a distributed task allocation algorithm inspired by the hierarchical interactions within wasp insect colonies. The key features of our algorithm include its reliance on simple probabilistic rules and a decentralized approach, which eliminates the need for a central coordinator. This makes the algorithm highly robust to failures and scalable. Through simulations, we compare our algorithm with another simple distributed approach and demonstrate its superiority, particularly in cases involving large data transfers. The probabilistic nature of our algorithm leads to fewer task transfers, resulting in more efficient task allocation.