Details

Adaptive Multi LLM Routing Under Cost Latency Quality Constraints

Saksham Rai

UC San Diego

102-111

Vol: 15, Issue: 4, 2025

Receiving Date: 2025-10-14 Acceptance Date:

2025-11-22

Publication Date:

2025-11-29

Download PDF

http://doi.org/10.37648/ijrst.v15i04.008

Abstract

Large language model services are increasingly offering heterogeneous portfolios of models, rather than a single universal endpoint. Each model inhabits a different point in a space of cost, latency, and quality, varying with prompt type, output length, system load and provider conditions. This paper formulates adaptive multi-LLM routing as a constrained contextual decision problem. A router estimates request-level quality, monetary cost, and tail latency for candidate models, selects the least costly feasible action, and escalates when confidence or verification signals are insufficient. The proposed architecture unifies an offline performance matrix, calibrated predictors, constrained policy, and online monitoring, and treats abstention, cascades and test-time sampling as first-class actions. Previous systems demonstrate massive savings, but production deployment involves explicit service-level constraints, drift-handling, and risk-sensitive evaluation beyond average accuracy. A practical evaluation protocol based on Pareto frontiers, constraint-violation rates, calibration and tail latency is presented and applied in an offline replay of GSM8K and MMLU with a weak and a strong model. At a quality floor of 90% of the strong model’s accuracy, a simple calibrated router reduces cost by 45% on GSM8K and 69% on MMLU, but thresholds tuned to just meet the floor violate it in about half of the evaluation splits; a conservative threshold rule lowers the violation rate to at most 1% while retaining savings of 29% and 62%, respectively. The analysis suggests that robust routing gains are derived less from a universally superior router, than from accurate uncertainty estimates, diverse candidate models, and disciplined feedback loops.

Keywords: large language models; model routing; constrained optimization; latency; inference cost; quality assurance; contextual bandits

References

  1. Boyd, S., & Vandenberghe, L. (2004). Convex Optimization. Cambridge University Press
  2. Chen, L., Zaharia, M., & Zou, J. (2023). FrugalGPT: How to use large language models while reducing cost and improving performance. Transactions on Machine Learning Research.
  3. Chen, S., Jiang, W., Lin, B., Kwok, J. T., & Zhang, Y. (2024). RouterDC: Query-based router by dual contrastive learning for assembling large language models. Advances in Neural Information Processing Systems, 37.
  4. Crankshaw, D., Wang, X., Zhou, G., Franklin, M. J., Gonzalez, J. E., & Stoica, I. (2017). Clipper: A lowlatency online prediction serving system. Proceedings of the 14th USENIX Symposium on Networked Systems Design and Implementation, 613–627.
  5. Dean, J., & Barroso, L. A. (2013). The tail at scale. Communications of the ACM, 56(2), 74–80.
  6. Ding, D., Mallick, A., Zhang, S., Wang, C., Madrigal, D., Garcia, M. D. C. H., Xia, M., Lakshmanan, L. V. S., Wu, Q., & Rühle, V. (2025). BEST-Route: Adaptive LLM routing with test-time optimal compute. arXiv:2506.22716
  7. Hu, Q. J., Bieker, J., Li, X., Jiang, N., Keigwin, B., Ranganath, G., Keutzer, K., & Upadhyay, S. K. (2024). RouterBench: A benchmark for multi-LLM routing system. arXiv:2403.12031.
  8. Jiang, D., Ren, X., & Lin, B. Y. (2023). LLM-Blender: Ensembling large language models with pairwise ranking and generative fusion. Proceedings of ACL 2023.
  9. Kwon, W., Li, Z., Zhuang, S., Sheng, Y., Zheng, L., Yu, C. H., Gonzalez, J. E., Zhang, H., & Stoica, I. (2023). Efficient memory management for large language model serving with PagedAttention. Proceedings of the 29th ACM Symposium on Operating Systems Principles.
  10. Li, L., Chu, W., Langford, J., & Schapire, R. E. (2010). A contextual-bandit approach to personalized news article recommendation. Proceedings of the 19th International Conference on World Wide Web, 661–670.
  11. Liang, P., Bommasani, R., Lee, T., et al. (2022). Holistic evaluation of language models. arXiv:2211.09110.
  12. Ong, I., Almahairi, A., Wu, V., Chiang, W.-L., Wu, T., Gonzalez, J. E., Kadous, M. W., & Stoica, I. (2024). RouteLLM: Learning to route LLMs with preference data. arXiv:2406.18665.
  13. Tran, C., Paracha, S., Hafeez, A., & Chen, S. (2025). Arch-Router: Aligning LLM routing with human preferences. arXiv:2506.16655.
  14. Cobbe, K., Kosaraju, V., Bavarian, M., Chen, M., Jun, H., Kaiser, L., Plappert, M., Tworek, J., Hilton, J., Nakano, R., Hesse, C., & Schulman, J. (2021). Training verifiers to solve math word problems. arXiv:2110.14168.
  15. Hendrycks, D., Burns, C., Basart, S., Zou, A., Mazeika, M., Song, D., & Steinhardt, J. (2021). Measuring massive multitask language understanding. International Conference on Learning Representations (ICLR 2021).
  16. Jiang, A. Q., Sablayrolles, A., Roux, A., Mensch, A., Savary, B., Bamford, C., et al. (2024). Mixtral of experts. arXiv:2401.04088.
  17. OpenAI. (2023). GPT-4 technical report. arXiv:2303.08774.
Back

Disclaimer: Indexing of published papers is subject to the evaluation and acceptance criteria of the respective indexing agencies. While we strive to maintain high academic and editorial standards, International Journal of Research in Science and Technology does not guarantee the indexing of any published paper. Acceptance and inclusion in indexing databases are determined by the quality, originality, and relevance of the paper, and are at the sole discretion of the indexing bodies.