The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Evolve or Die: High-Availability Design Principles Drawn from Googles Network Infrastructure
Open accessAbstract
Maintaining the highest levels of availability for content providers is challenging in the face of scale, network evolution and complexity. Little, however, is known about failures large content providers are susceptible to, and what mechanisms they employ to ensure high availability. From a detailed analysis of over 100 high-impact failure events in a global-scale content provider encompassing several data centers and two WANs, we quantify several dimensions of availability failures. We find that failures are evenly distributed across different network types and planes, but that a large number of failures happen when a management operation is in progress within the network. We discuss some of these failures in detail, and also describe our design principles for high availability motivated by these failures, including using defense in depth, maintaining consistency across planes, failing open on large failures, carefully preventing and avoiding failures, and assessing root cause quickly. Our findings suggest that, as networks become more complicated, failures lurk everywhere, and, counter-intuitively, continuous incremental evolution of the network can, when applied together with our design principles, result in a more robust network.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Understanding network failures in data centers: measurement, analysis, and implications
Gill, P., Jain, N., & Nagappan, N. (2011) · Proceedings of the ACM SIGCOMM 2011 conference · doi:10.1145/2018436.2018477 · Cited by 714
Understanding BGP misconfiguration
Mahajan, R., Wetherall, D., & Anderson, T. (2002) · Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/633025.633027 · Cited by 533 · cited 2×
“Other management plane root-cause categories include: routing misconfigurations similar to those explored in prior work [29, 31]; competing drains or upgrades triggered by concurrent and mutually conflicting MOps; incorrect/incomplete management processes where the wrong set of instructions was used during an operatio…”
BackgroundCalifornia fault lines: understanding the causes and impact of network failures
Turner, D., Levchenko, K., Snoeren, A. C., & Savage, S. (2010) · Proceedings of the ACM SIGCOMM 2010 conference · doi:10.1145/1851182.1851220 · Cited by 164 · cited 1×
“More recent work has explored link, device, and component failures in enterprises [37], academic networks [34], and data centers [13], using other sources of information, including syslog errors, trouble tickets and customer complaints.”
Background
Cited by
DRILL: Micro Load Balancing for Low-latency Data Center Networks
Ghorbani, S., Yang, Z., Godfrey, P. B., Ganjali, Y., & Firoozshahian, A. (2017) · Proceedings of the Conference of the ACM Special Interest Group on Data Communication · doi:10.1145/3098822.3098839 · Cited by 271
Mining causality of network events in log data
Kobayashi, S., Otomo, K., Fukuda, K., & Esaki, H. (2018) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2017.2778096 · Cited by 63
Risk based planning of network changes in evolving data centers
Alipourfard, O., Gao, J., Koenig, J., Harshaw, C., Vahdat, A., & Yu, M. (2019) · Proceedings of the 27th ACM Symposium on Operating Systems Principles · doi:10.1145/3341301.3359664 · Cited by 18
“Some risks are easier to estimate than others; for example, operators keep historical failures of devices, which makes it easy to determine the risk of failures for network devices [2, 17, 22].”
BackgroundMethodInfluentialSelf-citationIlgner, P., Cika, P., & Stusek, M. (2021) · Sensors · doi:10.3390/s21206793 · Cited by 4
“Notably, high availability is achieved via redundant connection with more than one load balancer [6,17].”
Background
Metadata
- Authors
- Govindan, R., Minei, I., Kallahalla, M., Koley, B., & Vahdat, A.
- Venue
- Proceedings of the 2016 ACM SIGCOMM Conference
- Publisher
- ACM
- Published
- 2016-08-22
- Pages
- 58-72
- OpenAlex
- W2480346368
- Cited by
- 215
- References
- 3
- FWCI
- 21.48
- Type
- conference paper
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.