CAP for networks

Aurojit Panda, Colin Scott, Ali Ghodsi, Teemu Koponen, Scott Shenker

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationHotSDN 2013 - Proceedings of the 2013 ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking
Pages91-96
Number of pages6
DOIs
StatePublished - 2013
Event2013 2nd ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking, HotSDN 2013 - Hong Kong, China
Duration: Aug 16 2013Aug 16 2013

Publication series

NameHotSDN 2013 - Proceedings of the 2013 ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking

Other

Other2013 2nd ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking, HotSDN 2013
CountryChina
CityHong Kong
Period8/16/138/16/13

Keywords

  • Availability
  • Correctness
  • Distributed controllers
  • Software defined network

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Software

Fingerprint Dive into the research topics of 'CAP for networks'. Together they form a unique fingerprint.

  • Cite this

    Panda, A., Scott, C., Ghodsi, A., Koponen, T., & Shenker, S. (2013). CAP for networks. In HotSDN 2013 - Proceedings of the 2013 ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking (pp. 91-96). (HotSDN 2013 - Proceedings of the 2013 ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking). https://doi.org/10.1145/2491185.2491186