Feedback based routing

被引:30
作者
Zhu, DP [1 ]
Gritter, M [1 ]
Cheriton, DR [1 ]
机构
[1] Stanford Univ, Dept Comp Sci, Stanford, CA 94305 USA
关键词
D O I
10.1145/774763.774774
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we describe the problems that affect availability in BGP, such as vulnerability to attacks, slow convergence time, and lack of scalability. These problems arise from the basic assumption of BGP: every router has to cooperate to make routing work. We propose a new routing system, feedback based routing, which bifurcates structural information and dynamic information. Only structural information is propagated. Dynamic information is discovered by the routers based on feedback and probes. Routing decisions are made based on the dynamic information. We argue that this system is resilient to minority compromises in the infrastructure, provides higher availability than BGP, and can scale to the size of the Internet of the future.
引用
收藏
页码:71 / 76
页数:6
相关论文
共 19 条
[1]  
ANDERSEN D, 2001, P ACM SOSP OCT
[2]  
[Anonymous], U OREGON ROUTE VIEWS
[3]  
[Anonymous], 1981, STD
[4]  
[Anonymous], 2001, 3221 RFC
[5]  
BARRETT R, 1997, INTERACTIVE WEE 0425
[6]  
Cheriton D.R., 2000, TRIAD NEW NEXT GENER
[7]  
COLLINS A, 1998, DETOUR FRAMEWORK PAC
[8]  
Cowie J., 2001, Global routing instabilities during Code Red II and Nimda worm propagation
[9]  
Houle Kevin J., 2001, Trends in denial of service attack technology
[10]  
KENT S, 2000, SECURE BORDER GATEWA