Load Balancing on Semi-direct Product and Hierarchical Star Interconnection Networks

We suggest strategies for solving the problem of load balancing on semi-direct product and hierarchical star networks to enhance the stability and accelerate the iterating speed over some known algorithms whose convergence speed is slow when they are applied to two sorts of multistage network above because their small Laplace condition numbers, relative to those small scale networks. Several theoretical results are presented to prove the superiority of our algorithms. Concretely, our schemes need a low-cost spectrum computing and simple iterating procedure in conjunction with a better convergence property, compared with known those. Some numerical results of stimulation validate the reliability of our algorithm.