Citation Context

... are a natural and compact way to implement a variety of routing protocols and overlay networks. For example, traditional routing protocols can be expressed in a few lines of code [17], and the Chord =-=[23]-=- distributed hash table in 47 lines of code [16]. When compiled and executed, these declarative networks perform efficiently relative to imperative implementations. The techniques proposed in this pap...

Citation Context

...he dimensions of granularity (domains defined according to nodes, tuples, or networks), distribution (centralized or distributed), and representation (using derivation trees, binary decision diagrams =-=[2]-=-, algebraic structures, etc.). We show that various distributed systems (in particular, diagnostics, network debugging, and distributed trust management) map naturally to network provenance. This pape...

Citation Context

...rming network diagnostics, identifying malicious and misbehaving users, and enforcing trust management policies in distributed systems. Each goal has led to a series of application-specific proposals =-=[21, 1, 11, 24, 9, 12]-=- that focus on improving network support for accountability and providing efficient mechanisms to trace packets and information flows through the Internet. This paper explores the generic data managem...

Citation Context

...lis, Indiana, USA. Copyright 2010 ACM 978-1-4503-0032-2/10/06 ...$10.00. Keywords Provenance, Distributed query processing, Declarative networking 1. INTRODUCTION In database systems, data provenance =-=[4]-=- is a well-known concept, primarily used to answer questions concerning how query results are derived and which data sources they come from. A similar notion – network provenance [25] – is emerging in...

Citation Context

...ging distributed systems [22, 14] and for accepting/rejecting network packets based on their traversed path. Alternatively, provenance may be more compactly represented using algebraic representation =-=[7, 3]-=-. Algebraic representations encode provenance using the binary operations + and ∗ (representing union and join, respectively). For instance, if α, β, and γ are the respective unique tuple IDs for link...

Citation Context

...via a distributed query. Efficient provenance maintenance and querying. To maintain network provenance efficiently, we leverage the distributed query processing capabilities of declarative networking =-=[17, 16, 15]-=-. Declarative networking models network protocols as continuous queries over distributed streams. Declarative networking programs permit a variety of distributed network protocols to be specified conc...

Citation Context

...via a distributed query. Efficient provenance maintenance and querying. To maintain network provenance efficiently, we leverage the distributed query processing capabilities of declarative networking =-=[17, 16, 15]-=-. Declarative networking models network protocols as continuous queries over distributed streams. Declarative networking programs permit a variety of distributed network protocols to be specified conc...

Citation Context

...ative statements, declarative networking represents a natural means for unifying the synthesis and analysis of distributed protocols. The declarative NDlog language used by ExSPAN is based on Datalog =-=[20]-=-. A Datalog program consists of a set of rules. Each rule has the form p :- q1, q2, ..., qn., which can be read informally as “q1 and q2 and ... and qn imply p”. Here, p is the head of the rule, and q...

Citation Context

...rming network diagnostics, identifying malicious and misbehaving users, and enforcing trust management policies in distributed systems. Each goal has led to a series of application-specific proposals =-=[21, 1, 11, 24, 9, 12]-=- that focus on improving network support for accountability and providing efficient mechanisms to trace packets and information flows through the Internet. This paper explores the generic data managem...

Citation Context

...rming network diagnostics, identifying malicious and misbehaving users, and enforcing trust management policies in distributed systems. Each goal has led to a series of application-specific proposals =-=[21, 1, 11, 24, 9, 12]-=- that focus on improving network support for accountability and providing efficient mechanisms to trace packets and information flows through the Internet. This paper explores the generic data managem...

Citation Context

...rming network diagnostics, identifying malicious and misbehaving users, and enforcing trust management policies in distributed systems. Each goal has led to a series of application-specific proposals =-=[21, 1, 11, 24, 9, 12]-=- that focus on improving network support for accountability and providing efficient mechanisms to trace packets and information flows through the Internet. This paper explores the generic data managem...

Citation Context

...ta model for network provenance. We define a distributed datamodel for storing network provenance. Our data model builds upon current work on representing provenance information as relational tables =-=[10, 5]-=-, with extensions to supported distributed storage and querying. We propose two forms of distribution: a value-based approach in which all relevant information is piggy-backed onto communicated tuples...

Citation Context

...ta model for network provenance. We define a distributed datamodel for storing network provenance. Our data model builds upon current work on representing provenance information as relational tables =-=[10, 5]-=-, with extensions to supported distributed storage and querying. We propose two forms of distribution: a value-based approach in which all relevant information is piggy-backed onto communicated tuples...

Citation Context

...rming network diagnostics, identifying malicious and misbehaving users, and enforcing trust management policies in distributed systems. Each goal has led to a series of application-specific proposals =-=[21, 1, 11, 24, 9, 12]-=- that focus on improving network support for accountability and providing efficient mechanisms to trace packets and information flows through the Internet. This paper explores the generic data managem...

Citation Context

...rming network diagnostics, identifying malicious and misbehaving users, and enforcing trust management policies in distributed systems. Each goal has led to a series of application-specific proposals =-=[21, 1, 11, 24, 9, 12]-=- that focus on improving network support for accountability and providing efficient mechanisms to trace packets and information flows through the Internet. This paper explores the generic data managem...

Citation Context

... techniques aimed at reducing communication latency and bandwidth utilization. ExSPAN prototype implementation and evaluation. We present the prototype of ExSPAN. Our implementation utilizes RapidNet =-=[18]-=-, a declarative networking platform developed using the ns-3 network simulator [19]. Our experiments over simulated networks and an actual deployment on a testbed environment demonstrate that ExSPAN s...

Citation Context

... tuple-level provenance information and is typically used to answer queries pertaining to fine-grained network state. For example, graph representation may be useful for debugging distributed systems =-=[22, 14]-=- and for accepting/rejecting network packets based on their traversed path. Alternatively, provenance may be more compactly represented using algebraic representation [7, 3]. Algebraic representations...

Citation Context

...y the ns-3 runtime. ExSPAN uses the identical codebase for both simulation and deployment modes. We generate transit-stub topologies for our simulation experiments using the GT-ITM topology generator =-=[8]-=-. The transit-stub topology consists of eight nodes per stub, three stubs per transit node, and four nodes per transit domain. We increase the number of nodes in the network by increasing the number o...