Kinetic: Verifiable Dynamic Network Control
نویسندگان
چکیده
Network conditions are dynamic; unfortunately, current approaches to configuring networks are not. Network operators need tools to express how a network’s data-plane behavior should respond to a wide range of events and changing conditions, ranging from unexpected failures to shifting traffic patterns to planned maintenance. Yet, to update the network configuration today, operators typically rely on a combination of manual intervention and ad hoc scripts. In this paper, we present Kinetic, a domain specific language and network control system that enables operators to control their networks dynamically in a concise, intuitive way. Kinetic also automatically verifies the correctness of these control programs with respect to userspecified temporal properties. Our user study of Kinetic with several hundred network operators demonstrates that Kinetic is intuitive and usable, and our performance evaluation shows that realistic Kinetic programs scale well with the number of policies and the size of the network.
منابع مشابه
Fully-Dynamic Verifiable Zero-Knowledge Order Queries for Network Data
We show how to provide privacy-preserving (zero-knowledge) answers to order queries on network data that is organized in lists, trees, and partially-ordered sets of bounded dimension. Our methods are efficient and dynamic, in that they allow for updates in the ordering information while also providing for quick and verifiable answers to queries that reveal no information besides the answers to ...
متن کاملEfficient Dynamic-Resharing "Verifiable Secret Sharing" Against Mobile Adversary
We present a novel efficient variant of Verifiable Secret Sharing (VSS) where the dealing of shares is dynamically refreshed (without changing or corrupting the secret) against the threat of the recently considered mobile adversary that may control all the trustees, but only a bounded number thereof at any time period. VSS enables a dealer to distribute its secret to a set of trustees, so that ...
متن کاملInferring dynamic properties of biochemical reaction networks from structural knowledge.
Functional properties of biochemical networks depend on both the network structure and the kinetic parameters. Extensive data on metabolic network topologies have been collected in databases, but much less information is available about the kinetic constants or metabolite concentrations. Depending on the values of these parameters, metabolic fluxes and control coefficients may vary within a wid...
متن کاملOptimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کاملSimulation and Control of a Methanol-To-Olefins (MTO) Laboratory Fixed-Bed Reactor
In this research, modeling, simulation, and control of a methanol-to-olefins laboratory fixed-bed reactor with electrical resistance furnace have been investigated in both steady-state and dynamic conditions. The reactor was modeled as a one-dimensional pseudo-homogeneous system. Then, the reactor was simulated at steady-state conditions and the effect of different parameters including...
متن کامل