Detail publikace

Reachability Analysis in Dynamically Routed Networks

ŠVÉDA, M. RYŠAVÝ, O. DE SILVA, G. MATOUŠEK, P. RÁB, J.

Originální název

Reachability Analysis in Dynamically Routed Networks

Typ

článek ve sborníku mimo WoS a Scopus

Jazyk

angličtina

Originální abstrakt

In this paper, we introduce a novel approach to reachability analysis of dynamically routed networks. The goal is to determine the network-wide reachability using static analysis of configuration files gathered from forwarding devices. We describe a method that can compute the reachability in networks with a mix of static routing configurations, distance vector routing protocols, filtering routing updates and redistributions. The method computes a network-wide approximation of distributed routing information using the standard graph algorithms. Thus, for any network state, we can determine a set of active paths used for packet delivery. The outcomes of the method can be, for instance, used during the conformance checking of distributed access control lists against network security policies.

Klíčová slova

IP-networks; network configuration; network design; network reachability; routing protocols

Autoři

ŠVÉDA, M.; RYŠAVÝ, O.; DE SILVA, G.; MATOUŠEK, P.; RÁB, J.

Rok RIV

2011

Vydáno

3. 5. 2011

Nakladatel

IEEE Computer Society

Místo

Piscataway, NJ

ISBN

978-0-7695-4379-6

Kniha

Proceedings of the IEEE ECBS 2011

Strany od

197

Strany do

205

Strany počet

9

URL

BibTex

@inproceedings{BUT76340,
  author="Miroslav {Švéda} and Ondřej {Ryšavý} and Hidda Marakkala Gayan Ruchika {de Silva} and Petr {Matoušek} and Jaroslav {Ráb}",
  title="Reachability Analysis in Dynamically Routed Networks",
  booktitle="Proceedings of the IEEE ECBS 2011",
  year="2011",
  pages="197--205",
  publisher="IEEE Computer Society",
  address="Piscataway, NJ",
  isbn="978-0-7695-4379-6",
  url="https://www.fit.vut.cz/research/publication/9606/"
}