Abstract
Designing storage area networks is an NP-hard problem. Previous work has focused on traditional algorithmic techniques to automatically determine fabric requirements, network topology, and flow routes. This paper presents work performed with a genetic algorithm to both improve designs developed with heuristic techniques and to create new designs. For some small networks (10 hosts, 10 devices, and single-layered) we find that we can create networks which result in savings of several thousand dollars over previously established methods. This paper is the first publication, to our knowledge, to describe the successful application of this technique to storage area network design.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chu, C.-H., Premkumar, G., Chou, C., Sun, J.: Dynamic degree constrained network design: A genetic algorithm approach. In: Proceedings of GECCO 1999 (Genetic and Evolutionary Computation Conference 1999), pp. 141–148 (1999)
Dicke, E., Byde, A., Cliff, D., Layzell, P.: Using a genetic algorithm to design improved storage area network architectures. Technical Report HPL-2003-221, HP Laboratories, Bristol (November 2003)
Gavish, B.: Topological design of computer communication networks - the overall design problem. European Journal of Operational Research 58, 149–172 (1992)
Knowles, J., Corne, D.: A new evolutionary approach to the degreeconstrained minimum spanning tree problem. IEEE Transactions on Evolutionary Computation 4(2), 125–134 (2000)
Raidl, G.R., Julstrom, B.A.: Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem. In: Lamont, G., et al. (eds.) Proceedings of the 2003 ACM Symposium on Applied Computing, pp. 747–752 (2003)
Ward, J., O’Sullivan, M., Shahoumian, T., Wilkes, J.: Appia: automatic storage area network fabric design. In: Proceedings of the FAST 2002 Conference on File and Storage Technologies, January 2002, pp. 203–217 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dicke, E., Byde, A., Layzell, P., Cliff, D. (2004). Using a Genetic Algorithm to Design and Improve Storage Area Network Architectures. In: Deb, K. (eds) Genetic and Evolutionary Computation – GECCO 2004. GECCO 2004. Lecture Notes in Computer Science, vol 3102. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24854-5_105
Download citation
DOI: https://doi.org/10.1007/978-3-540-24854-5_105
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22344-3
Online ISBN: 978-3-540-24854-5
eBook Packages: Springer Book Archive