Show simple item record

dc.contributor.authorFoster, Nate
dc.contributor.authorKozen, Dexter
dc.contributor.authorMamouras, Konstantinos
dc.contributor.authorReitblatt, Mark
dc.contributor.authorSilva, Alexandra
dc.description.abstractThis paper develops a new language for programming software-defined networks based on a probabilistic semantics. We extend the NetKAT language with new primitives for expressing probabilistic behaviors and enrich the semantics from one based on deterministic functions to one based on measures and 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, and show that it satisfies a number of natural equations. We present case studies that show how the language can be used to model a diverse collection of scenarios drawn from real-world networks.en_US
dc.subjectSoftware Defined Networksen_US
dc.titleProbabilistic NetKATen_US
dc.typetechnical reporten_US

Files in this item


This item appears in the following Collection(s)

Show simple item record