Don't Mind the Gap: Bridging Network-wide Objectives and Device-level Configurations

@article{Beckett2016DontMT,
  title={Don't Mind the Gap: Bridging Network-wide Objectives and Device-level Configurations},
  author={Ryan Beckett and Ratul Mahajan and Todd D. Millstein and Jitendra Padhye and David Walker},
  journal={Proceedings of the 2016 ACM SIGCOMM Conference},
  year={2016}
}
We develop Propane, a language and compiler to help network operators with a challenging, error-prone task—bridging the gap between network-wide routing objectives and low-level configurations of devices that run complex, distributed protocols. [] Key Method The compiler automatically translates these specifications to router-level BGP configurations, using an effective intermediate representation that compactly encodes the flow of routing information along policy-compliant paths.
Synthesis of Fault-Tolerant Distributed Router Configurations
TLDR
Zeppelin is presented, a system for automatically generating policy-compliant control planes that also behave well under majority of small network failures, and it is shown that Zeppelin synthesizes highly resilient and policy- Compliant configurations for real topologies with up to 80 routers.
Synthesis of Fault-Tolerant Distributed Router Configurations
TLDR
Zeppelin is presented, a system for automatically generating policy-compliant control planes that also behave well under majority of small network failures, and it is shown that Zeppelin synthesizes highly resilient and policy- Compliant configurations for real topologies with up to 80 routers.
Synthesis of Fault-Tolerant Distributed Router Configurations
TLDR
Zeppelin is presented, a system for automatically generating policy-compliant control planes that also behave well under majority of small network failures, and it is shown that Zeppelin synthesizes highly resilient and policy- Compliant configurations for real topologies with up to 80 routers.
Synthesizing Performance-Aware Routing Protocols from Network-Wide Policies
TLDR
The experiments show that the synthesis algorithms scale to large networks, and that in terms of flow completion times, the generated data-plane programs are competitive with hand-crafted systems that have been specialized to specific topologies and policies.
Contra: A Programmable System for Performance-aware Routing
TLDR
Contra can be configured to operate seamlessly over any network topology and a wide variety of sophisticated routing policies, and is competitive with hand-crafted systems that have been customized for specific topologies and policies.
Automatically Repairing Network Control Planes Using an Abstract Representation
TLDR
Inspired by recent work in automatic program repair, CPR is introduced, a system that automatically computes correct, minimal repairs for network control planes and casts configuration repair as a MaxSMT problem whose constraints are based on a digraph-based representation of a control plane's semantics.
Synthesis of Fault-Tolerant Distributed Router Configurations
TLDR
Programming networks to correctly forward flows according to user- and application-induced policies is difficult and error-prone and performance, security, or availability problems may arise.
Config2Spec: Mining Network Specifications from Network Configurations
TLDR
This work presents Config2Spec, a system that automatically synthesizes a formal specification (a set of policies) of a network given its configuration and a failure model (e.g., up to two link failures).
Implementing Geo-Blocking and Spoofing Protection in Multi-Domain Software Defined Interconnects
TLDR
This paper proposes a system for high-level specification and synthesis of intents for Geo-Blocking and IP Spoofing protection at a Software Defined Interconnect, and defines a grammar for specifying the security policies, and a compiler for converting these to connectivity rules.
A General Approach to Network Configuration Verification
We present Minesweeper, a tool to verify that a network satisfies a wide range of intended properties such as reachability or isolation among nodes, waypointing, black holes, bounded path length,
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 55 REFERENCES
Languages for software-defined networks
TLDR
The Frenetic project is designing simple and intuitive abstractions for programming the three main stages of network management: monitoring network traffic, specifying and composing packet forwarding policies, and updating policies in a consistent way to reach SDNs full potential.
A compiler and run-time system for network programming languages
TLDR
A new design for a high-level network programming language; an improved set of compiler algorithms; a new run-time system for SDN architectures; the first formal semantics and proofs of correctness in this domain; and an implementation and evaluation that demonstrates the performance benefits over traditional manual techniques.
Automatically Repairing Network Control Planes Using an Abstract Representation
TLDR
Inspired by recent work in automatic program repair, CPR is introduced, a system that automatically computes correct, minimal repairs for network control planes and casts configuration repair as a MaxSMT problem whose constraints are based on a digraph-based representation of a control plane's semantics.
Merlin: A Language for Provisioning Network Resources
TLDR
Overall, Merlin simplifies network administration by providing high-level abstractions for specifying network policies that provision network resources.
Frenetic: a network programming language
TLDR
Frenetic provides a declarative query language for classifying and aggregating network traffic as well as a functional reactive combinator library for describing high-level packet-forwarding policies, which facilitates modular reasoning and enables code reuse.
Network Control Plane Synthesis and Verification
TLDR
A formal model of network routing protocols is developed and it is shown how many common protocols can be translated to logic constraints that existing constraint solvers can solve to find and prevent bugs in configurations.
Proactive techniques for correct and predictable Internet routing
TLDR
This dissertation develops techniques to reason about the dynamic behavior of Internet routing, based on static analysis of the router configurations, before the protocol ever runs on a live network, to achieve the goal of proactively ensuring correct and predictable Internet routing.
Network configuration synthesis with abstract topologies
We develop Propane/AT, a system to synthesize provably-correct BGP (border gateway protocol) configurations for large, evolving networks from high-level specifications of topology, routing policy,
A scalable, commodity data center network architecture
TLDR
This paper shows how to leverage largely commodity Ethernet switches to support the full aggregate bandwidth of clusters consisting of tens of thousands of elements and argues that appropriately architected and interconnected commodity switches may deliver more performance at less cost than available from today's higher-end solutions.
Abstractions for network update
TLDR
This paper introduces the notion of consistent network updates---updates that are guaranteed to preserve well-defined behaviors when transitioning mbetween configurations, and identifies two distinct consistency levels, per-packet and per-flow.
...
1
2
3
4
5
...