Assigning AS relationships to satisfy the Gao-Rexford conditions

L. Cittadini, G. Battista, T. Erlebach, M. Patrignani, M. Rimondini
{"title":"Assigning AS relationships to satisfy the Gao-Rexford conditions","authors":"L. Cittadini, G. Battista, T. Erlebach, M. Patrignani, M. Rimondini","doi":"10.1109/ICNP.2010.5762760","DOIUrl":null,"url":null,"abstract":"Compliance with the Gao-Rexford conditions [1] is perhaps the most realistic explanation of Internet routing stability, although BGP is renowned to be prone to oscillations. Informally, the Gao-Rexford conditions assume that (i) the business relationships between Internet Service Providers (ISPs) yield a hierarchy, (ii) each ISP behaves in a rational way, i.e., it does not offer transit to other ISPs for free, and (iii) each ISP ranks routes through customers better than routes through providers and peers.","PeriodicalId":344208,"journal":{"name":"The 18th IEEE International Conference on Network Protocols","volume":"83 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 18th IEEE International Conference on Network Protocols","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNP.2010.5762760","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Compliance with the Gao-Rexford conditions [1] is perhaps the most realistic explanation of Internet routing stability, although BGP is renowned to be prone to oscillations. Informally, the Gao-Rexford conditions assume that (i) the business relationships between Internet Service Providers (ISPs) yield a hierarchy, (ii) each ISP behaves in a rational way, i.e., it does not offer transit to other ISPs for free, and (iii) each ISP ranks routes through customers better than routes through providers and peers.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
分配AS关系以满足Gao-Rexford条件
遵从Gao-Rexford条件[1]可能是对互联网路由稳定性最现实的解释,尽管众所周知BGP容易出现振荡。非正式地,Gao-Rexford条件假设(i)互联网服务提供商(ISP)之间的业务关系产生层次结构,(ii)每个ISP以合理的方式行事,即,它不向其他ISP免费提供传输,以及(iii)每个ISP通过客户排列路由比通过提供商和对等体排列路由更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An opportunistic relay protocol for vehicular road-side access with fading channels Passive interference measurement in Wireless Sensor Networks Routing in max-min fair networks: A game theoretic approach Authentication and authorization protocol security property analysis with trace inclusion transformation and online minimization TowerDefense: Deployment strategies for battling against IP prefix hijacking
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1