Вы находитесь на странице: 1из 21
Using a Genetic Algorithm to Design Improved Storage Area Network Architectures Elizabeth Dicke, Andrew Byde,

Using a Genetic Algorithm to Design Improved Storage Area Network Architectures

Elizabeth Dicke, Andrew Byde, Dave Cliff, Paul Layzell Information Infrastructure Laboratory HP Laboratories Bristol

HPL-2003-221

November 4 th , 2003*

E-mail: {elizabeth.dicke | andrew.byde | dave.cliff | paul.layzell} @hp.com

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.

* Internal Accession Date Only Copyright Hewlett-Packard Company 2003

Approved for External Publication

 

 

0 1 2 1 host0 host1 host0 host2 device0 device1 device1 device1 (a) 0 1

0

1

2

1

host0

host1

host0

host2

device0 device1 device1 device1

(a)

0

1

1

1

host0

host1

host0

host2

device0 device1 device1 device1

(b)

0

1

0

1

host0

host1

host0

host2

device0 device1 device1 device1

(c)

host2 device0 device1 device1 device1 (b) 0 1 0 1 host0 host1 host0 host2 device0 device1
host2 device0 device1 device1 device1 (b) 0 1 0 1 host0 host1 host0 host2 device0 device1
host2 device0 device1 device1 device1 (b) 0 1 0 1 host0 host1 host0 host2 device0 device1

0 50 100 150 200 250 300 overall cost 0 500 1000 1500
0
50
100
150
200
250
300
overall cost
0
500
1000
1500

generation

0 50 100 150 200 250 300 overall cost 0 500 1000 1500 generation
0 50 100 150 200 250 300 overall cost 0 500 1000 1500 generation

−250 −200 −150 −100 −50 0 50 100 % improvement frequency 0 5 10 15
−250 −200 −150 −100 −50 0 50 100 % improvement frequency 0 5 10 15
−250
−200
−150
−100
−50
0
50
100
% improvement
frequency
0
5
10
15
20