Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{1492173,
author = {Schmid, Stefan and Srba, Jiří},
address = {USA},
booktitle = {IEEE International Conference on Computer Communications (INFOCOM'18)},
doi = {http://dx.doi.org/10.1109/INFOCOM.2018.8486261},
keywords = {network verification; MPLS networks; pushdown automata},
howpublished = {elektronická verze "online"},
language = {eng},
location = {USA},
isbn = {978-1-5386-4128-6},
pages = {1799-1807},
publisher = {IEEE},
title = {Polynomial-Time What-If Analysis for Prefix-Manipulating MPLS Networks},
url = {https://ieeexplore.ieee.org/document/8486261},
year = {2018}
}
TY - JOUR
ID - 1492173
AU - Schmid, Stefan - Srba, Jiří
PY - 2018
TI - Polynomial-Time What-If Analysis for Prefix-Manipulating MPLS Networks
PB - IEEE
CY - USA
SN - 9781538641286
KW - network verification
KW - MPLS networks
KW - pushdown automata
UR - https://ieeexplore.ieee.org/document/8486261
N2 - 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.
ER -
SCHMID, Stefan a Jiří SRBA. Polynomial-Time What-If Analysis for Prefix-Manipulating MPLS Networks. Online. In \textit{IEEE International Conference on Computer Communications (INFOCOM'18)}. USA: IEEE, 2018, s.~1799-1807. ISBN~978-1-5386-4128-6. Dostupné z: https://dx.doi.org/10.1109/INFOCOM.2018.8486261.
|
