Probabilistic NetKAT

  • Nate Foster
  • Dexter Kozen
  • Konstantinos Mamouras
  • Mark Reitblatt
  • Alexandra Silva
Conference paper

DOI: 10.1007/978-3-662-49498-1_12

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9632)
Cite this paper as:
Foster N., Kozen D., Mamouras K., Reitblatt M., Silva A. (2016) Probabilistic NetKAT. In: Thiemann P. (eds) Programming Languages and Systems. ESOP 2016. Lecture Notes in Computer Science, vol 9632. Springer, Berlin, Heidelberg

Abstract

This paper presents a new language for network programming based on a probabilistic semantics. We extend the NetKATlanguage with new primitives for expressing probabilistic behaviors and enrich the semantics from one based on deterministic functions to one based on measurable functions on sets of packet histories. We establish fundamental properties of the semantics, prove that it is a conservative extension of the deterministic semantics, show that it satisfies a number of natural equations, and develop a notion of approximation. We present case studies that show how the language can be used to model a diverse collection of scenarios drawn from real-world networks.

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  • Nate Foster
    • 1
  • Dexter Kozen
    • 1
  • Konstantinos Mamouras
    • 2
  • Mark Reitblatt
    • 1
  • Alexandra Silva
    • 3
  1. 1.Cornell UniversityNew YorkUSA
  2. 2.University of PennsylvaniaPhiladelphiaUSA
  3. 3.University College LondonLondonUK

Personalised recommendations