H. Kerivin, Thi-Tuyet-Loan Pham, D. Nace, J. Geffard
{"title":"用单一设施设计可生存的网络","authors":"H. Kerivin, Thi-Tuyet-Loan Pham, D. Nace, J. Geffard","doi":"10.1109/ECUMN.2002.1002107","DOIUrl":null,"url":null,"abstract":"We focus on the single facility capacitated survivable network design problem. We optimize simultaneously the topology, the link dimensioning for the nominal state as well as for the single link failure state when the survivable conditions are expressed by various rerouting strategies. We present a (mixed) integer mathematical approach that consists of several methodologies. To address the high dimensionality we use Benders' decomposition and a branch-and-bound method in parallel with a cutting plane approach. Beyond the interest of the proposed approach itself, we have considered and compared two well known restoration techniques as local rerouting and end-to-end rerouting. Numerous computational results for realistic networks are given to compare these rerouting mechanisms in terms of installed capacities as well as overall costs with respect to topology requirements.","PeriodicalId":398555,"journal":{"name":"2nd European Conference on Universal Multiservice Networks. ECUMN'2001 (Cat. No.02EX563)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Design of survivable networks with a single facility\",\"authors\":\"H. Kerivin, Thi-Tuyet-Loan Pham, D. Nace, J. Geffard\",\"doi\":\"10.1109/ECUMN.2002.1002107\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We focus on the single facility capacitated survivable network design problem. We optimize simultaneously the topology, the link dimensioning for the nominal state as well as for the single link failure state when the survivable conditions are expressed by various rerouting strategies. We present a (mixed) integer mathematical approach that consists of several methodologies. To address the high dimensionality we use Benders' decomposition and a branch-and-bound method in parallel with a cutting plane approach. Beyond the interest of the proposed approach itself, we have considered and compared two well known restoration techniques as local rerouting and end-to-end rerouting. Numerous computational results for realistic networks are given to compare these rerouting mechanisms in terms of installed capacities as well as overall costs with respect to topology requirements.\",\"PeriodicalId\":398555,\"journal\":{\"name\":\"2nd European Conference on Universal Multiservice Networks. ECUMN'2001 (Cat. No.02EX563)\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-08-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2nd European Conference on Universal Multiservice Networks. ECUMN'2001 (Cat. No.02EX563)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ECUMN.2002.1002107\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2nd European Conference on Universal Multiservice Networks. ECUMN'2001 (Cat. No.02EX563)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ECUMN.2002.1002107","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Design of survivable networks with a single facility
We focus on the single facility capacitated survivable network design problem. We optimize simultaneously the topology, the link dimensioning for the nominal state as well as for the single link failure state when the survivable conditions are expressed by various rerouting strategies. We present a (mixed) integer mathematical approach that consists of several methodologies. To address the high dimensionality we use Benders' decomposition and a branch-and-bound method in parallel with a cutting plane approach. Beyond the interest of the proposed approach itself, we have considered and compared two well known restoration techniques as local rerouting and end-to-end rerouting. Numerous computational results for realistic networks are given to compare these rerouting mechanisms in terms of installed capacities as well as overall costs with respect to topology requirements.