Access Restriction

Author Garofalakis, Minos ♦ Condie, Tyson ♦ Maniatis, Petros ♦ Gay, David E. ♦ Loo, Boon Thau ♦ Hellerstein, Joseph M. ♦ Ramakrishnan, Raghu ♦ Stoica, Ion ♦ Roscoe, Timothy
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Abstract 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.
Description Affiliation: University of Pennsylvania, Philadelphia, PA (Loo, Boon Thau) || Technical University of Crete, Greece (Garofalakis, Minos) || Intel Research, Berkeley, CA (Gay, David E.; Maniatis, Petros) || Yahoo! Research, Silicon Valley (Ramakrishnan, Raghu) || ETH Zurich, Switzerland (Roscoe, Timothy) || University of California, Berkeley, CA (Condie, Tyson; Hellerstein, Joseph M.; Stoica, Ion)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 52
Issue Number 11
Page Count 9
Starting Page 87
Ending Page 95

Open content in new tab

   Open content in new tab
Source: ACM Digital Library