Skip to main content

> CHAPTER 08 // SCALED // 23 MIN READ

Reactive Streams, Flow Control & Dynamic Load Shedding

Defending microservices against cascading backpressure collapse: pull-based subscriber demand contracts (`request(n)`), Little’s Law concurrency limits, TCP Vegas gradient algorithms, and CoDel queue management.

OverviewCAP & PACELCArchitectures18Topology SizerInteractiveManuals10Comparison Matrix22
Back to Manuals Library (10 Chapters)📜 Reactive Streams Specification / Little’s Law ($L = \lambda W$)
CHAPTER 0823 min readReactive Streams Specification / Little’s Law ($L = \lambda W$)

Reactive Streams, Flow Control & Dynamic Load Shedding

Defending microservices against cascading backpressure collapse: pull-based subscriber demand contracts (`request(n)`), Little’s Law concurrency limits, TCP Vegas gradient algorithms, and CoDel queue management.

Core Concepts:Reactive StreamsPull BackpressureAdaptive Concurrency LimitsLittle’s LawCoDel Active Queue Management

Reactive Streams, Flow Control & Dynamic Load Shedding

Content file 08-reactive-backpressure-flow-control.md not found.

PREVIOUS CHAPTERIdempotency Keys, Exactly-Once Semantics (EOS) & Double-Spend DefenseNEXT CHAPTERDistributed Tracing, W3C TraceContext & Causal Graph Propagation