一类可生存网络设计问题的路径生成

M. Dzida, M. Zagozdzon, M. Pióro, T. Sliwinski, W. Ogryczak
{"title":"一类可生存网络设计问题的路径生成","authors":"M. Dzida, M. Zagozdzon, M. Pióro, T. Sliwinski, W. Ogryczak","doi":"10.1109/NGI.2008.11","DOIUrl":null,"url":null,"abstract":"In this paper we address link dimensioning and routing problems related to the area of resilient network design. We present two network design problems that assume different flow restoration schemes used to cope with network failures. In both cases we allow bifurcation of traffic flows in the normal (failure-less) network state. In the case of a failure, we assume that affected primary flows (i.e., flows applied in the normal state) are restored using assigned protection paths and that the primary flows are restored (also in a bifurcated manner) in a separate pool of (protection) capacity, distinct from the basic capacity used in the normal network operation state. The two presented models differ in the way protection paths are used to protect primary flows against different failure states. The first model, called state-independent flow restoration, assumes that once the backup path is assigned it must be used in every state in which the protected primary path fails. The second model allows different protection paths to be used in different network failure states and is called state-dependent flow restoration. The considered problems are formulated as linear programming (LP) problems using link-path (L-P) notation of multi-commodity flow network optimization. As the L-P notation is useful only when an effective column generation scheme is known, we discuss the applicability of this method on the basis of the theory of duality of LP. The paper presents and compares three different approaches and evaluates their usefulness for solving problem instances of practical size.","PeriodicalId":182496,"journal":{"name":"2008 Next Generation Internet Networks","volume":"75 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Path Generation for a Class of Survivable Network Design Problems\",\"authors\":\"M. Dzida, M. Zagozdzon, M. Pióro, T. Sliwinski, W. Ogryczak\",\"doi\":\"10.1109/NGI.2008.11\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we address link dimensioning and routing problems related to the area of resilient network design. We present two network design problems that assume different flow restoration schemes used to cope with network failures. In both cases we allow bifurcation of traffic flows in the normal (failure-less) network state. In the case of a failure, we assume that affected primary flows (i.e., flows applied in the normal state) are restored using assigned protection paths and that the primary flows are restored (also in a bifurcated manner) in a separate pool of (protection) capacity, distinct from the basic capacity used in the normal network operation state. The two presented models differ in the way protection paths are used to protect primary flows against different failure states. The first model, called state-independent flow restoration, assumes that once the backup path is assigned it must be used in every state in which the protected primary path fails. The second model allows different protection paths to be used in different network failure states and is called state-dependent flow restoration. The considered problems are formulated as linear programming (LP) problems using link-path (L-P) notation of multi-commodity flow network optimization. As the L-P notation is useful only when an effective column generation scheme is known, we discuss the applicability of this method on the basis of the theory of duality of LP. The paper presents and compares three different approaches and evaluates their usefulness for solving problem instances of practical size.\",\"PeriodicalId\":182496,\"journal\":{\"name\":\"2008 Next Generation Internet Networks\",\"volume\":\"75 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-04-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Next Generation Internet Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NGI.2008.11\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Next Generation Internet Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NGI.2008.11","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

摘要

在本文中,我们讨论了与弹性网络设计领域相关的链路尺寸和路由问题。我们提出了两个网络设计问题,假设不同的流量恢复方案用于处理网络故障。在这两种情况下,我们都允许正常(无故障)网络状态下的流量分叉。在故障的情况下,我们假设受影响的主流(即,在正常状态下应用的流)使用指定的保护路径恢复,并且主流在一个单独的(保护)容量池中恢复(也以分岔的方式),与正常网络运行状态下使用的基本容量不同。这两个模型的不同之处在于使用保护路径来保护主流免受不同故障状态的影响。第一个模型称为状态独立流恢复,它假设一旦分配了备份路径,在受保护的主路径发生故障的每个状态下都必须使用备份路径。第二个模型允许在不同的网络故障状态下使用不同的保护路径,称为状态依赖流恢复。所考虑的问题被表述为线性规划(LP)问题,使用多商品流网络优化的链路路径(L-P)表示法。由于L-P符号只有在已知有效的列生成方案时才有用,我们在LP对偶理论的基础上讨论了该方法的适用性。本文提出并比较了三种不同的方法,并评价了它们在解决实际规模的问题实例时的实用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Path Generation for a Class of Survivable Network Design Problems
In this paper we address link dimensioning and routing problems related to the area of resilient network design. We present two network design problems that assume different flow restoration schemes used to cope with network failures. In both cases we allow bifurcation of traffic flows in the normal (failure-less) network state. In the case of a failure, we assume that affected primary flows (i.e., flows applied in the normal state) are restored using assigned protection paths and that the primary flows are restored (also in a bifurcated manner) in a separate pool of (protection) capacity, distinct from the basic capacity used in the normal network operation state. The two presented models differ in the way protection paths are used to protect primary flows against different failure states. The first model, called state-independent flow restoration, assumes that once the backup path is assigned it must be used in every state in which the protected primary path fails. The second model allows different protection paths to be used in different network failure states and is called state-dependent flow restoration. The considered problems are formulated as linear programming (LP) problems using link-path (L-P) notation of multi-commodity flow network optimization. As the L-P notation is useful only when an effective column generation scheme is known, we discuss the applicability of this method on the basis of the theory of duality of LP. The paper presents and compares three different approaches and evaluates their usefulness for solving problem instances of practical size.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信