Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{1506128, author = {Jensen, Jesper S. and Kroegh, Troels B. and Madsen, Jonas S. and Schmid, Stefan and Srba, Jiří and Thorgersen, Marc T.}, address = {USA}, booktitle = {Proceedings of the 14th International Conference on emerging Networking EXperiments and Technologies (CoNEXT'18)}, doi = {http://dx.doi.org/10.1145/3281411.3281432}, keywords = {MPLS networks; formal verification; pushdown automata}, howpublished = {tištěná verze "print"}, language = {eng}, location = {USA}, isbn = {978-1-4503-6080-7}, pages = {217-227}, publisher = {ACM}, title = {P-Rex: Fast Verification of MPLS Networks with Multiple Link Failures}, url = {https://dl.acm.org/citation.cfm?id=3281432}, year = {2018} }
TY - JOUR ID - 1506128 AU - Jensen, Jesper S. - Kroegh, Troels B. - Madsen, Jonas S. - Schmid, Stefan - Srba, Jiří - Thorgersen, Marc T. PY - 2018 TI - P-Rex: Fast Verification of MPLS Networks with Multiple Link Failures PB - ACM CY - USA SN - 9781450360807 KW - MPLS networks KW - formal verification KW - pushdown automata UR - https://dl.acm.org/citation.cfm?id=3281432 L2 - https://dl.acm.org/citation.cfm?id=3281432 N2 - Future communication networks are expected to be highly automated, disburdening human operators of their most complex tasks. However, while first powerful and automated network analysis tools are emerging, existing tools provide very limited (and inefficient) support of reasoning about failure scenarios. We present P-Rex, a fast what-if analysis tool, that allows us to test important reachability and policy-compliance properties even under an arbitrary number of failures, in polynomial-time, i.e., without enumerating all failure scenarios (the usual approach today, if supported at all). P-Rex targets networks based on Multiprotocol Label Switching (MPLS) and its Segment Routing (SR) extension and comes with an expressive query language based on regular expressions. It takes into account the actual router tables, and is hence well-suited for debugging. We also report on an industrial case study and demonstrate that P-Rex supports rich queries, performing what-if analyses in less than 70 minutes in most cases, in a 24-router network with about 100,000 forwarding rules. ER -
JENSEN, Jesper S., Troels B. KROEGH, Jonas S. MADSEN, Stefan SCHMID, Jiří SRBA a Marc T. THORGERSEN. P-Rex: Fast Verification of MPLS Networks with Multiple Link Failures. In \textit{Proceedings of the 14th International Conference on emerging Networking EXperiments and Technologies (CoNEXT'18)}. USA: ACM, 2018, s.~217-227. ISBN~978-1-4503-6080-7. Dostupné z: https://dx.doi.org/10.1145/3281411.3281432.
|