Nettle: Functional Reactive Programming for OpenFlow Networks

Voellmy, Andreas; Agarwal, Ashish; Hudak, Paul

doi:10.21236/ada555162

Cited by 42 publications

(37 citation statements)

References 16 publications

(8 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Nettle [35] applies ideas from functional reactive programming to SDN programming, and focuses on making it easy to express dynamic programs using time-varying signals rather than event loops and callbacks as in most other systems. PANE [11] exposes an interface that allows individual hosts in a network to request explicit functionality such as increased bandwidth for a large bulk transfer or bounded latency for a phone call.…”

Section: Related Workmentioning

confidence: 99%

A Coalgebraic Decision Procedure for NetKAT

Foster

Kozen

Milano

et al. 2015

Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

View full text Add to dashboard Cite

Program equivalence is a fundamental problem that has practical applications across a variety of areas of computing including compilation, optimization, software synthesis, formal verification, and many others. Equivalence is undecidable in general, but in certain settings it is possible to develop domain-specific languages that are expressive enough to be practical and yet sufficiently restricted so that equivalence remains decidable.In previous work we introduced NetKAT, a domain-specific language for specifying and verifying network packet-processing functions. NetKAT provides familiar constructs such as tests, assignments, union, sequential composition, and iteration as well as custom primitives for modifying packet headers and encoding network topologies. Semantically, NetKAT is based on Kleene algebra with tests (KAT) and comes equipped with a sound and complete equational theory. Although NetKAT equivalence is decidable, the best known algorithm is hardly practical-it uses Savitch's theorem to determinize a PSPACE algorithm and requires quadratic space. This paper presents a new algorithm for deciding NetKAT equivalence. This algorithm is based on finding bisimulations between finite automata constructed from NetKAT programs. We investigate the coalgebraic theory of NetKAT, generalize the notion of Brzozowski derivatives to NetKAT, develop efficient representations of NetKAT automata in terms of spines and sparse matrices, and discuss the highlights of our prototype implementation.

show abstract

Section: Related Workmentioning

confidence: 99%

A Coalgebraic Decision Procedure for NetKAT

Foster

Kozen

Milano

et al. 2015

Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

View full text Add to dashboard Cite

show abstract

“…Estudos em destaque abordam a abstração do baixo nível de implementação e especificação existente na interação entre operadores de rede e o protocolo OpenFlow, utilizado subjacentemente nas SDNs (FERGUSON et al, 2013;FOSTER et al, 2013;VOELLMY et al, 2011 …”

Section: Revisão Teóricaunclassified

“…Atualmente, diversas abordagens existem para tornar possível a gerência da rede através de políticas fazendo uso subjacente do protocolo OpenFlow (FOSTER et al, 2013;VOELLMY & HUDAK, 2011). Apesar de permitir várias formas de gerenciamento, o uso de diferentes tecnologias para definir o comportamento de uma SDN pode torná-la complexa e difícil de manter, (SHERWOOD et al, 2009).…”

Section: Introductionunclassified

Abordagem dirigida a modelos para o gerenciamento de redes definidas por software

Lopes

Fernandes

2014

RBADM

View full text Add to dashboard Cite

RESUMOAs Redes Definidas por Software (SDN) vêm obtendo grande atenção por parte da comunidade acadêmica e também da indústria, devido a diversos aspectos. Apesar disso, o gerenciamento e o desenvolvimento de aplicações voltadas para este novo campo em redes de computadores ainda são complexos, carentes de metodologias e ferramentas que permitam utilizar todo o nível de abstração possibilitado pelas SDNs. Com foco neste problema, o presente trabalho propõe uma Domain-Specific Modelling Language (DSML), aplicada à abordagem de SDN, aumentando o nível de abstração para o gerenciamento destas redes. PALAVRAS-CHAVES:Redes Definidas por Software; DSML; Sistemas. MODEL-DRIVEN APPROACH TO SOFTWARE-DEFINED NETWORKING MANAGEMENT ABSTRACTSoftware-Defined Networking (SDN) has been getting great interest from the academic community and industry, due to several aspects. Nevertheless, the application development oriented for this new SDN field is still complex, lacking methodologies and tools that enable use all the level of abstraction afforded by these networks. Focusing on this problem, the current paper proposes a Domain-Specific Modeling Language (DSML) applied to SDN, which raises the level of abstraction in SDN management.

show abstract

“…Languages such as Frenetic [4] and Nettle [16] abstract aspects of SDNs to improve code correctness and composability. Consistent Updates [12] adds flow and packet consistency primitives.…”

Section: Related Workmentioning

confidence: 99%

Where is the debugger for my software-defined network?

Handigol

Heller

Jeyakumar

et al. 2012

Proceedings of the First Workshop on Hot Topics in Software Defined Networks

161

View full text Add to dashboard Cite

The behavior of a Software-Defined Network is controlled by programs, which like all software, will have bugs -but this programmatic control also enables new ways to debug networks. This paper introduces ndb, a prototype network debugger inspired by gdb, which implements two primitives useful for debugging an SDN: breakpoints and packet backtraces. We show how ndb modifies forwarding state and logs packet digests to rebuild the sequence of events leading to an errant packet, providing SDN programmers and operators with a valuable tool for tracking down the root cause of a bug.

show abstract

Nettle: Functional Reactive Programming for OpenFlow Networks

Cited by 42 publications

References 16 publications

A Coalgebraic Decision Procedure for NetKAT

A Coalgebraic Decision Procedure for NetKAT

Abordagem dirigida a modelos para o gerenciamento de redes definidas por software

Where is the debugger for my software-defined network?

Contact Info

Product

Resources

About