WNetKAT: Programming and Verifying Weighted Software-Defined Networks

WNetKAT: Programming and Verifying Weighted Software-Defined Networks

Abstract

Programmability and verifiability lie at the heart of the Software-Defined Networking (SDN) paradigm. This paper presents WNetKAT, a network programming language accounting for the fact that networks are inherently weighted, and communications subject to capacity constraints (e.g., in terms of bandwidth) and costs (e.g., latency or monetary costs). WNetKAT is based on a syntactic and semantic extension of the NetKAT algebra, and comes with releavant applications, including cost- and capacity-aware reachability testing or service chaining. This paper also initiates the discussion of decidability and the relationship to weighted finite automata.

Grafik Top
Authors
  • Larsen, Kim G.
  • Schmid, Stefan
  • Xue, Bingtian
Grafik Top
Supplemental Material
Shortfacts
Category
Paper in Conference Proceedings or in Workshop Proceedings (Paper)
Event Title
28th Nordic Workshop on Programming Theory (NWPT)
Divisions
Communication Technologies
Subjects
Informatik Allgemeines
Event Location
Rold Storkro (North Jutland), Denmark
Event Type
Workshop
Event Dates
October 2016
Date
2016
Export
Grafik Top