Details

Autor(en) / Beteiligte

• BOON THAU LOO
• CONDIE, Tyson
• GAROFALAKIS, Minos
• GAY, David E
• HELLERSTEIN, Joseph M
• MANIATIS, Petros
• RAMAKRISHNAN, Raghu
• ROSCOE, Timothy
• STOICA, Ion

Titel

Declarative Networking

Ist Teil von

• Communications of the ACM, 2009-11, Vol.52 (11), p.87-95

Ort / Verlag

New York, NY: Association for Computing Machinery

Erscheinungsjahr

2009

Quelle

EBSCOhost Business Source Ultimate

Beschreibungen/Notizen

• 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.