Event-driven network programming

McClurg, Jedidiah; Hojjat, Hossein; Foster, Nate; Černý, Pavol

doi:10.1145/2908080.2908097

Cited by 25 publications

(13 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The current paper deviates from earlier concurrent variations on NetKAT, such as Concurrent NetCore [35] and a stateful variant of NetKAT introduced in [31]. Both have a different algebraic structure than NetKAT.…”

Section: Related Workmentioning

confidence: 90%

See 1 more Smart Citation

Concurrent NetKAT: Modeling and analyzing stateful, concurrent networks

Wagemaker,

Foster,

Kappé

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

We introduce Concurrent NetKAT (CNetKAT), an extension of NetKAT with operators for specifying and reasoning about concurrency in scenarios where multiple packets interact through state. We provide a model of the language based on partially-ordered multisets (pomsets), which are a well-established mathematical structure for defining the denotational semantics of concurrent languages. We provide a sound and complete axiomatization of this model, and we illustrate the use of CNetKAT through examples. More generally, CNetKAT can be understood as an algebraic framework for reasoning about programs with both local state (in packets) and global state (in a global store).

show abstract

Section: Related Workmentioning

confidence: 90%

“…The approach in [31] models interactions among multiple packets, but is accompanied by semantic correctness guarantees, rather than algebraic formalizations as in CNetKAT. A recent PhD thesis [29] contains another version of stateful NetKAT, which assumes packet processing can always be serialized into a deterministic, global order.…”

Section: Related Workmentioning

confidence: 99%

Concurrent NetKAT: Modeling and analyzing stateful, concurrent networks

Wagemaker,

Foster,

Kappé

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…Stateful NetKAT is a language for event-driven network programming [14], extending the NetKAT language by mutable state. It is similar to SNAP, however, it rather focuses on applying consistent network updates where consistency properties hold during the transition between two network configurations, which is triggered in response to events.…”

Section: Related Workmentioning

confidence: 99%

P4cep

Kohler

Mayer

Dürr

et al. 2018

Proceedings of the 2018 Morning Workshop on in-Network Computing

View full text Add to dashboard Cite

In-network computing using programmable networking hardware is a strong trend in networking that promises to reduce latency and consumption of server resources through offloading to network elements (programmable switches and smart NICs). In particular, the data plane programming language P4 together with powerful P4 networking hardware has spawned projects offloading services into the network, e.g., consensus services or caching services. In this paper, we present a novel case for in-network computing, namely, Complex Event Processing (CEP). CEP processes streams of basic events, e.g., stemming from networked sensors, into meaningful complex events. Traditionally, CEP processing has been performed on servers or overlay networks. However, we argue in this paper that CEP is a good candidate for in-network computing along the communication path avoiding detouring streams to distant servers to minimize communication latency while also exploiting processing capabilities of novel networking hardware. We show that it is feasible to express CEP operations in P4 and also present a tool to compile CEP operations, formulated in our P4CEP rule specification language, to P4 code. Moreover, we identify challenges and problems that we have encountered to show future research directions for implementing full-fledged in-network CEP systems. CCS CONCEPTS• Networks → Programmable networks; In-network processing; • Software and its engineering → Publish-subscribe / event-based architectures; Message oriented middleware;

show abstract

“…The idea of Netkat with additional state is not new: another version of it is discussed in [17]. However, the system developed there is no longer a kat and hence cannot base a soundness and completeness proof on the corresponding proofs for kat.…”

Section: Related Workmentioning

confidence: 99%

Towards an Analysis of Dynamic Gossip in Netkat

Gattinger

Wagemaker

2018

Relational and Algebraic Methods in Computer Science

View full text Add to dashboard Cite

In this paper we analyse the dynamic gossip problem using the algebraic network programming language Netkat. Netkat is a language based on Kleene algebra with tests and describes packets travelling through networks. It has a sound and complete axiomatisation and an efficient coalgebraic decision procedure. Dynamic gossip studies how information spreads through a peer-to-peer network in which links are added dynamically. In this paper we embed dynamic gossip into Netkat. We show that a reinterpretation of Netkat in which we keep track of the state of switches allows us to model Learn New Secrets, a well-studied protocol for dynamic gossip. We axiomatise this reinterpretation of Netkat and show that it is sound and complete with respect to the packet-processing model, via a translation back to standard Netkat. Our main result is that many common decision problems about gossip graphs can be reduced to checks of Netkat equivalences. We also implemented the reduction.

show abstract

Event-driven network programming

Cited by 25 publications

References 31 publications

Concurrent NetKAT: Modeling and analyzing stateful, concurrent networks

Concurrent NetKAT: Modeling and analyzing stateful, concurrent networks

P4cep

Towards an Analysis of Dynamic Gossip in Netkat

Contact Info

Product

Resources

About