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 - Sep 16 2013
Event2013 2nd ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking, HotSDN 2013 - Hong Kong, China
Duration: Aug 16 2013Aug 16 2013

Other

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

Fingerprint

Availability

Keywords

  • Availability
  • Correctness
  • Distributed controllers
  • Software defined network

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Software

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) https://doi.org/10.1145/2491185.2491186

CAP for networks. / Panda, Aurojit; Scott, Colin; Ghodsi, Ali; Koponen, Teemu; Shenker, Scott.

HotSDN 2013 - Proceedings of the 2013 ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking. 2013. p. 91-96.

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

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, 2013 2nd ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking, HotSDN 2013, Hong Kong, China, 8/16/13. https://doi.org/10.1145/2491185.2491186
Panda A, Scott C, Ghodsi A, Koponen T, Shenker S. CAP for networks. In HotSDN 2013 - Proceedings of the 2013 ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking. 2013. p. 91-96 https://doi.org/10.1145/2491185.2491186
Panda, Aurojit ; Scott, Colin ; Ghodsi, Ali ; Koponen, Teemu ; Shenker, Scott. / CAP for networks. HotSDN 2013 - Proceedings of the 2013 ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking. 2013. pp. 91-96
@inproceedings{8c9b548a868d4255bf9702a57f459d0d,
title = "CAP for networks",
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.",
keywords = "Availability, Correctness, Distributed controllers, Software defined network",
author = "Aurojit Panda and Colin Scott and Ali Ghodsi and Teemu Koponen and Scott Shenker",
year = "2013",
month = "9",
day = "16",
doi = "10.1145/2491185.2491186",
language = "English (US)",
isbn = "9781450320566",
pages = "91--96",
booktitle = "HotSDN 2013 - Proceedings of the 2013 ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking",

}

TY - GEN

T1 - CAP for networks

AU - Panda, Aurojit

AU - Scott, Colin

AU - Ghodsi, Ali

AU - Koponen, Teemu

AU - Shenker, Scott

PY - 2013/9/16

Y1 - 2013/9/16

N2 - 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.

AB - 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.

KW - Availability

KW - Correctness

KW - Distributed controllers

KW - Software defined network

UR - http://www.scopus.com/inward/record.url?scp=84883672874&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84883672874&partnerID=8YFLogxK

U2 - 10.1145/2491185.2491186

DO - 10.1145/2491185.2491186

M3 - Conference contribution

SN - 9781450320566

SP - 91

EP - 96

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

ER -