View in EDS PDF Full Text

Declarative Networking.

Saved in:
Bibliographic Details
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
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 45021161
AccessLevel: 6
PubType: Periodical
PubTypeId: serialPeriodical
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Declarative Networking.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Boon+Thau+Loo%22">Boon Thau Loo</searchLink><relatesTo>1</relatesTo><i> boonloo@cis.upenn.edu</i><br /><searchLink fieldCode="AR" term="%22Condie%2C+Tyson%22">Condie, Tyson</searchLink><relatesTo>2</relatesTo><i> tcondie@cs.berkeley.edu</i><br /><searchLink fieldCode="AR" term="%22Garofalakis%2C+Minos%22">Garofalakis, Minos</searchLink><relatesTo>3</relatesTo><i> minos@softnet.tuc.gr</i><br /><searchLink fieldCode="AR" term="%22Gay%2C+David+E%2E%22">Gay, David E.</searchLink><relatesTo>4</relatesTo><i> david.e.gay@intel.com</i><br /><searchLink fieldCode="AR" term="%22Hellerstein%2C+Joseph+M%2E%22">Hellerstein, Joseph M.</searchLink><relatesTo>2</relatesTo><i> hellerstein@cs.berkeley.edu</i><br /><searchLink fieldCode="AR" term="%22Maniatis%2C+Petros%22">Maniatis, Petros</searchLink><relatesTo>4</relatesTo><i> petros.maniatis@intel.com</i><br /><searchLink fieldCode="AR" term="%22Ramakrishnan%2C+Raghu%22">Ramakrishnan, Raghu</searchLink><relatesTo>5</relatesTo><i> ramakris@yahooinc.com</i><br /><searchLink fieldCode="AR" term="%22Roscoe%2C+Timothy%22">Roscoe, Timothy</searchLink><relatesTo>6</relatesTo><i> troscoe@inf.ethz.ch</i><br /><searchLink fieldCode="AR" term="%22Stoica%2C+Ion%22">Stoica, Ion</searchLink><relatesTo>2</relatesTo><i> istoica@cs.berkeley.edu</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Communications+of+the+ACM%22">Communications of the ACM</searchLink>. Nov2009, Vol. 52 Issue 11, p87-95. 9p. 4 Diagrams.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Declarative+programming+languages%22">Declarative programming languages</searchLink><br /><searchLink fieldCode="DE" term="%22Declarative+programming%22">Declarative programming</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+programming%22">Computer programming</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+network+protocols%22">Computer network protocols</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+networks%22">Computer networks</searchLink><br /><searchLink fieldCode="DE" term="%22Semantic+network+analysis%22">Semantic network analysis</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=45021161
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1145/1592761.1592785
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 9
        StartPage: 87
    Subjects:
      – SubjectFull: Declarative programming languages
        Type: general
      – SubjectFull: Declarative programming
        Type: general
      – SubjectFull: Computer programming
        Type: general
      – SubjectFull: Computer network protocols
        Type: general
      – SubjectFull: Computer networks
        Type: general
      – SubjectFull: Semantic network analysis
        Type: general
    Titles:
      – TitleFull: Declarative Networking.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Boon Thau Loo
      – PersonEntity:
          Name:
            NameFull: Condie, Tyson
      – PersonEntity:
          Name:
            NameFull: Garofalakis, Minos
      – PersonEntity:
          Name:
            NameFull: Gay, David E.
      – PersonEntity:
          Name:
            NameFull: Hellerstein, Joseph M.
      – PersonEntity:
          Name:
            NameFull: Maniatis, Petros
      – PersonEntity:
          Name:
            NameFull: Ramakrishnan, Raghu
      – PersonEntity:
          Name:
            NameFull: Roscoe, Timothy
      – PersonEntity:
          Name:
            NameFull: Stoica, Ion
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 11
              Text: Nov2009
              Type: published
              Y: 2009
          Identifiers:
            – Type: issn-print
              Value: 00010782
          Numbering:
            – Type: volume
              Value: 52
            – Type: issue
              Value: 11
          Titles:
            – TitleFull: Communications of the ACM
              Type: main
ResultId 1