DeepMPLS: fast analysis of MPLS configurations using deep learning
暂无分享,去创建一个
[1] Laurent Vanbever,et al. Network-Wide Configuration Synthesis , 2016, CAV.
[2] Brighten Godfrey,et al. Debugging the data plane with anteater , 2011, SIGCOMM.
[3] Georg Carle,et al. Learning and Generating Distributed Routing Protocols Using Graph-Based Deep Learning , 2018, Big-DAMA@SIGCOMM.
[4] Razvan Pascanu,et al. Relational inductive biases, deep learning, and graph networks , 2018, ArXiv.
[5] Stefan Schmid,et al. P-Rex: fast verification of MPLS networks with multiple link failures , 2018, CoNEXT.
[6] Fabien Geyer,et al. Performance Evaluation of Network Topologies using Graph-Based Deep Learning , 2017, VALUETOOLS.
[7] Benoit Donnet,et al. MPLS Under the Microscope: Revealing Actual Transit Path Diversity , 2015, Internet Measurement Conference.
[8] Matthew Roughan,et al. The Internet Topology Zoo , 2011, IEEE Journal on Selected Areas in Communications.
[9] Stefan Schmid,et al. Polynomial-Time What-If Analysis for Prefix-Manipulating MPLS Networks , 2018, IEEE INFOCOM 2018 - IEEE Conference on Computer Communications.
[10] Thomas E. Anderson,et al. One tunnel is (often) enough , 2014, SIGCOMM.
[11] Ratul Mahajan,et al. A General Approach to Network Configuration Verification , 2017, SIGCOMM.
[12] George Varghese,et al. Header Space Analysis: Static Checking for Networks , 2012, NSDI.
[13] Limin Jia,et al. FSR: Formal Analysis and Implementation Toolkit for Safe Interdomain Routing , 2011, IEEE/ACM Transactions on Networking.
[14] Ratul Mahajan,et al. Network configuration synthesis with abstract topologies , 2017, PLDI.
[15] Pietro Liò,et al. Graph Attention Networks , 2017, ICLR.
[16] Krzysztof Rusek,et al. Message-Passing Neural Networks Learn Little’s Law , 2019, IEEE Communications Letters.
[17] Nate Foster,et al. NetKAT: semantic foundations for networks , 2014, POPL.
[18] Samuel S. Schoenholz,et al. Neural Message Passing for Quantum Chemistry , 2017, ICML.
[19] Fabien Geyer,et al. DeepTMA: Predicting Effective Contention Models for Network Calculus using Graph Neural Networks , 2019, IEEE INFOCOM 2019 - IEEE Conference on Computer Communications.
[20] Richard S. Zemel,et al. Gated Graph Sequence Neural Networks , 2015, ICLR.
[21] Ratul Mahajan,et al. Don't Mind the Gap: Bridging Network-wide Objectives and Device-level Configurations , 2016, SIGCOMM.
[22] F. Scarselli,et al. A new model for learning in graph domains , 2005, Proceedings. 2005 IEEE International Joint Conference on Neural Networks, 2005..
[23] George Varghese,et al. Efficient Network Reachability Analysis Using a Succinct Control Plane Representation , 2016, OSDI.
[24] David L. Dill,et al. Learning a SAT Solver from Single-Bit Supervision , 2018, ICLR.
[25] Junda Liu,et al. Libra: Divide and Conquer to Verify Forwarding Tables in Huge Networks , 2014, NSDI.
[26] Alán Aspuru-Guzik,et al. Convolutional Networks on Graphs for Learning Molecular Fingerprints , 2015, NIPS.
[27] Robert McNaughton,et al. Regular Expressions and State Graphs for Automata , 1960, IRE Trans. Electron. Comput..
[28] Ah Chung Tsoi,et al. The Graph Neural Network Model , 2009, IEEE Transactions on Neural Networks.
[29] Brighten Godfrey,et al. VeriFlow: verifying network-wide invariants in real time , 2012, HotSDN '12.
[30] Alexandra Silva,et al. A Coalgebraic Decision Procedure for NetKAT , 2015, POPL.
[31] Georg Carle,et al. The Case for a Network Calculus Heuristic: Using Insights from Data for Tighter Bounds , 2018, 2018 30th International Teletraffic Congress (ITC 30).
[32] Yoshua Bengio,et al. Learning Phrase Representations using RNN Encoder–Decoder for Statistical Machine Translation , 2014, EMNLP.
[33] Laurent Vanbever,et al. NetComplete: Practical Network-Wide Configuration Synthesis with Autocompletion , 2018, NSDI.
[34] Kyunghyun Cho,et al. Neural Message Passing for Jet Physics , 2017 .