extract: 2016-00-00-corless-aimd-dynamics-distributed-resource-allocation

Pentagon-Agent: Ganymede <F99EBFA6-547B-4096-BEEA-1D59C3E4028A>

domains/internet-finance/aimd-converges-to-fair-resource-allocation-without-global-coordination-through-local-congestion-signals.md

@@ -0,0 +1,37 @@
+---
+type: claim
+domain: internet-finance
+description: "AIMD algorithm achieves provably fair and stable distributed resource allocation using only local congestion feedback"
+confidence: proven
+source: "Corless, King, Shorten, Wirth (SIAM 2016) - AIMD Dynamics and Distributed Resource Allocation"
+created: 2026-03-11
+secondary_domains: [mechanisms, collective-intelligence]
+---
+
+# AIMD converges to fair resource allocation without global coordination through local congestion signals
+
+Additive Increase Multiplicative Decrease (AIMD) is a distributed resource allocation algorithm that provably converges to fair and stable resource sharing among competing agents without requiring centralized control or global information. The algorithm operates through two simple rules: when no congestion is detected, increase resource usage additively (rate += α); when congestion is detected, decrease resource usage multiplicatively (rate *= β, where 0 < β < 1).
+
+The SIAM monograph by Corless et al. demonstrates that AIMD is mathematically guaranteed to converge to equal sharing of available capacity regardless of the number of agents or parameter values. Each agent only needs to observe local congestion signals—no knowledge of other agents, total capacity, or system-wide state is required. This makes AIMD the most widely deployed distributed resource allocation mechanism, originally developed for TCP congestion control and now applicable to smart grid energy allocation, distributed computing, and other domains where multiple agents compete for shared resources.
+
+The key insight is that AIMD doesn't require predicting load, modeling arrivals, or solving optimization problems. It reacts to observed system state through simple local rules and is guaranteed to find the fair allocation through the dynamics of the algorithm itself. The multiplicative decrease creates faster convergence than purely additive approaches, while the additive increase ensures fairness rather than proportional allocation.
+
+## Evidence
+
+- Corless, King, Shorten, Wirth (2016) provide mathematical proofs of convergence and fairness properties
+- AIMD is the foundation of TCP congestion control, the most widely deployed distributed algorithm in existence
+- The algorithm works across heterogeneous domains: internet bandwidth, energy grids, computing resources
+- Convergence is guaranteed regardless of number of competing agents or their parameter choices
+
+---
+
+Relevant Notes:
+- [[coordination mechanisms]]
+- [[optimal governance requires mixing mechanisms because different decisions have different manipulation risk profiles]]
+- [[collective intelligence requires diversity as a structural precondition not a moral preference]]
+- [[designing coordination rules is categorically different from designing coordination outcomes as nine intellectual traditions independently confirm]]
+
+Topics:
+- domains/internet-finance/_map
+- core/mechanisms/_map
+- foundations/collective-intelligence/_map

domains/internet-finance/aimd-scaling-solves-variable-load-expensive-compute-coordination-without-prediction.md

@@ -0,0 +1,46 @@
+---
+type: claim
+domain: internet-finance
+description: "AIMD provides principled autoscaling for systems with expensive compute and variable load by reacting to queue state rather than forecasting demand"
+confidence: experimental
+source: "Corless et al. (SIAM 2016) applied to Teleo pipeline architecture"
+created: 2026-03-11
+secondary_domains: [mechanisms, critical-systems]
+---
+
+# AIMD scaling solves variable-load expensive-compute coordination without prediction
+
+For systems with expensive computational operations and highly variable load—such as AI evaluation pipelines where extraction is cheap but evaluation is costly—AIMD provides a principled scaling algorithm that doesn't require demand forecasting or optimization modeling. The algorithm operates by observing queue state: when the evaluation queue is shrinking (no congestion), increase extraction workers by 1 per cycle; when the queue is growing (congestion detected), halve extraction workers.
+
+This approach is particularly well-suited to scenarios where:
+1. Downstream operations (evaluation) are significantly more expensive than upstream operations (extraction)
+2. Load is unpredictable and varies substantially over time
+3. The cost of overprovisioning is high (wasted expensive compute)
+4. The cost of underprovisioning is manageable (slightly longer queue wait times)
+
+The AIMD dynamics guarantee convergence to a stable operating point where extraction rate matches evaluation capacity, without requiring any prediction of future load, modeling of arrival patterns, or solution of optimization problems. The system self-regulates through observed congestion signals (queue growth/shrinkage) and simple local rules.
+
+The multiplicative decrease (halving workers on congestion) provides rapid response to capacity constraints, while the additive increase (adding one worker when uncongested) provides gradual scaling that avoids overshooting. This asymmetry is critical: it's better to scale down too aggressively and scale up conservatively than vice versa when downstream compute is expensive.
+
+## Evidence
+
+- Corless et al. (2016) prove AIMD convergence properties hold for general resource allocation problems beyond network bandwidth
+- The Teleo pipeline architecture exhibits the exact characteristics AIMD is designed for: cheap extraction, expensive evaluation, variable load
+- AIMD's "no prediction required" property eliminates the complexity and fragility of load forecasting models
+- The algorithm's proven stability guarantees mean it won't oscillate or diverge regardless of load patterns
+
+## Challenges
+
+This is an application of proven AIMD theory to a specific system architecture, but the actual performance in the Teleo pipeline context is untested. The claim that AIMD is "perfect for" this setting is theoretical—empirical validation would strengthen confidence from experimental to likely.
+
+---
+
+Relevant Notes:
+- [[aimd-converges-to-fair-resource-allocation-without-global-coordination-through-local-congestion-signals]] <!-- claim pending -->
+- [[coordination mechanisms]]
+- [[designing coordination rules is categorically different from designing coordination outcomes as nine intellectual traditions independently confirm]]
+
+Topics:
+- domains/internet-finance/_map
+- core/mechanisms/_map
+- foundations/critical-systems/_map

inbox/archive/2016-00-00-corless-aimd-dynamics-distributed-resource-allocation.md

@@ -6,8 +6,13 @@ url: https://epubs.siam.org/doi/book/10.1137/1.9781611974225
 date: 2016-01-01
 domain: internet-finance
 format: paper
-status: unprocessed
+status: processed
 tags: [pipeline-architecture, operations-research, AIMD, distributed-resource-allocation, congestion-control, fairness]
+processed_by: rio
+processed_date: 2026-03-11
+claims_extracted: ["aimd-converges-to-fair-resource-allocation-without-global-coordination-through-local-congestion-signals.md", "aimd-scaling-solves-variable-load-expensive-compute-coordination-without-prediction.md"]
+extraction_model: "anthropic/claude-sonnet-4.5"
+extraction_notes: "Extracted two claims: (1) general AIMD mechanism properties as proven coordination algorithm, (2) specific application to Teleo pipeline architecture. The source is a formal mathematical treatment (SIAM monograph) providing rigorous proofs, making the first claim 'proven' confidence. The second claim is an application proposal with theoretical justification but no empirical validation, hence 'experimental'. No entities to extract—this is pure mechanism theory. No enrichments—AIMD is not currently referenced in the KB."
 ---
 
 # AIMD Dynamics and Distributed Resource Allocation
@@ -26,3 +31,10 @@ SIAM monograph on AIMD (Additive Increase Multiplicative Decrease) as a general-
 ## Relevance to Teleo Pipeline
 
 AIMD provides a principled, proven scaling algorithm: when eval queue is shrinking (no congestion), increase extraction workers by 1 per cycle. When eval queue is growing (congestion), halve extraction workers. This doesn't require predicting load, modeling arrivals, or solving optimization problems — it reacts to observed system state and is mathematically guaranteed to converge. Perfect for our "expensive compute, variable load" setting.
+
+
+## Key Facts
+- AIMD algorithm: additive increase (rate += α) when no congestion, multiplicative decrease (rate *= β, 0 < β < 1) when congestion detected
+- AIMD is the foundation of TCP congestion control
+- AIMD has been applied to internet congestion control, smart grid energy allocation, and distributed computing
+- AIMD convergence is mathematically proven regardless of number of agents or parameter values