Declarative networking
Boon Thau Loo, Tyson Condie, Minos Garofalakis et al. · Communications of the ACM · 2009
Declarative Networking is a programming methodology that enables developers to concisely specify network protocols and services, which are directly compiled to a dataflow framework that executes the specifications. This paper provides an introduction to basic issues in declarative networking, including language design, optimization, and dataflow execution. We present the intuition behind declarative programming of networks, including roots in Datalog, extensions for networked environments, and the semantics of long-running queries over network state. We focus on a sublanguage we call Network Datalog (NDlog) , including execution strategies that provide crisp eventual consistency semantics with significant flexibility in execution. We also describe a more general language called Overlog , which makes some compromises between expressive richness and semantic guarantees. We provide an overview of declarative network protocols, with a focus on routing protocols and overlay networks. Finally, we highlight related work in declarative networking, and new declarative approaches to related problems.
Cited by 149 works. doi:10.1145/1592761.1592785
Authors
- Boon Thau Loo
- Tyson Condie
- Minos Garofalakis
- David E. Gay
- Joseph M. Hellerstein
- Petros Maniatis
- Raghu Ramakrishnan
- Timothy Roscoe
- Ion Gabriel Stoica
References
- Chord
- The click modular router
- The design philosophy of the DARPA internet protocols
- A survey of active network research
- A case for end system multicast (keynote address)
- Encapsulation of parallelism in the Volcano query processing system
- Maintaining views incrementally
- Magic sets and other strange ways to implement logic programs (extended abstract)
- Declarative routing
- Declarative networking