Metraipolis › archive › dc_cbf8de39094c
Optimizing API Gateway Placement in Multi-Cloud Kubernetes — arXiv:2608.26573
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.26573
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T15:28:23.259Z
- SHA-256 of the archived text
ef61262bf8bf1bb0ffdfe9508616f8bd1efc07a59479c074ff169691e376951a- Stable URL of this page
https://metraipolis.com/documento/dc_cbf8de39094c
How to cite
Optimizing API Gateway Placement in Multi-Cloud Kubernetes — arXiv:2608.26573 — arXiv (en), https://arxiv.org/abs/2608.26573 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cbf8de39094c (Metraipolis archive dc_cbf8de39094c, sha256 ef61262bf8bf1bb0ffdfe9508616f8bd1efc07a59479c074ff169691e376951a)
BibTeX
@misc{dccbf8de39094c,
title = {Optimizing API Gateway Placement in Multi-Cloud Kubernetes — arXiv:2608.26573},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.26573},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cbf8de39094c; sha256 ef61262bf8bf1bb0ffdfe9508616f8bd1efc07a59479c074ff169691e376951a},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.26573. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The use of API gateways within geographically distributed multi-cloud Kubernetes clusters poses a tradeoff between infrastructure cost, computational resources, and network latencies. We present an optimization formulation that addresses API gateway placement as a capacitated facility location problem that jointly determines which candidate clusters to activate, how many gateway replicas to deploy, and how regional traffic should be distributed across the selected clusters. The formulation imposes an upper bound on estimated client-to-cluster network round-trip latency, excluding gateway processing, queuing, and backendservice latency, and incorporates a utilization headroom factor for gateway replica capacity. We present both a mixed-integer linear programming (MILP) formulation and a constructive greedy heuristic that ranks candidates according to incremental cost, comprising cluster-activation and marginal replica costs, per unit of assignable capacity while explicitly accounting for already committed load. Both formulations are applied to deterministic, seed-controlled, geography-based synthetic instances. For each problem size, 30 instances are generated with random seeds to analyze their performance. The greedy algorithm achieves an optimality gap of 3.2% to 4.7% to the MILP optimal solution, with a maximum observed gap of 25.0% for one particular instance, and a speedup of approximately 660x to 3,490x for 3 to 12 candidate clusters. In a canonical 10-candidate, 10-demand region instance, MILP-optimal deployment saves 24.2% in terms of monthly cost compared to the full-replication baseline. On the other hand, selecting the single cheapest candidate yields savings of 24.8% compared to the MILP optimum but does not satisfy the latency requirement for 3 out of 10 demand regions. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-08-28 in cs.DC). Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC). Pagina del lavoro: https://arxiv.org/abs/2608.26573 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-17T15:17:44.893Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-08-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).