Core-Edge designofstorageareanetworks—ASingle-edgeformulationwith problem-specific cuts

Optimization andheuristicmethodsforthedesignofmediumtolargestorageareanetworks(SANs)are in theearlystagesofdevelopment,butarerequirediflargeclusteredstoragesystemsaretobecomea viable alternativetoexpensivemonolithicstorage.Wepresenthereanewmixed-integerformulationfor optimal designofastorageareanetwork.OurformulationmodelstheSingle-edgeCore-Edgetopology. Using atestbedofmediumtolargeproblems,wecomparethesolutiontimesforournewformulation to thecurrentbenchmarkintheliterature—ourformulationsolvesinsignificantlylesstimewithan off-the-shelf optimizationsoftwarepackage.Wealsogenerateproblem-specificcutstofurtherreducethe solution timeforourformulation.Analgorithm,whichincludesanintegerprogrammingsubproblem,is described forgeneratingsomeofthesecuts.Foralltestproblems,thecutsyieldafurtherreductionin the solutiontime.