Charley: a genetic algorithm for the design of mesh networks

This paper presents a genetic algorithm for the design of an optimal mesh network. The problem is of relevance in the design of communication networks where the backbone switching network takes the form of a highly connected mesh in order to provide reliability in the event of switch/link failure. The proposed algorithm addresses two important aspects of the problem-topology design and capacity allocation. The optimisation is done with respect to connection costs subject to performance (delay), connectivity and capacity constraints. Connection costs are assumed to depend on distance and link capacity. Though the algorithm was designed with mesh networks in mind, it can be applied to the simpler problem of the constrained minimum spanning tree. The algorithm has been tested on a tree network and two mesh networks. The results compare very favourably with those obtained from existing design techniques