1-1-2011 FSR : Formal Analysis and Implementation Toolkit for Safe Inter-domain Routing

Inter-domain routing stitches the disparate parts of the Internet together, making protocol stability a critical issue to both researchers and practitioners. Yet, researchers create safety proofs and counter-examples by hand, and build simulators and prototypes to explore protocol dynamics. Similarly, network operators analyze their router configurations manually, or using home-grown tools. In this paper, we present a comprehensive toolkit for analyzing and implementing routing policies, ranging from high-level guidelines to specific router configurations. Our Formally Safe Routing (FSR) toolkit performs all of these functions from the same algebraic representation of routing policy. We show that routing algebra has a natural translation to both integer constraints (to perform safety analysis with SMT solvers) and declarative programs (to generate distributed implementations). Our extensive experiments with realistic topologies and policies show how FSR can detect problems in an AS's iBGP configuration, prove sufficient conditions for BGP safety, and empirically evaluate convergence time. Comments University of Pennsylvania Department of Computer and Information Science Technical Report No. MSCIS-11-10. Author(s) Anduo Wang, Limin Jia, Wenchao Zhou, Yiqing Ren, Boon Thau Loo, Jennifer Rexford, Vivek Nigam, Andre Scedrov, and Carolyn Talcott This technical report is available at ScholarlyCommons: http://repository.upenn.edu/cis_reports/954

[1]  Limin Jia,et al.  Maintaining distributed logic programs incrementally , 2011, Comput. Lang. Syst. Struct..

[2]  Jennifer Rexford,et al.  Putting BGP on the right path: a case for next-hop routing , 2010, Hotnets-IX.

[3]  Alexander J. T. Gurney,et al.  Neighbor-specific BGP: An algebraic exploration , 2010, The 18th IEEE International Conference on Network Protocols.

[4]  Joseph M. Hellerstein,et al.  Boom analytics: exploring data-centric, declarative programming for the cloud , 2010, EuroSys '10.

[5]  Timothy G. Griffin,et al.  The stratified shortest-paths problem , 2010, COMSNETS 2010.

[6]  Xiaozhou Li,et al.  Declarative policy-based adaptive MANET routing , 2009, 2009 17th IEEE International Conference on Network Protocols.

[7]  Ion Stoica,et al.  Declarative networking , 2009, Commun. ACM.

[8]  Timothy G. Griffin,et al.  A model of configuration languages for routing protocols , 2009, PRESTO '09.

[9]  Matthew Roughan,et al.  Stable and flexible iBGP , 2009, SIGCOMM '09.

[10]  Yi Wang,et al.  Neighbor-specific BGP: more flexible routing policies while improving global stability , 2009, SIGMETRICS '09.

[11]  Andreas Haeberlen,et al.  NetReview: Detecting When Interdomain Routing Goes Wrong , 2009, NSDI.

[12]  Michael Schapira,et al.  Searching for Stability in Interdomain Routing , 2009, IEEE INFOCOM 2009.

[13]  Boon Thau Loo,et al.  Recursive Computation of Regions and Connectivity in Networks , 2009, 2009 IEEE 25th International Conference on Data Engineering.

[14]  Prithwish Basu,et al.  Declarative Network Verification , 2009, PADL.

[15]  Atul Singh,et al.  BFT Protocols Under Fire , 2008, NSDI.

[16]  Philip Levis,et al.  The design and implementation of a declarative sensor network system , 2007, SenSys '07.

[17]  Dmitri V. Krioukov,et al.  AS relationships: inference and validation , 2006, CCRV.

[18]  Ion Stoica,et al.  Implementing declarative overlays , 2005, SOSP '05.

[19]  João L. Sobrinho,et al.  An algebraic theory of dynamic network routing , 2005, IEEE/ACM Transactions on Networking.

[20]  Nick Feamster,et al.  Implications of Autonomy for the Expressiveness of Policy Routing , 2005, IEEE/ACM Transactions on Networking.

[21]  Mark Handley,et al.  HLP: a next generation inter-domain routing protocol , 2005, SIGCOMM '05.

[22]  Ion Stoica,et al.  Declarative routing: extensible routing with declarative queries , 2005, SIGCOMM '05.

[23]  Nick Feamster,et al.  Detecting BGP configuration faults with static analysis , 2005 .

[24]  Vijay Ramachandran,et al.  Relating two formal models of path-vector routing , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[25]  Anja Feldmann,et al.  Locating internet routing instabilities , 2004, SIGCOMM '04.

[26]  Vijay Ramachandran,et al.  Design principles of policy languages for path vector protocols , 2003, SIGCOMM '03.

[27]  Gordon T. Wilfong,et al.  The stable paths problem and interdomain routing , 2002, TNET.

[28]  Lixin Gao,et al.  Stable Internet routing without global coordination , 2000, SIGMETRICS '00.

[29]  Gordon T. Wilfong,et al.  A safe path vector protocol , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[30]  Eddie Kohler,et al.  The Click modular router , 1999, SOSP.

[31]  Gordon T. Wilfong,et al.  An analysis of BGP convergence properties , 1999, SIGCOMM '99.

[32]  Boon Thau Loo,et al.  Declarative Toolkit for Rapid Network Protocol Simulation and Experimentation , 2009 .

[33]  Jonathan M. Smith,et al.  MOSAIC: Unified Platform for Dynamic Overlay Selection and Composition , 2008 .

[34]  Ratul Mahajan,et al.  Measuring ISP topologies with Rocketfuel , 2004, IEEE/ACM Transactions on Networking.

[35]  Jennifer Rexford,et al.  Inherently safe backup routing with BGP , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).