Publication detail

Reachability Analysis in Dynamically Routed Networks

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

Original Title

Reachability Analysis in Dynamically Routed Networks

Type

article in a collection out of WoS and Scopus

Language

English

Original Abstract

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.

Keywords

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

Authors

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

RIV year

2011

Released

3. 5. 2011

Publisher

IEEE Computer Society

Location

Piscataway, NJ

ISBN

978-0-7695-4379-6

Book

Proceedings of the IEEE ECBS 2011

Pages from

197

Pages to

205

Pages count

9

URL

https://www.fit.vut.cz/research/publication/9606/

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/"
}