CAP for networks
2013 (English)In: HotSDN 2013 - Proceedings of the 2013 ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking, Association for Computing Machinery (ACM), 2013, 91-96 p.Conference paper (Refereed)
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.
Place, publisher, year, edition, pages
Association for Computing Machinery (ACM), 2013. 91-96 p.
Availability, Correctness, Distributed controllers, Software defined network
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-133277DOI: 10.1145/2491185.2491186ScopusID: 2-s2.0-84883672874ISBN: 978-145032056-6OAI: oai:DiVA.org:kth-133277DiVA: diva2:660725
2013 2nd ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking, HotSDN 2013, 16 August 2013 through 16 August 2013, Hong Kong
QC 201310302013-10-302013-10-292013-10-30Bibliographically approved