160 likes | 285 Vues
This presentation by Adriana Szekeres from Vrije Universiteit Amsterdam explores AS-level multi-path routing as a solution to address disconnectivity issues during BGP convergence. With the number of Autonomous Systems (ASes) having nearly doubled since 2004, BGP faces significant scalability and stability challenges. The work focuses on analyzing recent AS-level multi-path routing methods and their potential benefits, including fault tolerance and scalability improvements. Experimental results using BGPsim highlight the impact of these methods on network performance and resilience.
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