Understanding BGP next-hop diversity

Jaeyoung Choi, Jong Han Park, Pei-chun Cheng, D. Kim, Lixia Zhang
{"title":"Understanding BGP next-hop diversity","authors":"Jaeyoung Choi, Jong Han Park, Pei-chun Cheng, D. Kim, Lixia Zhang","doi":"10.1109/INFCOMW.2011.5928930","DOIUrl":null,"url":null,"abstract":"The Internet topological connectivity becomes denser over time. However the de facto routing protocol of the global Internet, BGP, lets each BGP router select and propagate only a single best path to each destination network. This leads to a common concern that the rich connectivity is not fully utilized and the lack of alternative paths can reduce a network's robustness to failures as well as flexibility in traffic engineering, and can lead to slow adaptation to topological changes. Yet there have been few quantitative measurement studies on path diversity in today's operational Internet. In this paper we use iBGP routing data collected from a Tier1 ISP, ISPA, over a 2-year time period to quantify BGP next-hop diversity for all destinations. Our results show that ISPA reaches the majority of prefixes through multiple next-hop routers. We use several case studies of prefixes with different diversity degrees to identify two major factors that impact the number of observed next-hops: the ISP's path preference and the number of peering routers between large ISPs. This observation provides operational input to the current efforts on augmenting BGP to increase path diversity.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOMW.2011.5928930","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19

Abstract

The Internet topological connectivity becomes denser over time. However the de facto routing protocol of the global Internet, BGP, lets each BGP router select and propagate only a single best path to each destination network. This leads to a common concern that the rich connectivity is not fully utilized and the lack of alternative paths can reduce a network's robustness to failures as well as flexibility in traffic engineering, and can lead to slow adaptation to topological changes. Yet there have been few quantitative measurement studies on path diversity in today's operational Internet. In this paper we use iBGP routing data collected from a Tier1 ISP, ISPA, over a 2-year time period to quantify BGP next-hop diversity for all destinations. Our results show that ISPA reaches the majority of prefixes through multiple next-hop routers. We use several case studies of prefixes with different diversity degrees to identify two major factors that impact the number of observed next-hops: the ISP's path preference and the number of peering routers between large ISPs. This observation provides operational input to the current efforts on augmenting BGP to increase path diversity.
了解BGP下一跳多样性
随着时间的推移,互联网拓扑连接变得更加密集。然而,全球互联网事实上的路由协议BGP允许每个BGP路由器选择并传播到每个目的网络的唯一最佳路径。这导致了一个普遍的担忧,即丰富的连通性没有得到充分利用,缺乏可选路径会降低网络对故障的鲁棒性和流量工程的灵活性,并可能导致对拓扑变化的适应缓慢。然而,在当今的互联网运营中,很少有关于路径多样性的定量测量研究。在本文中,我们使用从一级ISP ISPA收集的iBGP路由数据,超过2年的时间周期来量化所有目的地的BGP下一跳分集。结果表明,ISPA通过多个下一跳路由器到达大多数前缀。我们使用几个具有不同分集度的前缀的案例研究来确定影响观察到的下一跳数量的两个主要因素:ISP的路径偏好和大型ISP之间的对等路由器数量。这一观察结果为当前增加BGP以增加路径多样性的努力提供了操作输入。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信