在MPLS快速路由中,优化了基于ip和显式的一对一备份路径

M. Pióro, A. Tomaszewski, C. Zukowski, D. Hock, Matthias Hartmann, M. Menth
{"title":"在MPLS快速路由中,优化了基于ip和显式的一对一备份路径","authors":"M. Pióro, A. Tomaszewski, C. Zukowski, D. Hock, Matthias Hartmann, M. Menth","doi":"10.1109/NETWKS.2010.5624923","DOIUrl":null,"url":null,"abstract":"Primary and backup paths in MPLS fast reroute (FRR) may be established as shortest paths according to the administrative link costs of the IP control plane, or as explicitly calculated arbitrary paths. In both cases, the path layout can be optimized so that the maximum link utilization for a set of considered failure scenarios is minimized. In this paper, we propose a linear program for the optimization of the path layout for explicitly calculated paths, which can either produce single paths and route entire traffic along those paths, or generate multiple paths and spread the traffic among those paths providing load balancing. We compare the resulting lowest maximum link utilization in both cases with the lowest maximum link utilization that can be obtained by optimizing unique IP-based paths. Our results quantify the gain in resource efficiency usage provided by optimized explicit multiple paths or explicit single paths as compared to optimized IP-based paths.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"Optimized IP-based vs. explicit paths for one-to-one backup in MPLS fast reroute\",\"authors\":\"M. Pióro, A. Tomaszewski, C. Zukowski, D. Hock, Matthias Hartmann, M. Menth\",\"doi\":\"10.1109/NETWKS.2010.5624923\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Primary and backup paths in MPLS fast reroute (FRR) may be established as shortest paths according to the administrative link costs of the IP control plane, or as explicitly calculated arbitrary paths. In both cases, the path layout can be optimized so that the maximum link utilization for a set of considered failure scenarios is minimized. In this paper, we propose a linear program for the optimization of the path layout for explicitly calculated paths, which can either produce single paths and route entire traffic along those paths, or generate multiple paths and spread the traffic among those paths providing load balancing. We compare the resulting lowest maximum link utilization in both cases with the lowest maximum link utilization that can be obtained by optimizing unique IP-based paths. Our results quantify the gain in resource efficiency usage provided by optimized explicit multiple paths or explicit single paths as compared to optimized IP-based paths.\",\"PeriodicalId\":202408,\"journal\":{\"name\":\"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NETWKS.2010.5624923\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NETWKS.2010.5624923","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17

摘要

MPLS FRR (fast reroute)中的主备路径可以根据IP控制平面的管理链路开销建立最短路径,也可以明确计算任意路径。在这两种情况下,都可以优化路径布局,以便最小化一组考虑的故障场景的最大链路利用率。本文提出了一种针对显式计算路径的路径布局优化的线性规划,它可以产生单个路径并沿着这些路径路由整个流量,也可以产生多个路径并在这些路径之间分散流量并提供负载均衡。我们比较了两种情况下产生的最低最大链路利用率与通过优化唯一基于ip的路径可以获得的最低最大链路利用率。我们的结果量化了与优化的基于ip的路径相比,优化的显式多路径或显式单路径所提供的资源效率使用增益。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimized IP-based vs. explicit paths for one-to-one backup in MPLS fast reroute
Primary and backup paths in MPLS fast reroute (FRR) may be established as shortest paths according to the administrative link costs of the IP control plane, or as explicitly calculated arbitrary paths. In both cases, the path layout can be optimized so that the maximum link utilization for a set of considered failure scenarios is minimized. In this paper, we propose a linear program for the optimization of the path layout for explicitly calculated paths, which can either produce single paths and route entire traffic along those paths, or generate multiple paths and spread the traffic among those paths providing load balancing. We compare the resulting lowest maximum link utilization in both cases with the lowest maximum link utilization that can be obtained by optimizing unique IP-based paths. Our results quantify the gain in resource efficiency usage provided by optimized explicit multiple paths or explicit single paths as compared to optimized IP-based paths.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信