Advertisement

Solving the Delay-Constrained Capacitated Minimum Spanning Tree Problem Using a Dandelion-Encoded Evolutionary Algorithm

  • Ángel M. Pérez-Bellido
  • Sancho Salcedo-Sanz
  • Emilio G. Ortiz-García
  • Antonio Portilla-Figueras
  • Maurizio Naldi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5361)

Abstract

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.

Keywords

Evolutionary Algorithm Source Node Minimum Span Tree Minimum Span Tree Problem Current Topology 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Lee, Y.J., Atiquzzaman, M.: Least cost heuristic for the delay-constrained capacitated minimum spanning tree problem. Computer Communications 28, 1371–1379 (2005)CrossRefGoogle Scholar
  2. 2.
    Lee, Y.J., Atiquzzaman, M.: Exact algorithm for delay-constrained capacitated minimum spanning tree network. IET Communications 1(6), 1238–1247 (2007)CrossRefGoogle Scholar
  3. 3.
    Thomadsen, T., Larsen, J.: A hub location problem with fully interconnected backbone and access networks. Computers & Operations Research 34, 2520–2531 (2007)CrossRefzbMATHGoogle Scholar
  4. 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. 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. 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. 7.
    Esau, L., Williams, K.: On teleprocessing system design, part II. IBM System Journal 3, 142–147 (1996)Google Scholar
  8. 8.
    Chandy, K.M., Lo, T.: The capacitated minimum spanning tree. Networks 3, 173–181 (1973)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Papadimitriou, C.: The complexity of the capacitated minimum spanning tree problem. Networks 8, 217–230 (1978)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 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
  11. 11.
    Reeves, D.S., Salama, H.F.: A distributed algorithm for delay-constrained unicast routing. IEEE/ACM Transactions on Networking 8(2), 239–250 (2000)CrossRefGoogle Scholar
  12. 12.
    Paulden, T., Smith, D.K.: From the Dandelion code to the Rainbow code: a class of bijective spanning tree representations with linear complexity and bounded locality. IEEE Trans. Evol. Comput. 10(2), 108–123 (2006)CrossRefGoogle Scholar
  13. 13.
    Thompson, E., Paulden, T., Smith, D.K.: The Dandelion code: a new coding of spanning trees for genetic algorithms. IEEE Trans. Evol. Comput. 11(1), 91–100 (2007)CrossRefGoogle Scholar
  14. 14.
    Deo, N., Micikevicius, P.: Prüfer-like codes for labeled trees. Congressus Numerantium 151, 65–73 (2001)MathSciNetzbMATHGoogle Scholar
  15. 15.
    Picciotto, S.: How to encode a tree, Ph.D. dissertation, Univ. California, San Diego (1999)Google Scholar
  16. 16.
    Goldberg, D.: Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading (1989)zbMATHGoogle Scholar
  17. 17.
    Prim, R.C.: Shortest connection networks and some generalisations. Bell System Technical Journal 36, 1389–1401 (1957)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Ángel M. Pérez-Bellido
    • 1
  • Sancho Salcedo-Sanz
    • 1
  • Emilio G. Ortiz-García
    • 1
  • Antonio Portilla-Figueras
    • 1
  • Maurizio Naldi
    • 2
  1. 1.Department of Signal Theory and CommunicationsUniversidad de AlcaláMadridSpain
  2. 2.Dip. di Informatica, Sistemi e ProduzioneRomaItaly

Personalised recommendations