Informace o publikaci

Polynomial-Time What-If Analysis for Prefix-Manipulating MPLS Networks

Autoři

SCHMID Stefan SRBA Jiří

Rok publikování 2018
Druh Článek ve sborníku
Konference IEEE International Conference on Computer Communications (INFOCOM'18)
Fakulta / Pracoviště MU

Fakulta informatiky

Citace
www https://ieeexplore.ieee.org/document/8486261
Doi http://dx.doi.org/10.1109/INFOCOM.2018.8486261
Klíčová slova network verification; MPLS networks; pushdown automata
Popis While automated network verification is emerging as a critical enabler to manage large complex networks, current approaches come with a high computational complexity. This paper initiates the study of communication networks whose configurations can be verified fast, namely in polynomial time. In particular, we show that in communication networks based on prefix rewriting, which include MPLS networks, important network properties such as reachability, loop-freedom, and transparency, can be verified efficiently, even in the presence of failures. This enables a fast what-if analysis, addressing a major concern of network administrators: while configuring and testing network policies for a fully functional network is challenging, ensuring policy compliance in the face of (possibly multiple) failures, is almost impossible for human administrators. At the heart of our approach lies an interesting connection to the theory of prefix rewriting systems, a subfield of language and automata theory.