多层网络中的备用容量分配

Yu Liu, D. Tipper, K. Vajanapoom
{"title":"多层网络中的备用容量分配","authors":"Yu Liu, D. Tipper, K. Vajanapoom","doi":"10.1109/DRCN.2005.1563876","DOIUrl":null,"url":null,"abstract":"In this paper, we consider the problem of provisioning spare capacity in multi-layer backbone networks in order to meet survivability requirements. A matrix based model is presented showing how failure propagation can be mapped across network layers. Two different multilayer spare capacity allocation optimization problems are formulated utilizing the failure propagation matrix to determine the location and amount of spare capacity in each network layer. In order to scale the models a fast and efficient approximation algorithm based on our early successive survivable routing (SSR) technique is developed. Numerical results for a variety of networks show that near optimal solutions are found by the proposed heuristic algorithm.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Spare capacity allocation in multi-layer networks\",\"authors\":\"Yu Liu, D. Tipper, K. Vajanapoom\",\"doi\":\"10.1109/DRCN.2005.1563876\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we consider the problem of provisioning spare capacity in multi-layer backbone networks in order to meet survivability requirements. A matrix based model is presented showing how failure propagation can be mapped across network layers. Two different multilayer spare capacity allocation optimization problems are formulated utilizing the failure propagation matrix to determine the location and amount of spare capacity in each network layer. In order to scale the models a fast and efficient approximation algorithm based on our early successive survivable routing (SSR) technique is developed. Numerical results for a variety of networks show that near optimal solutions are found by the proposed heuristic algorithm.\",\"PeriodicalId\":415896,\"journal\":{\"name\":\"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-12-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DRCN.2005.1563876\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DRCN.2005.1563876","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

为了满足生存性要求,本文研究了多层骨干网的备用容量分配问题。提出了一个基于矩阵的模型,展示了如何跨网络层映射故障传播。利用故障传播矩阵,提出了两种不同的多层备用容量分配优化问题,以确定各网络层中备用容量的位置和数量。为了扩大模型的规模,提出了一种基于早期连续生存路由(SSR)技术的快速有效的逼近算法。对各种网络的数值计算结果表明,所提出的启发式算法能找到近似最优解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Spare capacity allocation in multi-layer networks
In this paper, we consider the problem of provisioning spare capacity in multi-layer backbone networks in order to meet survivability requirements. A matrix based model is presented showing how failure propagation can be mapped across network layers. Two different multilayer spare capacity allocation optimization problems are formulated utilizing the failure propagation matrix to determine the location and amount of spare capacity in each network layer. In order to scale the models a fast and efficient approximation algorithm based on our early successive survivable routing (SSR) technique is developed. Numerical results for a variety of networks show that near optimal solutions are found by the proposed heuristic algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信