MoL-2017-15: Gossip in NetKAT

MoL-2017-15: Wagemaker, Jana (2017) Gossip in NetKAT. [Report]

[thumbnail of MoL-2017-15.text.pdf]

Download (644kB) | Preview


In this thesis we combine the study of Netkat with the study of dynamic gossip. Netkat is a sound and complete network programming language based on Kleene algebra with tests, originally used to describe packets traveling through networks. It has a coalgebraic decision procedure deciding Netkat equivalences. Dynamic gossip is a field in which it is studied how information spreads through a gossip graph, where the links in the gossip graph are changeable (dynamic). So far no sound and complete logic is available that describes dynamic gossip in a satisfactory way. In this thesis we explore the application of Netkat to dynamic gossip. It is shown that a change of perspective on Netkat in which we keep track of the state of the switches in a network allows us to use Netkat to model the Learn New Secrets Protocol, which is one of many gossip protocols. The addition to Netkat to keep track of the state of switches is formalised and shown to remain sound and complete with respect to the packet-processing model. It is shown that the notions of weak successfulness, strong successfulness and sun graph are formalisable in Netkat and that the theorem from dynamic gossip “Gossip graph G is a sun if and only if the LNS protocol is strongly successful on G” is also a theorem of Netkat. In this thesis we thus extensively study Netkat and explore a concrete application of the language: we show how the framework of Netkat can be used to formalise and analyse dynamic gossip.

Item Type: Report
Report Nr: MoL-2017-15
Series Name: Master of Logic Thesis (MoL) Series
Year: 2017
Subjects: Computation
Depositing User: Dr Marco Vervoort
Date Deposited: 21 Sep 2017 15:23
Last Modified: 09 Jan 2018 17:19

Actions (login required)

View Item View Item