SOX provider failover and degradation architecture for enterprise LLM deployment — Reference Architecture
The control that resolves this is a Labelled Degradation Ladder, evaluated before the request reaches a model provider rather than audited afterwards. In regulated enterprise the binding constraint is SOX, and the question it actually asks is can an AI-influenced number in a filing be traced and reproduced. The shape below holds p95 ≤ 600ms over REST over HTTPS, and ships with a standard-library implementation that runs as written.
System architecture
Labelled Degradation Ladder — the request path, with the decision points that must exist before the first model call:
flowchart LR
REQ[Request + min_quality] --> T1{Tier 1 breaker closed?}
T1 -->|open| T2{Tier 2}
T1 -->|closed| CALL1[Call tier 1]
CALL1 -->|fails| BRK[Record failure<br/>maybe open breaker] --> T2
T2 -->|below min_quality| REFUSE[Refuse: no acceptable tier]
T2 -->|ok| CALL2[Call tier 2] --> LAB[Label response<br/>degraded=true]Component breakdown
- Quality-ranked tiers — Explicit integer quality per provider, not an implicit order.
- Circuit breaker — A failing tier leaves rotation instead of being retried into the ground.
- Half-open probe — One probe after cooldown; recovery is tested, not assumed.
- Tier label on response — Every answer names its tier and whether it was degraded.
- Quality floor per caller — A caller declares a minimum; below it is a refusal.
- Degradation events — Each failover recorded — the signal the incident needs.
Deployment parameters
Every value below is a parameter you can hold a vendor or an internal team to. Adjectives are not acceptance criteria.
| Deployment vector | Customer-managed VPC, provider model endpoint pinned to region |
|---|---|
| Security standard | SOX |
| Applicable regimes | SOC 2 Type II, ISO/IEC 27001:2022, GDPR |
| Latency SLA | p95 ≤ 600ms — interactive surfaces need sub-second; batch jobs do not |
| Integration protocol | REST over HTTPS — the widest compatibility and the easiest audit story |
| Idempotency control | an Idempotency-Key header, honoured for 24h |
| Throughput envelope | ~2k rps per gateway node before connection churn dominates |
| Middleware requirement | policy decision point in front of the model gateway |
| Data classes in scope | PII, commercial-in-confidence data |
| Retention obligation | per the data class retention schedule, enforced automatically |
| Data residency | contracted processing region, asserted on every response |
| Contractual instrument | DPA plus a disclosed subprocessor list |
| Systems of record | SAP, Salesforce, Workday |
| Primary failure mode | a retried POST creating a duplicate record |
Where the rollout actually stalls
When the primary provider degrades, traffic fails over to a weaker model and the answers keep flowing. Nobody downstream is told the quality changed, so the incident is discovered in complaints.
What SOX specifically requires
SOX cares about the integrity of financial reporting. If a model output touches a number that reaches a filing, the control question is whether that output can be reproduced exactly and attributed to a reviewed, approved version.
The artifact that satisfies it is reproducible output records pinned to a model version. The way teams most often fail it: a model upgrade changing a reported figure with no record of which version produced the original.
Reference implementation — Degradation ladder with circuit breaker and quality floor
Standard-library Python, no external dependencies, runs as written. Executed by the publish gate: if it raises, this page does not ship. Wire it behind REST over HTTPS; the failure mode it guards against is a retried POST creating a duplicate record. The output you hand the assessor is the reporting-period reproducibility record.
"""Degradation ladder with a circuit breaker and labelled quality tiers.
The failure: a provider degrades, traffic silently fails over to a weaker
model, and nobody downstream knows the answer came from a lower tier. The
control is that degradation is explicit and labelled on the response, so a
consumer can refuse a tier it cannot accept, and that a failing provider is
taken out of rotation rather than retried into the ground.
"""
import time
class ProviderDown(Exception):
pass
class CircuitBreaker:
def __init__(self, threshold: int = 3, cooldown_s: float = 30.0):
self.threshold, self.cooldown_s = threshold, cooldown_s
self.failures, self.opened_at = 0, None
def record_failure(self, now: float) -> None:
self.failures += 1
if self.failures >= self.threshold and self.opened_at is None:
self.opened_at = now
def record_success(self) -> None:
self.failures, self.opened_at = 0, None
def closed(self, now: float) -> bool:
if self.opened_at is None:
return True
if now - self.opened_at >= self.cooldown_s:
self.opened_at, self.failures = None, 0 # half-open: allow a probe
return True
return False
class Tier:
def __init__(self, name: str, quality: int, call):
self.name, self.quality, self.call = name, quality, call
self.breaker = CircuitBreaker()
class DegradationLadder:
"""Tiers in descending quality. The response always names the tier that
produced it; a caller declaring min_quality gets a refusal rather than a
quietly worse answer."""
def __init__(self, tiers: list):
self.tiers = sorted(tiers, key=lambda t: -t.quality)
self.events: list[dict] = []
def complete(self, prompt: str, min_quality: int = 0, now=None) -> dict:
now = now if now is not None else time.monotonic()
attempted = []
for tier in self.tiers:
if tier.quality < min_quality:
continue
if not tier.breaker.closed(now):
attempted.append({"tier": tier.name, "skipped": "circuit open"})
continue
try:
text = tier.call(prompt)
except ProviderDown:
tier.breaker.record_failure(now)
attempted.append({"tier": tier.name, "failed": True})
continue
tier.breaker.record_success()
degraded = tier is not self.tiers[0]
self.events.append({"tier": tier.name, "degraded": degraded})
return {"text": text, "tier": tier.name, "quality": tier.quality,
"degraded": degraded, "attempts": attempted}
raise ProviderDown(
f"no tier at or above quality {min_quality} available: {attempted}")
if __name__ == "__main__":
def primary(p): raise ProviderDown("502 from primary")
def secondary(p): return f"secondary:{p}"
def local(p): return f"local-small:{p}"
ladder = DegradationLadder([
Tier("frontier", 100, primary),
Tier("secondary", 70, secondary),
Tier("local-small", 30, local)])
r = ladder.complete("summarise", now=0.0)
assert r["tier"] == "secondary" and r["degraded"] is True, r
assert r["attempts"][0]["failed"], r
# A caller that cannot accept degradation gets an error, not a worse answer.
strict = DegradationLadder([Tier("frontier", 100, primary),
Tier("local-small", 30, local)])
try:
strict.complete("x", min_quality=90, now=0.0)
raise AssertionError("served below the declared quality floor")
except ProviderDown:
pass
# The breaker opens after repeated failures and stops the retry storm.
t = Tier("flaky", 50, primary)
for i in range(3):
try:
t.call("x")
except ProviderDown:
t.breaker.record_failure(now=float(i))
assert not t.breaker.closed(now=3.0), "breaker should be open"
assert t.breaker.closed(now=40.0), "breaker should half-open after cooldown"
print("Degradation ladder + circuit breaker: OK")
print(f" served tier={r['tier']} degraded={r['degraded']}, "
f"events {len(ladder.events)}")
The SOX control, as code
Segregation of duties over model releases. This is the artifact an assessor asks for under SOX specifically — it is not the same control as the one above, and a system that implements one does not thereby implement the other. It executes under the same publish gate.
"""Segregation of duties over model releases, with an immutable approval chain.
SOX cares about change management over systems affecting financial reporting.
The control that fails is the one where the person who wrote the change also
approved and deployed it, and where the approval record can be edited after the
fact. Both are structural, so both are enforced here rather than reviewed.
"""
import hashlib
import json
class ApprovalChain:
"""Append-only. Each link commits to the previous digest, so an edited
record breaks verification rather than quietly rewriting history."""
def __init__(self):
self.links: list[dict] = []
def _head(self) -> str:
return self.links[-1]["digest"] if self.links else "genesis"
def append(self, action: str, actor: str, change_id: str) -> dict:
body = {"action": action, "actor": actor, "change_id": change_id,
"prev": self._head()}
digest = hashlib.sha256(
json.dumps(body, sort_keys=True).encode()).hexdigest()
link = dict(body, digest=digest)
self.links.append(link)
return link
def verify(self) -> bool:
prev = "genesis"
for link in self.links:
body = {k: link[k] for k in ("action", "actor", "change_id", "prev")}
if link["prev"] != prev:
return False
if hashlib.sha256(
json.dumps(body, sort_keys=True).encode()).hexdigest() != link["digest"]:
return False
prev = link["digest"]
return True
def actors(self, change_id: str, action: str) -> set[str]:
return {l["actor"] for l in self.links
if l["change_id"] == change_id and l["action"] == action}
class ReleaseGate:
def __init__(self, chain: ApprovalChain):
self.chain = chain
def author(self, change_id: str, actor: str) -> None:
self.chain.append("author", actor, change_id)
def approve(self, change_id: str, actor: str) -> None:
if actor in self.chain.actors(change_id, "author"):
raise PermissionError(
f"{actor} authored {change_id}; approval requires a second person")
self.chain.append("approve", actor, change_id)
def deploy(self, change_id: str, actor: str) -> dict:
if not self.chain.actors(change_id, "approve"):
raise PermissionError(f"{change_id} has no approval")
if actor in self.chain.actors(change_id, "author"):
raise PermissionError(f"{actor} authored {change_id}; cannot deploy it")
return self.chain.append("deploy", actor, change_id)
if __name__ == "__main__":
chain = ApprovalChain()
gate = ReleaseGate(chain)
gate.author("MODEL-2026-114", "r.khare")
try:
gate.approve("MODEL-2026-114", "r.khare")
raise AssertionError("self-approval was permitted")
except PermissionError:
pass
gate.approve("MODEL-2026-114", "a.controller")
try:
gate.deploy("MODEL-2026-114", "r.khare")
raise AssertionError("author deployed their own change")
except PermissionError:
pass
link = gate.deploy("MODEL-2026-114", "o.release")
assert chain.verify(), "chain must verify after a legitimate sequence"
assert link["action"] == "deploy"
try:
gate.deploy("MODEL-2026-999", "o.release")
raise AssertionError("deployed an unapproved change")
except PermissionError:
pass
# Tampering must be detectable, not merely discouraged.
chain.links[1]["actor"] = "r.khare"
assert not chain.verify(), "edited approval record still verified"
print("SOX segregation of duties + approval chain: OK")
print(f" links {len(chain.links)}, verifies_after_tamper={chain.verify()}")
Risk mitigation matrix
Each row carries an acceptance parameter rather than an adjective, because "low latency" cannot be signed off. Retention here is bound by per the data class retention schedule, enforced automatically.
| Category | Risk | Control | Acceptance parameter |
|---|---|---|---|
| SOX | A model version change silently alters a reported figure | Pin model version per reporting period; record version, prompt digest and output digest for anything touching a filing | Any reported figure reproducible from its recorded version and inputs; version changes gated by change control |
| Operational | Silent failover hides a quality drop from consumers | Every response names its tier and carries a degraded flag | 100% of responses labelled; degraded responses counted per hour |
| Operational | Retry storm against an already-failing provider | Circuit breaker opens after a threshold and cools down before a probe | No more than the threshold of calls to a failing tier per cooldown |
| Operational | A caller receives an answer below its acceptable quality | Declared quality floor; below it the ladder refuses rather than serves | 0 responses below a caller's declared floor; refusal raised instead |
| Cost control | Failover to a more expensive tier inflates spend | Tier order is quality-ranked and cost is recorded per tier per hour | Spend per tier visible; failover cost attributable |
| Latency SLA | Serial failover stacks timeouts and breaches the SLO | Per-tier timeout budget; the ladder's total is bounded | Total time bounded by the declared budget, measured at p95 |
| Operational | Recovery is assumed rather than verified | Half-open state admits a single probe before restoring rotation | One probe per cooldown; full restoration only after it succeeds |
| Data privacy | Failover sends data to a provider outside the contracted region | Tiers carry a residency attribute; out-of-region tiers excluded by policy | 0 failovers to a tier outside the contracted processing region |
Control questions before sign-off
- Reproduce last quarter's figure exactly, using the model version that produced it.
Version, prompt digest and output digest are recorded per reporting-relevant inference, and versions are pinned per period, so the figure is reproducible on demand. - When the primary provider fails, how does a downstream consumer learn the answer came from a weaker model?
The response names the tier that produced it and carries a degraded flag. A consumer reading the label can treat a degraded answer differently; silent failover is what this design exists to prevent. - What stops a failing provider from being retried thousands of times a minute?
The circuit breaker. After the failure threshold it opens and the tier is skipped entirely until the cooldown elapses, so a failing provider leaves rotation rather than absorbing retries. - Can a caller that requires top-tier quality be served a degraded answer?
No. The caller declares a minimum quality and tiers below it are never attempted — the ladder raises instead of serving, which is the correct outcome when no acceptable tier exists. - How do you know a recovered provider is actually healthy before restoring full traffic?
The breaker goes half-open after cooldown and admits a single probe. Full rotation is restored only after that probe succeeds, so recovery is tested rather than assumed. - What prevents failover from moving data outside the contracted region?
Each tier carries a residency attribute and policy excludes out-of-region tiers from the ladder, so a failover cannot quietly relocate processing.
Adjacent problems
- Part of enterprise ai compliance architecture.
- GDPR provider failover and degradation architecture for enterprise LLM covers the adjacent case.
- This pattern also governs SOC 2 Type II provider failover and degradation architecture.
- A different failure mode of the same component: ISO/IEC 27001:2022 provider failover and degradation architecture.
- PCI DSS 4.0 provider failover and degradation architecture for enterprise applies the same mechanism under a different obligation.
- If this is the blocker in front of you: enterprise AI infrastructure review.
Enterprise infrastructure review
If you are carrying this blocker, the useful next step is not a demo. It is a review of your actual request path against the control points above:
- Which of the 6 components exist in your estate today, and which are assumed
- Your current numbers against the 7 acceptance parameters, starting with p95 ≤ 600ms
- Which SOX control questions you cannot yet answer, and what closes each gap