Detail publikace

Reachability Analysis in Dynamically Routed Networks

Originální název

Reachability Analysis in Dynamically Routed Networks

Anglický název

Reachability Analysis in Dynamically Routed Networks

Jazyk

en

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.

Anglický 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.

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",
  annote="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.",
  address="IEEE Computer Society",
  booktitle="Proceedings of the IEEE ECBS 2011",
  chapter="76340",
  edition="NEUVEDEN",
  howpublished="print",
  institution="IEEE Computer Society",
  year="2011",
  month="may",
  pages="197--205",
  publisher="IEEE Computer Society",
  type="conference paper"
}