Date Added: May 2012
For effective working of peer to peer systems the load balancing is the critical task. To assign the load to a particular node, care should be taken that cost incur to assign the load should be minimized. The problem consists of a number of tasks that are to be assigned to various nodes in the network at the least cost. In this paper, the authors describe an algorithm for load assignment where other approaches resort to randomization. An analogy with the way ant colonies function has suggested the definition of a new computational paradigm, which they call Ant System. It is a viable new approach to stochastic combinatorial optimization.