CAP for networks

Authors:
Aurojit Panda;Colin Scott;Ali Ghodsi;Teemu Koponen;Scott Shenker
Affiliations:
UC Berkeley, Berkeley, CA, USA;UC Berkeley, Berkeley, CA, USA;UC Berkeley, KTH/Royal Institute of Technology, Berkeley, CA, USA;VMWare, Palo Alto, CA, USA;UC Berkeley, ICSI, Berkeley, CA, USA
Venue:
Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking
Year:
2013

Citing 15
Cited 0

The design philosophy of the DARPA internet protocols

SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Linearizability: a correctness condition for concurrent objects

ACM Transactions on Programming Languages and Systems (TOPLAS)
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
Towards an active network architecture

ACM SIGCOMM Computer Communication Review
Towards robust distributed systems (abstract)

Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services

ACM SIGACT News
Ethane: taking control of the enterprise

Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Achieving convergence-free routing using failure-carrying packets

Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
PortLand: a scalable fault-tolerant layer 2 data center network fabric

Proceedings of the ACM SIGCOMM 2009 conference on Data communication
VL2: a scalable and flexible data center network

Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Understanding network failures in data centers: measurement, analysis, and implications

Proceedings of the ACM SIGCOMM 2011 conference
Don't settle for eventual: scalable causal consistency for wide-area storage with COPS

SOSP '11 Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles
Abstractions for network update

Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Bolt-on causal consistency

Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
HAT, not CAP: towards highly available transactions

HotOS'13 Proceedings of the 14th USENIX conference on Hot Topics in Operating Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The CAP theorem showed that it is impossible for datastore systems to achieve all three of strong consistency, availability and partition tolerance. In this paper we investigate how these trade-offs apply to software-defined networks. Specifically, we investigate network policies such as tenant isolation and middlebox traversal, and prove that it is impossible for implementations to enforce them without sacrificing availability. We conclude by distilling practical design lessons from our observations.