LCR solution for performance and cost-efficient inter-domain traffic distribution

M. Kantor, P. Chołda, A. Jajszczyk
{"title":"LCR solution for performance and cost-efficient inter-domain traffic distribution","authors":"M. Kantor, P. Chołda, A. Jajszczyk","doi":"10.1109/NETWKS.2010.5624939","DOIUrl":null,"url":null,"abstract":"In the highly connected Internet most of domains have more than one interconnection link to different providers. In such a multi-homed scenario destinations for inter-domain traffic may be reachable through multiple egress routers with different offered cost and path performance. In this paper, we address the problem of route selection in a multi-homed stub network to optimize transit costs and paths performance offered by operator to its customers. As the indicators of quality of service (QoS) related to interconnections and routes offered by interconnected partners we consider a length of AS-path (Autonomous System) and latency experienced on that path as measured by round-trip-time (RTT). We present some QoS optimization models together with heuristic algorithms to solve the problem. To evaluate the performance of the proposed optimization models a Least Cost Routing (LCR) solution supporting optimal routing decisions has been used. The results indicate that taking into account both cost and performance is crucial for assuring the satisfied level of service for end-users with optimized cost for the operator.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","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.5624939","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In the highly connected Internet most of domains have more than one interconnection link to different providers. In such a multi-homed scenario destinations for inter-domain traffic may be reachable through multiple egress routers with different offered cost and path performance. In this paper, we address the problem of route selection in a multi-homed stub network to optimize transit costs and paths performance offered by operator to its customers. As the indicators of quality of service (QoS) related to interconnections and routes offered by interconnected partners we consider a length of AS-path (Autonomous System) and latency experienced on that path as measured by round-trip-time (RTT). We present some QoS optimization models together with heuristic algorithms to solve the problem. To evaluate the performance of the proposed optimization models a Least Cost Routing (LCR) solution supporting optimal routing decisions has been used. The results indicate that taking into account both cost and performance is crucial for assuring the satisfied level of service for end-users with optimized cost for the operator.
LCR解决方案的性能和成本效益的跨域流量分配
在高度连接的互联网中,大多数域都有多个与不同提供商的互连链路。在这种多主场景中,域间流量的目的地可以通过具有不同提供的成本和路径性能的多个出口路由器到达。本文研究了多宿主存根网络中的路径选择问题,以优化运营商向客户提供的传输成本和路径性能。作为与互连和互连伙伴提供的路由相关的服务质量(QoS)指标,我们考虑As路径(自治系统)的长度和该路径上通过往返时间(RTT)测量的延迟。我们提出了一些QoS优化模型和启发式算法来解决这个问题。为了评估所提出的优化模型的性能,使用了支持最优路由决策的最小成本路由(LCR)解决方案。结果表明,考虑成本和性能对于确保最终用户满意的服务水平和优化运营商的成本至关重要。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信