生存性电信网络中有效利用带宽的算法

U.G. Joo, J.G. Kim, J. Ko
{"title":"生存性电信网络中有效利用带宽的算法","authors":"U.G. Joo, J.G. Kim, J. Ko","doi":"10.1109/ICCS.1994.474296","DOIUrl":null,"url":null,"abstract":"This paper suggests a line restoration (rerouting) algorithm based on the minimum cost path (rather than the k-shortest path) for protection possible link failures and also develops a spare capacity determination algorithm based on the k-shortest path for the restoration algorithm. The restoration algorithm can supplement telecommunication networks with dedicated facility restoration mechanisms, where some intelligent transmission devices such as broadband digital cross-connect systems (BDCSs) are involved. These algorithms, described by illustrative examples, can be utilized in a general network for efficient bandwidth utilization.<<ETX>>","PeriodicalId":158681,"journal":{"name":"Proceedings of ICCS '94","volume":"158 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Algorithms for efficient bandwidth utilization on survivable telecommunication networks\",\"authors\":\"U.G. Joo, J.G. Kim, J. Ko\",\"doi\":\"10.1109/ICCS.1994.474296\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper suggests a line restoration (rerouting) algorithm based on the minimum cost path (rather than the k-shortest path) for protection possible link failures and also develops a spare capacity determination algorithm based on the k-shortest path for the restoration algorithm. The restoration algorithm can supplement telecommunication networks with dedicated facility restoration mechanisms, where some intelligent transmission devices such as broadband digital cross-connect systems (BDCSs) are involved. These algorithms, described by illustrative examples, can be utilized in a general network for efficient bandwidth utilization.<<ETX>>\",\"PeriodicalId\":158681,\"journal\":{\"name\":\"Proceedings of ICCS '94\",\"volume\":\"158 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-11-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of ICCS '94\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCS.1994.474296\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of ICCS '94","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCS.1994.474296","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了一种基于最小代价路径(而不是k-最短路径)的线路恢复(重路由)算法来保护可能的链路故障,并开发了一种基于k-最短路径的备用容量确定算法。该恢复算法可以补充电信网络专用设施恢复机制,其中涉及一些智能传输设备,如宽带数字交叉连接系统(bdcs)。通过举例说明,这些算法可以在一般网络中有效地利用带宽。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Algorithms for efficient bandwidth utilization on survivable telecommunication networks
This paper suggests a line restoration (rerouting) algorithm based on the minimum cost path (rather than the k-shortest path) for protection possible link failures and also develops a spare capacity determination algorithm based on the k-shortest path for the restoration algorithm. The restoration algorithm can supplement telecommunication networks with dedicated facility restoration mechanisms, where some intelligent transmission devices such as broadband digital cross-connect systems (BDCSs) are involved. These algorithms, described by illustrative examples, can be utilized in a general network for efficient bandwidth utilization.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信