Simpler Network Configuration with State-Based Network Policies
MetadataShow full item record
Operators make hundreds of changes to a network’s router and switch configurations every day—a painstaking, error-prone process. If the network configuration could instead encode different forwarding behavior for different network states a priori, a network controller could automatically alter forwarding behavior when conditions change. To enable this capability, we introduce state-based network policies, which describe how a network’s forwarding behavior should change in response to arbitrary network events. A state-based network policy comprises many tasks, each of which encodes the forwarding behavior for a single network management operation (e.g., intrusion detection) or part of the network (e.g., a sub-organization), and how that behavior should change when network conditions change. Composing these policies produces a network-wide control program that adapts to different operating conditions. We implement state-based network policies in a system called PyResonance and demonstrate with real-world examples and use cases that PyResonance is expressive enough to specify a wide range of network policies and simple enough for many operators to use. Our evaluation based on event traces from the Georgia Tech campus network shows that PyResonance can achieve good performance in operational settings.
Showing items related by title, author, creator and subject.
Enhancing capabilities of the network data plane using network virtualization and software defined networking Anwer, Muhammad Bilal (Georgia Institute of Technology, 2015-11-13)Enhancement of network data-plane functionality is an open problem that has recently gained momentum. Addition and programmability of new functions inside the network data-plane to enable high speed, complex network ...
Fault study and ground fault protection of a network system, Tennessee Public Service Company, Knoxville 132 KV network system Graham, Charles Hancock (Georgia Institute of Technology, 1932-05)
On the Fundamental Tradeoffs between Routing Table Size and Network Diameter in Peer-to-Peer Networks Xu, Jun (Georgia Institute of Technology, 2002)In this work, we study a fundamental tradeoff issue in designing dynamic hash table (DHT) in peer-to-peer networks: the size of the routing table v.s. the network diameter. It was observed in Ratnasamy et al. that existing ...