Explaining safety failures in NetKAT

Caltais, Georgiana; Tunc, Hünkar Can

Explaining safety failures in NetKAT

Dateien

Zu diesem Dokument gibt es keine Dateien.

Datum

2021

Publikationstyp

Zeitschriftenartikel

Publikationsstatus

Published

Erschienen in

Journal of Logical and Algebraic Methods in Programming. Elsevier. 2021, 121, 100676. ISSN 2352-2208. eISSN 2352-2216. Available under: doi: 10.1016/j.jlamp.2021.100676

Zusammenfassung

This work introduces a concept of explanations with respect to the violation of safe behaviours within software defined networks (SDNs) expressible in NetKAT. The latter is a network programming language based on a well-studied mathematical structure, namely, Kleene Algebra with Tests (KAT). Amongst others, the mathematical foundation of NetKAT gave rise to a sound and complete equational theory. In our setting, a safe behaviour is characterised by a NetKAT policy, or program, which does not enable forwarding packets from an ingress i to an undesirable egress e. We show how explanations for safety violations can be derived in an equational fashion, according to a modification of the existing NetKAT axiomatisation. We propose an approach based on the Maude system for actually computing the undesired behaviours witnessing the forwarding of packets from i to e as above. SDN-SafeCheck is a tool based on Maude equational theories satisfying important properties such as Church-Rosser and termination. SDN-SafeCheck automatically identifies all the undesired behaviours leading to e, covering forwarding paths up to a user specified size.

Fachgebiet (DDC)

004 Informatik

Schlagwörter

Software defined networks; NetKAT; Safety; Failure analysis; Axiomatisations; The Maude system

Zitieren

ISO 690

CALTAIS, Georgiana, Hünkar Can TUNC, 2021. Explaining safety failures in NetKAT. In: Journal of Logical and Algebraic Methods in Programming. Elsevier. 2021, 121, 100676. ISSN 2352-2208. eISSN 2352-2216. Available under: doi: 10.1016/j.jlamp.2021.100676

BibTex

@article{Caltais2021Expla-53915,
  year={2021},
  doi={10.1016/j.jlamp.2021.100676},
  title={Explaining safety failures in NetKAT},
  volume={121},
  issn={2352-2208},
  journal={Journal of Logical and Algebraic Methods in Programming},
  author={Caltais, Georgiana and Tunc, Hünkar Can},
  note={Article Number: 100676}
}

RDF

<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/53915">
    <dc:contributor>Caltais, Georgiana</dc:contributor>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-06-09T06:38:06Z</dcterms:available>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:creator>Caltais, Georgiana</dc:creator>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:title>Explaining safety failures in NetKAT</dcterms:title>
    <dcterms:abstract xml:lang="eng">This work introduces a concept of explanations with respect to the violation of safe behaviours within software defined networks (SDNs) expressible in NetKAT. The latter is a network programming language based on a well-studied mathematical structure, namely, Kleene Algebra with Tests (KAT). Amongst others, the mathematical foundation of NetKAT gave rise to a sound and complete equational theory. In our setting, a safe behaviour is characterised by a NetKAT policy, or program, which does not enable forwarding packets from an ingress i to an undesirable egress e. We show how explanations for safety violations can be derived in an equational fashion, according to a modification of the existing NetKAT axiomatisation. We propose an approach based on the Maude system for actually computing the undesired behaviours witnessing the forwarding of packets from i to e as above. SDN-SafeCheck is a tool based on Maude equational theories satisfying important properties such as Church-Rosser and termination. SDN-SafeCheck automatically identifies all the undesired behaviours leading to e, covering forwarding paths up to a user specified size.</dcterms:abstract>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Tunc, Hünkar Can</dc:contributor>
    <dc:language>eng</dc:language>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-06-09T06:38:06Z</dc:date>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/53915"/>
    <dc:creator>Tunc, Hünkar Can</dc:creator>
    <dcterms:issued>2021</dcterms:issued>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Ja

Begutachtet

Unbekannt