160 likes | 271 Vues
This presentation by Adriana Szekeres at Vrije Universiteit Amsterdam explores AS-level multi-path routing as a vital enhancement to BGP. The motivation centers on the significant increase in Autonomous Systems (ASes) since 2004, leading to scalability and stability challenges within BGP. The study investigates the viability of proposed multi-path routing methods, specifically Resilient BGP and Multi-Process BGP, through thorough experiments and simulations. Preliminary results involve assessing fault tolerance and scalability impacts using advanced simulation tools, setting the stage for further analysis and future research directions.
E N D
AS-level Multi-Path Routing Presenter: Adriana Szekeres Vrije Universiteit Amsterdam/NLnet Labs
Contents • Introduction to AS-level multi-path routing • Motivation of our work • Our work • Short presentation • The experiments we conduct • Preliminary results
Introduction Problem: Disconnectivity during BGP’s convergence
Introduction • AS-level Multi-Path Routing idea: • supply multiple paths • find the most disjoint paths from the one currently used (to cover a wide area of failures). AS-level Multi-Path Routing: nice to have, but it may come at some costs.
Motivation • Number of ASes – almost doubled from 2004 • BGP faces scalability and stability problems
Motivation • Number of ASes – almost doubled from 2004 • BGP faces scalability and stability problems • Reticence to new BGP enhancements
Motivation • Number of ASes – almost doubled from 2004 • BGP faces scalability and stability problems • Reticence to new BGP enhancements Every new BGP addition should be carefully studied and tested
Our work • Study the promises of the recently proposed AS-level multi-path routing methods (2009) • Resilient_BGP • each AS advertise a fail-over path to the AS through which it is routing • Multi-Process_BGP • run multiple BGP instances that advertise disjoint paths
Experiments • Show: • impact on BGP’s scalability • the degree of fault tolerance • BGPsim simulator • can simulate more than 30.000 ASes • ran on DAS-4 cluster; using 33 nodes; 8 cores/node • CAIDA topologies from 2005 to 2010
Preliminary results 2005 maximum node disjointness
Preliminary results 2009 maximum node disjointness
Conclusion • Importance: • BGP protocol designers and network operators: • impact on scalability • efficiency • Future work • further analyze the routing tables • more methods