Beating BGP is Harder than we Thought

被引:15
作者
Arnold, Todd [1 ]
Calder, Matt [2 ]
Cunha, Italo [1 ,3 ]
Gupta, Arpit [1 ,4 ]
Madhyastha, Harsha, V [5 ]
Schapira, Michael [6 ]
Katz-Bassett, Ethan [1 ]
机构
[1] Columbia Univ, New York, NY 10027 USA
[2] Microsoft, Redmond, WA USA
[3] Univ Fed Minas Gerais, Belo Horizonte, MG, Brazil
[4] UC Santa Barbara, Santa Barbara, CA USA
[5] Univ Michigan, Ann Arbor, MI 48109 USA
[6] Hebrew Univ Jerusalem, Jerusalem, Israel
来源
PROCEEDINGS OF THE EIGHTEENTH ACM WORKSHOP ON HOT TOPICS IN NETWORKS (HOTNETS '19) | 2019年
关键词
BGP; performance; traffic engineering; content delivery;
D O I
10.1145/3365609.3365865
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Online services all seek to provide their customers with the best Quality of Experience (QoE) possible. Milliseconds of delay can cause users to abandon a cat video or move onto a different shopping site, which translates into lost revenue. Thus, minimizing latency between users and content is crucial. To reduce latency, content and cloud providers have built massive, global networks. However, their networks must interact with customer ISPs via BGP, which has no concept of performance. The shortcomings of BGP are many and well documented, but in this paper we ask the community to take a step back and rethink what we know about BGP. We examine three separate studies of performance using large content and cloud provider networks and find that performance-aware routing schemes rarely achieve lower latency than BGP. We lay out a map for research to further study the idea that beating BGP may be more difficult than previously thought.
引用
收藏
页码:9 / 16
页数:8
相关论文
共 30 条
[1]  
Akella Aditya, 2004, P 2004 C APPL TECHN
[2]  
[Anonymous], 2018, 15 USENIX S NETW SYS
[3]  
[Anonymous], 2019, Cloudlab
[4]  
[Anonymous], 2001, P 18 ACM S OP SYST P
[5]  
APNIC, 2019, VIS ASNS CUST POP ES
[6]  
Calder M., 2013, P IMC 2013
[7]  
Calder Matt, 2015, P ACM INT MEAS C IMC
[8]  
Calder Matt, 2019, P NETW TRAFF MEAS AN
[9]  
Chen Marcelo Torres Fangfei, 2015, P C ACM SPEC INT GRO
[10]  
Chiu Yi-Ching, 2015, P ACM INT MEAS C IMC