Change search
ReferencesLink to record
Permanent link

Direct link
CAP for networks
KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
Show others and affiliations
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)
Abstract [en]

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.
Keyword [en]
Availability, Correctness, Distributed controllers, Software defined network
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-133277DOI: 10.1145/2491185.2491186ScopusID: 2-s2.0-84883672874ISBN: 978-145032056-6OAI: 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 20131030

Available from: 2013-10-30 Created: 2013-10-29 Last updated: 2013-10-30Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Ghodsi, Ali
By organisation
Software and Computer systems, SCS
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 28 hits
ReferencesLink to record
Permanent link

Direct link