This thesis describes a method of achieving load balancing in telecommunications networks. A simulated network models a typical distribution of calls between nodes; nodes carrying an excess of traffic can become congested, causing calls to be lost. In addition to calls, the network also supports a population of simple mobile agents with behaviours modelled on the trail laying abilities of ants. The ants move across the network between randomly chosen pairs of nodes; as they move they deposit simulated pheromones as a function of their distance from their source node, and the congestion encountered on their journey. They select their path at each intermediate node according the distribution of simulated pheromones at each node. Calls between nodes are routed as a function of the pheromone distributions at each intermediate node. The performance of the network is measured by the average no of hops taken to complete the calls. In this thesis ,the results of using the antbased control (ABC) are compared with those achieved by using fixed shortestpath routes,(dijkstra’s algorithm) used in network management. The ABC system is shown to result in fewer call failures than the other methods, while exhibiting many attractive features of distributed control
