Typed Abstraction of Complex Network Compositions

Bestavros, Azer; Bradley, Adam D.; Kfoury, A. J.; Matta, Ibrahim

doi:10.1109/icnp.2005.44

Cited by 4 publications

(6 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The work in this paper extends and generalizes our earlier work in TRAFFIC (Typed Representation and Analysis of Flows For Interoperability Checks [4]), and complements our earlier work in CHAIN (Canonical Homomorphic Abstraction of Infinite Network protocol compositions [8]). …”

Section: Related Work and Conclusionsupporting

confidence: 54%

“…If parameters are multi-sorted, then ϕ and ψ must respect sorts, i.e., if ϕ(x) = y then both x and y must be of the same sort, e.g., both velocity parameters, or both density parameters, etc., and similarly for ψ. 4 Pre-and Post-Conditions. A typing or a typed specification for an untyped CFN M is an expression of the form (M : C * ) or, if fully spelled out,…”

Section: Overview Of the Netsketch Formalismmentioning

confidence: 99%

See 1 more Smart Citation

Safe compositional network sketches

Bestavros

Kfoury

Lapets

et al. 2010

Proceedings of the 13th ACM International Conference on Hybrid Systems: Computation and Control

View full text Add to dashboard Cite

NetSketch is a tool for the specification of constrained-flow networks (CFNs) and the certification of desirable safety properties imposed thereon, conceived to assist system integrators in modeling and design. It provides compositional analysis capabilities based on a strongly-typed domain-specific language (DSL) for describing and reasoning about CFNs and relevant invariants. Users can model or design individual network components and perform manual or automated whole-system analysis of the properties thereof. Users can also assemble many instances of these components into larger networks, relying on NetSketch's less precise but more tractable compositional analysis capabilities. This ability to trade "precision of analysis" for "feasibility of analysis" according to available resources is among the novel features of NetSketch. In earlier work we illustrated how NetSketch is applied to actual domains [6], and provided a formal definition of its underlying formalism [7].While the NetSketch DSL provides automatic compositional analysis capabilities for modeling and designing entire networks, users may need to employ a wider variety of tools and techniques when modeling and designing individual network components. These can include common tools for reasoning about systems of constraints of various classes (such as linear constraints, quadratic constraints, and so on), as well as logical systems and ontologies that deal with concepts relevant to the application domain. We integrate the AARTIFACT [14] lightweight automated assistant for formal reasoning (which has also been applied in proving the soundness of the NetSketch formalism [15]) as a tool for modeling and designing individual network components. We present use cases within the context of an example application of the NetSketch DSL that demonstrate how the automated assistant provides NetSketch users with both an interface for reasoning formally about constraints, and a straightforward way to implicitly employ a rich domain-specific ontology of logical propositions. This allows users to verify common properties of constraints and constraint sets, and to reason about constraint relationships using automatically verifiable algebraic manipulations.

show abstract

Section: Related Work and Conclusionsupporting

confidence: 54%

Section: Overview Of the Netsketch Formalismmentioning

confidence: 99%

Safe compositional network sketches

Bestavros

Kfoury

Lapets

et al. 2010

Proceedings of the 13th ACM International Conference on Hybrid Systems: Computation and Control

View full text Add to dashboard Cite

show abstract

“…Other example flow types are given through-out the paper, however an exhaustive account of the nature (and semantic) of these flow types is beyond the scope of this paper. We refer the reader to our work on using strong-typing for the compositional analysis of safety properties of networking applications [3] for some insight as to how flowtypes could be type checked for safety. SNAFU Compilation: SNAFU has been designed to ensure that the abstract syntax tree (AST) of a SNAFU program maps to a task dependency diagram in the form of a directed acyclic graph (DAG) with a single root.…”

Section: The Snafu Programming Languagementioning

confidence: 99%

“…SNAFU Compilation: SNAFU has been designed to ensure that the abstract syntax tree (AST) of a SNAFU program maps to a task dependency diagram in the form of a directed acyclic graph (DAG) with a single root. 3 Nodes in the DAG represent values, sensors or tasks while edges represent data communication/dependency between nodes. The graph is evaluated by lower nodes executing (using their children as input) and producing values to their parents such that values percolate up toward the root of the graph from the leaves.…”

Section: The Snafu Programming Languagementioning

confidence: 99%

snBench

Ocean

Bestavros

Kfoury

2006

Proceedings of the 2nd International Conference on Virtual Execution Environments

View full text Add to dashboard Cite

We envision future Sensor Networks (SNs) that will be composed of a hybrid collection of a variety of sensing devices embedded into shared environments. In such environments it follows that the embedded SN infrastructure would also be shared by various users, occupants, or administrators of these shared spaces. As such a clear need emerges to virtualize the SN, sharing the resources of the SN across various tasks executing simultaneously. To achieve this goal, we present the SNBENCH (SN Workbench). The SNBENCH abstracts a collection of dissimilar and disjoint resources into a shared virtual SN. The SNBENCH provides an accessible high-level programming language that enables users to write "macro-level" program for their own virtual SN (i.e., programs are written at the scope of the SN rather than its individual components and specific details of the components or deployment need not be specified by the developer). To this end SNBENCH provides execution environments and a run-time support infrastructure to provide each user a Virtual Sensor Network characterized by efficient automated program deployment, resource management, and a truly extensible architecture. In this paper we present an overview of the SNBENCH detailing its salient functionalities that support the entire life-cycle of a SN application.

show abstract

“…Interaction complexity has produced service incompatibilities that point out a fundamental weakness in our current layered-design methodology [7,8]. Increased choice has led to a proposal for end-to-end cross-layer negotiation [23].…”

Section: Related Workmentioning

confidence: 99%

A Dynamic Recursive Unified Internet Design (DRUID)

Touch¹,

Baldin

Dutta

et al. 2011

Computer Networks

View full text Add to dashboard Cite

a b s t r a c tThe Dynamic Recursive Unified Internet Design (DRUID) is a future Internet design that unifies overlay networks with conventional layered network architectures. DRUID is based on the fundamental concept of recursion, enabling a simple and direct network architecture that unifies the data, control, management, and security aspects of the current Internet, leading to a more trustworthy network. DRUID's architecture is based on a single recursive block that can adapt to support a variety of communication functions, including parameterized mechanisms for hard/soft state, flow and congestion control, sequence control, fragmentation and reassembly, compression, encryption, and error recovery. This recursion is guided by the structure of a graph of translation tables that help compartmentalize the scope of various functions and identifier spaces, while relating these spaces for resource discovery, resolution, and routing. The graph also organizes persistent state that coordinates behavior between individual data events (e.g., coordinating packets as a connection), among different associations (e.g., between connections), as well as helping optimize the recursive discovery process through caching, and supporting prefetching and distributed pre-coordination. This paper describes the DRUID architecture composed of these three parts (recursive block, translation tables, persistent state), and highlights its goals and benefits, including unifying the data, control, management, and security planes currently considered orthogonal aspects of network architecture.

show abstract

Typed Abstraction of Complex Network Compositions

Abstract: The

Cited by 4 publications

References 5 publications

Safe compositional network sketches

Safe compositional network sketches

snBench

A Dynamic Recursive Unified Internet Design (DRUID)

Contact Info

Product

Resources

About