<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Model Routing on Jaehun's Blog</title><link>https://jaehun.me/en/tags/model-routing/</link><description>Recent content in Model Routing on Jaehun's Blog</description><generator>Hugo</generator><language>en-US</language><lastBuildDate>Sat, 10 Oct 2026 09:26:52 +0900</lastBuildDate><atom:link href="https://jaehun.me/en/tags/model-routing/index.xml" rel="self" type="application/rss+xml"/><item><title>TokenRouter: Efficient Serving System for Token-Level LLM Routing</title><link>https://jaehun.me/en/posts/paper-2610-12242v1/</link><pubDate>Sat, 10 Oct 2026 00:00:00 +0900</pubDate><guid>https://jaehun.me/en/posts/paper-2610-12242v1/</guid><description>&lt;p&gt;&lt;a&#10; href="https://arxiv.org/abs/2610.12242v1"target="_blank"&#10; class="inline-flex items-center gap-1"&#10; &gt;Paper&lt;svg class="h-3 w-3 flex-shrink-0" id="external-link" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"&gt;&lt;path fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" d="M15 3h6v6m-11 5L21 3m-3 10v6a2 2 0 0 1-2 2H5a2 2 0 0 1-2-2V8a2 2 0 0 1 2-2h6"/&gt;&lt;/svg&gt;&#10; &lt;/a&gt;&lt;/p&gt;&#10;&lt;h2 id="tokenrouter-an-efficient-serving-system-for-token-level-llm-routing"&gt;TokenRouter: An Efficient Serving System for Token-Level LLM Routing&lt;a href="#tokenrouter-an-efficient-serving-system-for-token-level-llm-routing" class="heading-anchor" aria-label="Link to this section"&gt;&lt;/a&gt;&lt;/h2&gt;&#10; &lt;blockquote&#10; class="border-primary bg-muted/30 hover:bg-muted/40 my-6 rounded-r-lg border-l-4 py-4 pr-4 pl-6 italic transition-all duration-200 ease-out hover:translate-x-1"&#10; &gt;&#10; &lt;div class="prose prose-sm max-w-none"&gt;&#10; &lt;p&gt;&lt;strong&gt;TL;DR&lt;/strong&gt; — Routing an LLM at the &lt;em&gt;token level&lt;/em&gt; rather than the session/query level can substantially push out the cost–quality Pareto frontier, but it has been hard to put into practice on existing serving stacks (vLLM, SGLang) that are tied to a single-LLM assumption, due to step desynchronization, batch admission delay, and implementation complexity. Under the principle of &amp;ldquo;request-centric programming, model-centric execution,&amp;rdquo; TokenRouter introduces asynchronous subservers and a delayed batching scheduler, achieving &lt;strong&gt;2.01–64.15×&lt;/strong&gt; decoding throughput over existing implementations across five routing algorithms and several model pairs (source: §Abstract, §1).&lt;/p&gt;</description></item></channel></rss>