Declarative Networking.
Saved in:
| Title: | Declarative Networking. |
|---|---|
| Authors: | Boon Thau Loo1 boonloo@cis.upenn.edu, Condie, Tyson2 tcondie@cs.berkeley.edu, Garofalakis, Minos3 minos@softnet.tuc.gr, Gay, David E.4 david.e.gay@intel.com, Hellerstein, Joseph M.2 hellerstein@cs.berkeley.edu, Maniatis, Petros4 petros.maniatis@intel.com, Ramakrishnan, Raghu5 ramakris@yahooinc.com, Roscoe, Timothy6 troscoe@inf.ethz.ch, Stoica, Ion2 istoica@cs.berkeley.edu |
| Source: | Communications of the ACM. Nov2009, Vol. 52 Issue 11, p87-95. 9p. 4 Diagrams. |
| Subjects: | Declarative programming languages, Declarative programming, Computer programming, Computer network protocols, Computer networks, Semantic network analysis |
| 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. [ABSTRACT FROM AUTHOR] |
| Copyright of Communications of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
