谷歌浏览器插件
订阅小程序
在清言上使用

Fault tolerant and load balanced routing

user-5da93e5d530c70bec9508e2b(2020)

引用 0|浏览84
暂无评分
摘要
Techniques are described for balancing traffic load for networks configured in multi-rooted tree topologies, in the presence of link failures. Maximum flows (through minimum cuts) are calculated for subgraphs that incorporate effective link capacities on links between source and destination nodes. Effective link capacities may be determined that take into account link failures, as well as sharing of current available link capacities by multiple nodes. Traffic is balanced while simultaneously fully utilizing available link capacities, even available link capacities on partially failed links (e.g., partially failed Link Aggregation Groups (LAGs)).
更多
查看译文
关键词
Link aggregation,Network topology,Fault tolerance,Tree (data structure),Link (knot theory),Computer network,Distributed computing,Mathematics,Load balanced routing,Traffic load
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要