Solving the Delay-Constrained Capacitated Minimum Spanning Tree Problem Using a Dandelion-Encoded Evolutionary Algorithm
The Delay-Constrained Capacitated Minimum Spanning Tree (DC-CMST) is a recently proposed problem which arises in the design of the topology of communications networks. The DC-CMST proposes the joint optimization of the network topology in terms of the traffic capacity and its mean time delay. In this paper, an evolutionary algorithm which uses Dandelion-encoding is proposed to solve the problem. The Dandelion code has been recently proposed as an effective way of encoding trees in evolutionary algorithms, due to its good properties of locality. We describe the main characteristics of the algorithm, and compare its results with that of an existing heuristic for the DC-CMST. We show that our Dandelion-encoded evolutionary algorithm is able to obtain better results in all the instances tackled.
KeywordsEvolutionary Algorithm Source Node Minimum Span Tree Minimum Span Tree Problem Current Topology
Unable to display preview. Download preview PDF.
- 4.Astic, I., Festor, O.: A hierarchical topology discovery sevice for IPv6 networks. In: Proc. of the IEEE/IFIP Network Operations and Management Symposium, pp. 497–510 (2002)Google Scholar
- 5.Bejerano, Y., Breitbart, M., Rastogi, R.: Physical topology discovery for large multi subnet networks. In: Proc. of IEEE INFOCOM 2003, pp. 342–352 (2003)Google Scholar
- 6.Gavish, B.: Parallel savings heuristic for the topological design of local access tree networks. In: Proc. of IEEE INFOCOM 2003, pp. 130–139 (2003)Google Scholar
- 7.Esau, L., Williams, K.: On teleprocessing system design, part II. IBM System Journal 3, 142–147 (1996)Google Scholar
- 10.Karaman, A., Hassanein, H.: DCMC–delay constrained multipoint communication with multiple sources. In: Proc. of the IEEE International Symposium on Computers and Communications (2003)Google Scholar
- 15.Picciotto, S.: How to encode a tree, Ph.D. dissertation, Univ. California, San Diego (1999)Google Scholar