Queue depth without throughput says nothing: a hundred jobs is fine at fifty a second and an incident at one a minute. Oldest-waiting-age is a direct measure of…
A sequence of steps across services cannot be rolled back, so each step has a compensating action that undoes its effect after the fact. The compensations are business…
A consumer group can have at most one consumer per partition, so the partition count is the maximum useful number of consumers. The inability to reduce the count…
A queue with no bound converts an overload into a latency problem that appears hours later and cannot be reasoned about. Framing the bound as a staleness budget…
Kafka guarantees order within a partition and nothing across partitions, which means the key choice is the ordering design. Choosing the key is choosing what is ordered relative…