Metraipolis › archive › dc_e7d6b0ea2665
PLB: Priority-Aware Load Balancing for Replicated Databases under Constrained Resources — arXiv:2608.06140
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.06140
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-31T10:50:03.811Z
- SHA-256 of the archived text
9a2143c6775fb6057a54b7a4fc71f1aded04efb49782be8c26951e4413eb40dd- Stable URL of this page
https://metraipolis.com/documento/dc_e7d6b0ea2665
How to cite
PLB: Priority-Aware Load Balancing for Replicated Databases under Constrained Resources — arXiv:2608.06140 — arXiv (en), https://arxiv.org/abs/2608.06140 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e7d6b0ea2665 (Metraipolis archive dc_e7d6b0ea2665, sha256 9a2143c6775fb6057a54b7a4fc71f1aded04efb49782be8c26951e4413eb40dd)
BibTeX
@misc{dce7d6b0ea2665,
title = {PLB: Priority-Aware Load Balancing for Replicated Databases under Constrained Resources — arXiv:2608.06140},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.06140},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e7d6b0ea2665; sha256 9a2143c6775fb6057a54b7a4fc71f1aded04efb49782be8c26951e4413eb40dd},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.06140. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Priority-differentiated services are a standard way for applications to offer different levels of performance, but database systems still often treat all sessions the same way. When database capacity is fixed, meaning replicas cannot be added on demand, and the workload becomes contended, this creates a difficult trade-off between over-provisioning resources and letting lower-priority users experience much larger slowdowns. In such settings, we propose enforcing priority by controlling how client sessions are assigned to database replicas. We present PLB, a priority-aware load balancer implemented as a JDBC driver that enforces priority differentiation through replica assignment under fixed resources. PLB partitions replicas by user group, premium versus freemium, and uses load-based borrowing so that higher-priority users can use idle capacity when available, while degradation for lower-priority users remains controlled. We evaluate PLB on a replicated read-only cluster under OLAP workloads. Compared with static dedicated per-priority partitions, PLB keeps utilization above about 70% in settings where fixed partitions can reduce cluster-wide CPU utilization to about 35%, while maintaining latencies close to those of the best dedicated allocation. Compared with a fully shared round-robin pool, PLB lowers high-priority median latency by about 12% on average, with improvements of up to 28%, while keeping the low-priority median overhead around 11% and overall median latency close to round-robin. Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-08-07 in cs.DB). Categorie arXiv: Databases (cs.DB) ; Distributed, Parallel, and Cluster Computing (cs.DC). Pagina del lavoro: https://arxiv.org/abs/2608.06140 — 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-31T10:36:13.371Z dalla pagina https://arxiv.org/catchup/cs.DB/2026-08-07?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).