.png){kind=icon}
返回
Efficient computation of loop-free alternates
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jnca.2019.102501.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Network failures may lead to serious packet loss and degrade network performance. Therefore, loop-free alternates (LFA) have been widely deployed by many Internet service providers to cope with single network component failure in large Internet backbones. However, the efficiency of LFA has not been sufficiently studied. Some existing methods have extremely large computational overhead, and their computational complexity is linear with the average node degree of the network. The current methods consume a large amount of central processing unit resources, thereby aggravating the burden on the router. To improve the routing resilience without introducing significant extra overhead, this study proposes an incremental alternate computation with negative augmentation algorithm (IAC), which is based on incremental shortest path first algorithm. First, IAC turns the problem of quick implementation of LFA into efficiently calculating the minimum cost of all its neighbors to all other network nodes on the shortest path tree rooted at the computing node. Then, several theorems for calculating the cost are presented and their correctness is validated. Finally, we evaluate IAC through simulations with real-world and generated topologies. Compared with TBFH, DMPA, and DMPA-e, which are algorithms optimized for limited scenarios, IAC finds approximately 50% more available alternates, is more than three times faster, and provides node protection capabilities that TBFH, DMPA, and DMPA-e cannot provide. These advantages make IAC a good candidate for traditional telecommunication networks and emerging complex networks that require failure repair and load balancing in a highly dynamic environment.
Keyword:
Loop-free alternates
Fast reroute
Multipath routing
Network availability
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8
论文数:
3.7K
被引数:
1.1W
机构
查看更多机构
引用论文
Asymmetric Total Synthesis of Pseudoplexaurol and 14-Deoxycrassin, two Antitumor Marine Cembrane Diterpenoids.png)
Synlett
SynlettIF0
PREAI
分享收藏
Deep Learning‐Based Ensembling Technique to Classify Alzheimer’s Disease Stages Using Functional MRI
OAAI
OAAI分享收藏 没有更多内容