链路和节点故障时网络恢复的路由方案

I. Takouna, R. Rojas-Cessa
{"title":"链路和节点故障时网络恢复的路由方案","authors":"I. Takouna, R. Rojas-Cessa","doi":"10.1109/HSPR.2008.4734423","DOIUrl":null,"url":null,"abstract":"Routing schemes combined with link-state detection mechanisms can be used to recover connection paths or network connectivity under the cases of link and node failures. Some schemes have large computation and state-update overhead as re-routing is performed throughout the network. Moreover, as soon as new routes are found, some link may become congested with flows under recovery. This congestion may add extra recovery delays and even further link or node failures. In this paper, we propose proactive routing recovery schemes that perform rerouting on links affected by the failure, therefore, minimizing the computation overhead. Congestion avoidance is also achieved in these schemes by calculating the distribution of re-routed traffic in a proactive fashion. We compare our proposed schemes with the open shortest path first (OSPF) scheme and show that our schemes can provide higher utilization of links and nodes for large networks in post-recovery. We show simulation results under link and node failures.","PeriodicalId":130484,"journal":{"name":"2008 International Conference on High Performance Switching and Routing","volume":"878 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Routing schemes for network recovery under link and node failures\",\"authors\":\"I. Takouna, R. Rojas-Cessa\",\"doi\":\"10.1109/HSPR.2008.4734423\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Routing schemes combined with link-state detection mechanisms can be used to recover connection paths or network connectivity under the cases of link and node failures. Some schemes have large computation and state-update overhead as re-routing is performed throughout the network. Moreover, as soon as new routes are found, some link may become congested with flows under recovery. This congestion may add extra recovery delays and even further link or node failures. In this paper, we propose proactive routing recovery schemes that perform rerouting on links affected by the failure, therefore, minimizing the computation overhead. Congestion avoidance is also achieved in these schemes by calculating the distribution of re-routed traffic in a proactive fashion. We compare our proposed schemes with the open shortest path first (OSPF) scheme and show that our schemes can provide higher utilization of links and nodes for large networks in post-recovery. We show simulation results under link and node failures.\",\"PeriodicalId\":130484,\"journal\":{\"name\":\"2008 International Conference on High Performance Switching and Routing\",\"volume\":\"878 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-05-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Conference on High Performance Switching and Routing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HSPR.2008.4734423\",\"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 International Conference on High Performance Switching and Routing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HSPR.2008.4734423","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

结合链路状态检测机制的路由方案可以在链路和节点故障的情况下恢复连接路径或网络连通性。当在整个网络中执行重路由时,一些方案有大量的计算和状态更新开销。此外,一旦发现新的路线,一些环节可能会因流量恢复而变得拥挤。这种拥塞可能会增加额外的恢复延迟,甚至进一步的链路或节点故障。在本文中,我们提出主动路由恢复方案,在受故障影响的链路上执行重路由,从而最大限度地减少计算开销。在这些方案中,通过以主动方式计算重路由流量的分布,也实现了拥塞避免。我们将所提出的方案与开放最短路径优先(OSPF)方案进行了比较,结果表明所提出的方案能够为大型网络在恢复后提供更高的链路和节点利用率。我们展示了链路和节点故障下的仿真结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Routing schemes for network recovery under link and node failures
Routing schemes combined with link-state detection mechanisms can be used to recover connection paths or network connectivity under the cases of link and node failures. Some schemes have large computation and state-update overhead as re-routing is performed throughout the network. Moreover, as soon as new routes are found, some link may become congested with flows under recovery. This congestion may add extra recovery delays and even further link or node failures. In this paper, we propose proactive routing recovery schemes that perform rerouting on links affected by the failure, therefore, minimizing the computation overhead. Congestion avoidance is also achieved in these schemes by calculating the distribution of re-routed traffic in a proactive fashion. We compare our proposed schemes with the open shortest path first (OSPF) scheme and show that our schemes can provide higher utilization of links and nodes for large networks in post-recovery. We show simulation results under link and node failures.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信