Declarative networking: language, execution and optimization
By Boon Thau Loo, Tyson Condie, Minos N. Garofalakis, David E. Gay, Joseph M Hellerstein, Petros Maniatis, Raghu Ramakrishnan, Timothy Roscoe, Ion Stoica. SIGMOD Conference, 2006
316 citations recorded by the source corpus.
The networking and distributed systems communities have recently explored a variety of new network architectures, both for application-level overlay networks, and as prototypes for a next-generation Internet architecture. In this context, we have investigated declarative networking: the use of a distributed recursive query engine as a powerful vehicle for accelerating innovation in network architectures [23, 24, 33]. Declarative networking represents a significant new application area for database research on recursive query processing. In this paper, we address fundamental database issues in this domain. First, we motivate and formally define the Network Datalog (NDlog) language for declarative network specifications. Second, we introduce and prove correct relaxed versions of the traditional semi-naïve query evaluation technique, to overcome fundamental problems of the traditional technique in an asynchronous distributed setting. Third, we consider the dynamics of network state, and formalize the iheventual consistencyl. of our programs even when bursts of updates can arrive in the midst of query execution. Fourth, we present a number of query optimization opportunities that arise in the declarative networking context, including applications of traditional techniques as well as new optimizations. Last, we present evaluation results of the above ideas implemented in our P2 declarative networking system, running on 100 machines over the Emulab network testbed.
Subfields: Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/f76e8a5fcd260e993c19f641726e14be9b3b6aa2
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Ratul Mahajan
- Joseph M Hellerstein
- Alexey Tumanov
- Paul Barham
- Ramesh Govindan
- Derek Gordon Murray
- Martín Abadi
- Michael Isard
Citations in the corpus
- A General Approach to Network Configuration Analysis (2015, background): “For instance, researchers have proposed high-level, declarative languages to program networks [9] [18] [19] [26], but a major hurdle in adopting them is migrating a network while faithfully preserving its forwarding policies.”
- Naiad: a timely dataflow system (2013, methodology): “Previous systems have constructed cyclic dataflow graphs for purposes such as distributed overlays [24] and routing protocols [23, 25], packet processing in software [20], and high-throughput server design [39].”
- Serverless Computing: One Step Forward, Two Steps Back (2018, background): “time and space. There are examples of these patterns in the literature— particularly in asynchronous flow-based metaphors like Functional Reactive Programming [12] and Declarative DSLs for Networking [17] and Distributed Computing [1]. A particular challenge in distributed computing is to couple the”