Fast BGP Simulation of Large Datacenters
暂无分享,去创建一个
[1] George Varghese,et al. Efficient Network Reachability Analysis Using a Succinct Control Plane Representation , 2016, OSDI.
[2] Ruzica Piskac,et al. Automated repair by example for firewalls , 2017, Formal Methods in System Design.
[3] Michael D. Ernst,et al. Scalable verification of border gateway protocol configurations with an SMT solver , 2016, OOPSLA.
[4] Rupak Majumdar,et al. Kuai: A model checker for software-defined networks , 2014, 2014 Formal Methods in Computer-Aided Design (FMCAD).
[5] Gordon T. Wilfong,et al. Policy disputes in path-vector protocols , 1999, Proceedings. Seventh International Conference on Network Protocols.
[6] Amin Vahdat,et al. A scalable, commodity data center network architecture , 2008, SIGCOMM '08.
[7] Lixin Gao,et al. Stable Internet routing without global coordination , 2000, SIGMETRICS '00.
[8] George Varghese,et al. ddNF: An Efficient Data Structure for Header Spaces , 2016, Haifa Verification Conference.
[9] Sharad Malik,et al. Verification and synthesis of firewalls using SAT and QBF , 2012, 2012 20th IEEE International Conference on Network Protocols (ICNP).
[10] Michael Schapira,et al. VeriCon: towards verifying controller programs in software-defined networks , 2014, PLDI.
[11] George Varghese,et al. Scaling network verification using symmetry and surgery , 2016, POPL.
[12] Lingyu Wang,et al. TenantGuard: Scalable Runtime Verification of Cloud-Wide VM-Level Network Isolation , 2017, NDSS.
[13] Jon Mitchell,et al. Use of BGP for Routing in Large-Scale Data Centers , 2016, RFC.
[14] Ehab Al-Shaer,et al. FlowChecker: configuration analysis and verification of federated openflow infrastructures , 2010, SafeConfig '10.
[15] J. Rexford,et al. Network-Wide Prediction of BGP Routes , 2007, IEEE/ACM Transactions on Networking.
[16] Ramesh Govindan,et al. A General Approach to Network Configuration Analysis , 2015, NSDI.
[17] George Varghese,et al. Header Space Analysis: Static Checking for Networks , 2012, NSDI.
[18] João L. Sobrinho. Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet , 2002, TNET.
[19] Sharad Malik,et al. Verification of Computer Switching Networks: An Overview , 2012, ATVA.
[20] Katerina J. Argyraki,et al. Software dataplane verification , 2014, NSDI.
[21] George Varghese,et al. Checking Beliefs in Dynamic Networks , 2015, NSDI.
[22] Albert G. Greenberg,et al. VL2: a scalable and flexible data center network , 2009, SIGCOMM '09.
[23] Letizia Tanca,et al. What you Always Wanted to Know About Datalog (And Never Dared to Ask) , 1989, IEEE Trans. Knowl. Data Eng..
[24] Ratul Mahajan,et al. A General Approach to Network Configuration Verification , 2017, SIGCOMM.
[25] Loris D'Antoni,et al. Genesis: synthesizing forwarding tables in multi-tenant networks , 2017, POPL.
[26] Nate Foster,et al. NetKAT: semantic foundations for networks , 2014, POPL.
[27] George Varghese,et al. Usenix Association 10th Usenix Symposium on Networked Systems Design and Implementation (nsdi '13) 99 Real Time Network Policy Checking Using Header Space Analysis , 2022 .
[28] Nikolaj Bjørner,et al. Checking Cloud Contracts in Microsoft Azure , 2015, ICDCIT.
[29] Flaminia L. Luccio,et al. Mignis: A Semantic Based Tool for Firewall Configuration , 2014, 2014 IEEE 27th Computer Security Foundations Symposium.
[30] Hongkun Yang,et al. Real-time verification of network properties using Atomic Predicates , 2013, 2013 21st IEEE International Conference on Network Protocols (ICNP).
[31] Timothy G. Griffin,et al. On the forwarding paths produced by Internet routing algorithms , 2013, 2013 21st IEEE International Conference on Network Protocols (ICNP).
[32] Laurent Vanbever,et al. SDNRacer: concurrency analysis for software-defined networks , 2016, PLDI.
[33] Gordon T. Wilfong,et al. The stable paths problem and interdomain routing , 2002, TNET.
[34] Ratul Mahajan,et al. Network configuration synthesis with abstract topologies , 2017, PLDI.
[35] Nick Feamster,et al. Detecting BGP configuration faults with static analysis , 2005 .
[36] Timothy G. Griffin,et al. On the interaction of multiple routing algorithms , 2011, CoNEXT '11.
[37] Samuel T. King,et al. Debugging the data plane with anteater , 2011, SIGCOMM 2011.
[38] Brighten Godfrey,et al. VeriFlow: verifying network-wide invariants in real time , 2012, HotSDN '12.
[39] Albert G. Greenberg,et al. On static reachability analysis of IP networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..
[40] Sharad Malik,et al. SAT Based Verification of Network Data Planes , 2013, ATVA.
[41] Ratul Mahajan,et al. Don't Mind the Gap: Bridging Network-wide Objectives and Device-level Configurations , 2016, SIGCOMM.
[42] Steve Uhlig,et al. Modeling the routing of an autonomous system with C-BGP , 2005, IEEE Network.
[43] Thomas Lengauer,et al. Efficient Algorithms for Path Problems with Gernal Cost Citeria , 1991, ICALP.
[44] Jitendra Padhye,et al. CrystalNet: Faithfully Emulating Large Production Networks , 2017, SOSP.
[45] João L. Sobrinho,et al. An algebraic theory of dynamic network routing , 2005, IEEE/ACM Transactions on Networking.
[46] Ratul Mahajan,et al. Fast Control Plane Analysis Using an Abstract Representation , 2016, SIGCOMM.