Load-balanced routing has attracted considerable attention, especially in the recent years, where huge data volumes are carried over the computer networks. It is particularly important for non-all-to-all networks, where there is no direct communication between all the nodes of the network.Telecommunication and network systems constitute complex dynamic systems with an ever-increasing number of users and network services. It has become apparent that, new routing demands can not be easily satisfied by conventional routing methods. Thus, intelligent optimization methods (e.g., nature-inspired methodologies) have arisen to improve network efficiency.This paper presents a computational method that is based on modular arithmetic for achieving dynamic load balancing on data networks. The proposed algorithm organizes the overall communication into equal-sized packets, it divides the communication into a series of communication steps between the network nodes, and performs packet transfer. The last section includes discussion on the main costs each network routing operation inures: the data movement cost, the load information cost and the data reordering cost.
Keywords: Load balancing; Networks; Routing.