![Ιδρυματικό Αποθετήριο [SANDBOX]](images/dias.logo.png "Ιδρυματικό Αποθετήριο [SANDBOX]"){kind=logo}
Ιδρυματικό Αποθετήριο [SANDBOX]
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/496CB4EA-AA22-467D-9432-67313E105531 | ||
| Έτος | 2009 | ||
| Τύπος | Δημοσίευση σε Περιοδικό με Κριτές | ||
| Άδεια Χρήσης |
|
||
| Βιβλιογραφική Αναφορά | B.T. Loo, T. Condie, M. Garofalakis, D.E. Gay, J. M. Hellerstein, P. Maniatis, R. Ramakrishnan, T. Roscoe and I. Stoica, "Declarative networking", Communications of the ACM, vol. 52. no. 11, Nov. 2009, pp. 87-95. doi: 10.1145/1592761.1592785 https://doi.org/10.1145/1592761.1592785 | ||
| Εμφανίζεται στις Συλλογές |
Declarative Networking is a programming methodology thatenables developers to concisely specify network protocolsand services, which are directly compiled to a dataflow frameworkthat executes the specifications. This paper providesan introduction to basic issues in declarative networking, includinglanguage design, optimization and dataflow execution.We present the intuition behind declarative programmingof networks, including roots in Datalog, extensions fornetworked environments, and the semantics of long-runningqueries over network state. We focus on a sublanguage wecall Network Datalog (NDlog), including execution strategiesthat provide crisp eventual consistency semantics withsignificant flexibility in execution. We also describe a moregeneral language called Overlog, which makes some compromisesbetween 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.
Copyright © DIAS 2013
