Anti-Clustering Ant-Based Load Balancing in Distributed Systems

Large-scale distributed computing systems form the backbone of cloud, grid, fog, and IoT systems, where applications are divided into tasks distributed across compute nodes. The performance and resource utilization of these systems depend heavily on task distribution. Thus, an effective load balancing algorithm for optimal task allocation across compute nodes is essential. In this paper, we address the problem of load balancing in distributed systems composed of compute nodes interconnected in a graph-like network. We solve this problem by proposing a new algorithm inspired by the object clustering behavior of ants, but applied in reverse, hence the name ’anti-clustering’. This is a distributed, simple task allocation algorithm, requiring minimal memory for each artificial ant and a basic probabilistic rule for task allocation. Simulation results across various network topologies, task numbers, and transfer times show that our algorithm outperforms a conventional diffusion-based load balancing algorithm.

Authors

Institutions

Publication Details

Published
2025-05-21
DOI
https://doi.org/10.1109/iccta65425.2025.11166466
Primary Topic
Distributed and Parallel Computing Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Anti-Clustering Ant-Based Load Balancing in Distributed Systems

Dorian Minarolli
Distributed and Parallel Computing Systems
article

Anti-Clustering Ant-Based Load Balancing in Distributed Systems

Dorian Minarolli
article en

Abstract

Large-scale distributed computing systems form the backbone of cloud, grid, fog, and IoT systems, where applications are divided into tasks distributed across compute nodes. The performance and resource utilization of these systems depend heavily on task distribution. Thus, an effective load balancing algorithm for optimal task allocation across compute nodes is essential. In this paper, we address the problem of load balancing in distributed systems composed of compute nodes interconnected in a graph-like network. We solve this problem by proposing a new algorithm inspired by the object clustering behavior of ants, but applied in reverse, hence the name ’anti-clustering’. This is a distributed, simple task allocation algorithm, requiring minimal memory for each artificial ant and a basic probabilistic rule for task allocation. Simulation results across various network topologies, task numbers, and transfer times show that our algorithm outperforms a conventional diffusion-based load balancing algorithm.

Polytechnic University of Tirana (AL)
Openalex Percentile: Top 70%
Distributed and Parallel Computing Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.