Name
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1145/2491185.2491186 | HotSDN |
Keywords | Field | DocType |
cap theorem,strong consistency,practical design lesson,tenant isolation,datastore system,middlebox traversal,software-defined network,partition tolerance,network policy,software defined network,computer and information science,availability,correctness | Tree traversal,Middlebox,Computer science,CAP theorem,Correctness,Computer network,Implementation,Software-defined networking,Strong consistency,Information and Computer Science,Distributed computing | Conference |
Citations | PageRank | References |
11 | 0.88 | 18 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Aurojit Panda | 1 | 760 | 38.57 |
| Colin Scott | 2 | 433 | 22.85 |
| Ali Ghodsi | 3 | 3306 | 156.01 |
| Teemu Koponen | 4 | 3057 | 287.69 |
| Scott Shenker | 5 | 29892 | 2677.04 |