Types of Failures to Inject

Every production incident, every outage postmortem, every late-night page can be traced back to one or more fundamental failure modes. The systems we build—no matter how carefully designed—exist within an environment where failure is not just possible but inevitable. Networks partition. Servers crash. Disks fill up. Clocks drift. Dependencies become unavailable.

The question isn't whether these failures will occur, but whether your system will handle them gracefully when they do. Failure injection—the deliberate introduction of controlled failures into a running system—provides the means to answer this question proactively, on your terms, during business hours, rather than at 3 AM when an actual incident strikes.

Before diving into specific failure types, we must understand why we inject failures in the first place. This practice rests on a fundamental insight from chaos engineering: systems behave differently under failure conditions than they do under normal operation, and the only way to truly understand that behavior is to observe it directly.

Traditional testing methodologies—unit tests, integration tests, even sophisticated end-to-end tests—typically operate under the assumption that infrastructure behaves correctly. The network delivers packets. The database accepts writes. The cache returns values. But production environments are harsh, and these assumptions routinely break.

Failure injection bridges this gap by forcing systems to confront the very conditions that production will eventually impose. The goal is not to break things randomly but to explore specific hypotheses about system behavior under adverse conditions.

The Failure Spectrum

Failures exist on a spectrum from complete and obvious to subtle and insidious:

• Hard failures: Complete unavailability—a server that's entirely unreachable, a database that refuses all connections. These are often the easier failures to handle because they're unambiguous. The system knows the dependency is dead.

• Soft failures: Partial degradation—a server that responds slowly, a database that accepts some writes but rejects others, a network that drops occasional packets. These are far more dangerous because they're ambiguous. The system may not realize it's sick.

• Byzantine failures: Incorrect behavior—a server that returns wrong data, a clock that reports the wrong time, a disk that confirms writes it never persisted. These are the most dangerous because they violate fundamental assumptions the system makes about its environment.

Effective failure injection exercises the entire spectrum, not just the easy cases. Your system might handle a dead database beautifully while completely failing when that same database becomes slow.

We can organize injectable failures into five major categories, each targeting different layers of the distributed systems stack. Understanding this taxonomy is essential because it ensures you're not testing the same failure modes repeatedly while leaving others completely unexplored.

Each category targets fundamentally different assumptions your system makes about its environment:

Network failures test the assumption that services can communicate reliably. In a distributed system, network is the only thing connecting your services—when it fails, partitioned components must decide independently how to proceed.

Service failures test the assumption that dependencies will be available when needed. Every external call—to a database, cache, API, or microservice—is a potential failure point that your error handling must address.

Resource exhaustion tests the assumption that infrastructure resources are abundant. Modern systems are designed to scale, but resource limits—memory, CPU, disk, file descriptors—impose hard boundaries that can cause unexpected failures.

Clock/time failures test the assumption that time is consistent and reliable. Distributed systems often depend on time for ordering events, expiring cache entries, and coordinating distributed algorithms.

Data/state failures test the assumption that storage systems preserve and return correct data. When these assumptions break, the consequences can range from minor inconsistencies to catastrophic data loss.

Network failures are perhaps the most common category of injectable failures because networks are inherently unreliable. Even within a single data center, network issues occur regularly due to hardware failures, configuration errors, capacity constraints, and software bugs in network equipment.

Service failures target the application layer—the actual software components that make up your distributed system. While network failures test infrastructure, service failures test application logic and error handling code paths.

The Hierarchy of Service Failures

Service failures can be organized by their scope and detectability:

The most dangerous failures are those with low detectability. Your monitoring might show all services as healthy while users experience consistent errors from the subset of traffic routed to degraded instances.

Resource exhaustion represents some of the most insidious failure modes because they typically don't cause immediate failures. Instead, they cause gradual degradation that compounds over time, making them difficult to detect and diagnose before they cause serious problems.

Time-related failures are among the most subtle and dangerous because distributed systems often make implicit assumptions about time that developers don't even realize exist. When clocks drift or jump, these hidden assumptions can cause surprising and difficult-to-debug failures.

Why Clock Failures Matter

Many distributed systems depend on time for correctness:

• Distributed locks often use lease timeouts—if clocks are skewed, a node might believe it holds a lock it has already lost
• Cache expiration depends on consistent time—skewed clocks can cause stale cache hits or premature evictions
• Event ordering in log aggregation assumes comparable timestamps—clock skew can cause events to appear out of order
• Rate limiting often uses time windows—a jumping clock can allow burst traffic that should be limited
• Distributed consensus algorithms like Raft use time for leader election—clock issues can cause split-brain
• Certificate validation checks timestamps—a jumping clock can invalidate valid certificates or accept expired ones

These dependencies are often implicit in library code or infrastructure components, making them easy to overlook during system design.

Data and state failures are the most severe category because they can result in permanent data loss or corruption. These failures test the most fundamental assumptions about storage system behavior—that writes persist and reads return the correct data.