Routing LLM traffic across inference providers with TCP-style congestion control
All ArticlesRouting LLM traffic across inference providers by cost, speed and reliabilityProviders now sell the same open-weight models at very different prices and speeds. At the end of that post we were sending all GLM traffic to Baseten and using Fireworks as a failover.We have since replaced that setup with an adaptive router. It picks a provider for each request based on the cost and speed we measure in production, and it moves traffic away from a provider that starts returning errors.
- ▪All ArticlesRouting LLM traffic across inference providers by cost, speed and reliabilityProviders now sell the same open-weight models at very different prices and speeds.
- ▪At the end of that post we were sending all GLM traffic to Baseten and using Fireworks as a failover.We have since replaced that setup with an adaptive router.
- ▪It picks a provider for each request based on the cost and speed we measure in production, and it moves traffic away from a provider that starts returning errors.
Hacker News (AI / LLM) files mainly under ai. We currently carry 6,881 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | Getunblocked |
| Canonical URL | https://getunblocked.com/blog/adaptive-routing-inference-providers/ |
| Publication time | Tue, 29 Sep 2026 17:43:35 +0000 |
| Retrieval time | 2026-09-29T18:02:31.786Z |
| Last seen | 2026-09-29T18:02:31.786Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | AZUfbSf8p0oF · 1 stories |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
All ArticlesRouting LLM traffic across inference providers by cost, speed and reliabilityProviders now sell the same open-weight models at very different prices and speeds. We describe an adaptive router that keeps us on the cheapest provider that is fast and healthy, and moves our traffic when that changes, without an engineer involved.Peter WerrySep 29, 2026Engineering InsightsThe market for open-weight inference is heating up, and providers now sell the same models at very different prices and speeds.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at Getunblocked.
Discussion
0 commentsMore from Getunblocked
